The present disclosure relates to efficiently diagnosing remote calls between computer systems on a network. More particularly, the present disclosure relates to an approach of efficiently identifying nodes in a network path that are experiencing problems so that the node can be repaired and the path can be restored.
Calls from a client to a remote server make use of a variety of protocols, systems and applications. For a remote call to be successful, all components (or ‘nodes’) in the path from client to server have to be active, and configured correctly. Diagnosing problems associated with remote calls is therefore complex, and requires specific knowledge associated with each of the nodes that constitute the path from the client to the server. Because several nodes may be included in the path, identifying a failing node can be challenging and time consuming.
According to one embodiment of the present invention, an approach is provided in which a request addressed to a remote target node is transmitted through a serial network path. The serial network path includes multiple relay nodes. When a reply is not received, the transmitting system recognizes that the transmission of the first request failed. One or more of the relay nodes in the serial path are analyzed using a set of historical failure data that pertain to the relay nodes. A first relay node is identified as a likely failed relay node based on the analysis and the first relay node is tested by transmitting a test request. If the transmission of the test request fails, the identified likely failed node is verified by identifying a previous node in the serial network path that sends signals to the identified likely failed node, transmitting a second test request to the previous node, and selecting the identified likely failed node as the failed relay node in response to receiving a response to the second test request from the previous node. However, if the transmission to the previous node fails, then a second relay node is identified as the likely failed node based on the analysis and the testing, detecting, and verification steps are performed on the second identified likely failed node in response to failing to receive the response to the second test request.
The foregoing is a summary and thus contains, by necessity, simplifications, generalizations, and omissions of detail; consequently, those skilled in the art will appreciate that the summary is illustrative only and is not intended to be in any way limiting. Other aspects, inventive features, and advantages of the present invention, as defined solely by the claims, will become apparent in the non-limiting detailed description set forth below.
The present invention may be better understood, and its numerous objects, features, and advantages made apparent to those skilled in the art by referencing the accompanying drawings, wherein:
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, micro-code, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
The following detailed description will generally follow the summary of the invention, as set forth above, further explaining and expanding the definitions of the various aspects and embodiments of the invention as necessary. To this end, this detailed description first sets forth a computing environment in
Northbridge 115 and Southbridge 135 connect to each other using bus 119. In one embodiment, the bus is a Direct Media Interface (DMI) bus that transfers data at high speeds in each direction between Northbridge 115 and Southbridge 135. In another embodiment, a Peripheral Component Interconnect (PCI) bus connects the Northbridge and the Southbridge. Southbridge 135, also known as the I/O Controller Hub (ICH) is a chip that generally implements capabilities that operate at slower speeds than the capabilities provided by the Northbridge. Southbridge 135 typically provides various busses used to connect various components. These busses include, for example, PCI and PCI Express busses, an ISA bus, a System Management Bus (SMBus or SMB), and/or a Low Pin Count (LPC) bus. The LPC bus often connects low-bandwidth devices, such as boot ROM 196 and “legacy” I/O devices (using a “super I/O” chip). The “legacy” I/O devices (198) can include, for example, serial and parallel ports, keyboard, mouse, and/or a floppy disk controller. The LPC bus also connects Southbridge 135 to Trusted Platform Module (TPM) 195. Other components often included in Southbridge 135 include a Direct Memory Access (DMA) controller, a Programmable Interrupt Controller (PIC), and a storage device controller, which connects Southbridge 135 to nonvolatile storage device 185, such as a hard disk drive, using bus 184.
ExpressCard 155 is a slot that connects hot-pluggable devices to the information handling system. ExpressCard 155 supports both PCI Express and USB connectivity as it connects to Southbridge 135 using both the Universal Serial Bus (USB) the PCI Express bus. Southbridge 135 includes USB Controller 140 that provides USB connectivity to devices that connect to the USB. These devices include webcam (camera) 150, infrared (IR) receiver 148, keyboard and trackpad 144, and Bluetooth device 146, which provides for wireless personal area networks (PANs). USB Controller 140 also provides USB connectivity to other miscellaneous USB connected devices 142, such as a mouse, removable nonvolatile storage device 145, modems, network cards, ISDN connectors, fax, printers, USB hubs, and many other types of USB connected devices. While removable nonvolatile storage device 145 is shown as a USB-connected device, removable nonvolatile storage device 145 could be connected using a different interface, such as a Firewire interface, etcetera.
Wireless Local Area Network (LAN) device 175 connects to Southbridge 135 via the PCI or PCI Express bus 172. LAN device 175 typically implements one of the IEEE 802.11 standards of over-the-air modulation techniques that all use the same protocol to wireless communicate between information handling system 100 and another computer system or device. Optical storage device 190 connects to Southbridge 135 using Serial ATA (SATA) bus 188. Serial ATA adapters and devices communicate over a high-speed serial link. The Serial ATA bus also connects Southbridge 135 to other forms of storage devices, such as hard disk drives. Audio circuitry 160, such as a sound card, connects to Southbridge 135 via bus 158. Audio circuitry 160 also provides functionality such as audio line-in and optical digital audio in port 162, optical digital output and headphone jack 164, internal speakers 166, and internal microphone 168. Ethernet controller 170 connects to Southbridge 135 using a bus, such as the PCI or PCI Express bus. Ethernet controller 170 connects information handling system 100 to a computer network, such as a Local Area Network (LAN), the Internet, and other public and private computer networks.
While
The Trusted Platform Module (TPM 195) shown in
When remote target node 330, such as a remote server, etc., receives the request it acts on the request and transmits response 340 which is addressed back to calling node 300. In one embodiment, the transmission of response 340 back to calling node 300 follows the same network path 320 but in the reverse order (e.g., from relay node 324 to nodes 323, 322, 321, and finally back to calling node 300. However, if one of the relay nodes is not performing correctly (a failed relay node), the failure can cause the failed relay node to cease relaying data (requests and responses) as outlined above. When this occurs, calling node 300 will not receive the expected response (e.g., the response will not be received within a given timeout interval). A computer system, such as calling node 300, then diagnoses network path 320 by analyzing the relay nodes included in network path 320. In one embodiment, the analysis utilizes historical failure data 350 that pertains to the various nodes that are included in network path 320. As the name implies, historical failure data 350 includes a record of past failures that have occurred with the various relay nodes. A result of the analysis may reveal that a particular relay node has been experiencing a high level of failures (an identified likely failed node). The diagnostic routine can then test this likely failed relay node to determine whether it is the relay node that is currently failing (the failed relay node) irregardless of the likely failed relay node's position in network path 320. If the likely failed relay node is determined to be the failed relay node then corrective remedies can be applied to the failed relay node (e.g., rebooting the failed node, etc.) to correct the failure. On the other hand, if the likely failed relay node is tested and determined to be working (not failing), then analysis of the historical failure data can be used to identify other likely failed relay nodes based on past failure incidents and these likely failed relay nodes can be tested in order to identify the failed relay node. For detailed steps utilized in the historical node failure analysis see
In one embodiment, if analysis of historical failure data 350 does not reveal the failed relay node (e.g., historical node failure data does not include enough failure data for proper analysis, all likely failed relay nodes have been tested and found to be working, etc.), then a binary-split analysis is performed to identify the failed relay node. The binary-split analysis works utilizes a binary search-type algorithm to select a mid-point relay node, test the mid-point node and move either forward or back in the chain of relay nodes finding a new mid-point node and testing the new mid-point node. This is recursively performed until the failed node is identified. For detailed steps utilized in the binary-split analysis see
Returning to decision 450, if the historical failure analysis was unable to identify the failed relay node, then decision 450 branches to the “no” branch whereupon, at predefined process 460, a binary split analysis is performed in order to identify the failed relay node (see
A decision is made as to whether the node failure analysis identified any likely failed nodes (decision 530). If the analysis did not identify any likely failed relay node, then decision 530 branches to the “no” branch whereupon, at 540, processing returns to the calling routine (see
At step 550, the first node (e.g., most likely to have failed) identified by the analysis is selected. At step 560, the selected node is tested by sending a test request to the selected (likely failed) relay node. A decision is made as to whether the test failed (decision 570) based on whether a response was received from the request. If the test did not fail (a response was received from the selected node), then decision 570 branches to the “no” branch which loops back to determine if there are additional “likely failed” nodes identified by the historical failure analysis that need to be tested. On the other hand, if the test failed, then decision 570 branches to the “yes” branch whereupon, at step 580, the previous node in the serial network path is tested by sending a request to the previous node. The previous node is the node in the serial network path that directly relays requests to the selected node. A decision is made as to whether the test to the previous node also failed (decision 590) based on whether a response was received from the request. If the test did not fail (a response was received from the selected node), then decision 590 branches to the “no” branch whereupon, at 595, processing returns to the calling routine (see
On the other hand, if the test with the previous node failed (a response was not received from the previous node), then decision 590 branches to the “yes” branch which loops back to determine if there are additional “likely failed” nodes identified by the historical failure analysis that need to be tested. Processing keeps looping back until either the failed node is identified (with processing returning at 595) or until there are no more relay nodes to check based on the historical failure analysis, at which point decision 530 branches to the “no” branch and processing returns to the calling routine (see
A decision is made as to whether a binary split back is possible between the calling node and the remote target node (decision 620). Since this is the first run through the algorithm, a binary split back should be possible so that decision 620 branches to the “yes” branch whereupon, at step 630, a binary split back is performed to identify the mid-point relay node on the path between the calling node an the remote target node (e.g., roughly half of the relay nodes being between the calling node and the mid-point node and the other half being between the mid-point node and the remote target node). At step 640, the identified mid-point node is tested by sending a request to the identified mid-point node. A decision is made as to whether the test to the current mid-point node failed (decision 650). If the decision failed (indicating that the failed node is somewhere between the calling node and the current mid-point node), then decision 650 branches to the “yes” branch which loops back and determines if another binary split back is possible, this time between the calling node and the current mid-point node. If a split back is not possible, then decision 620 branches to the “no” branch whereupon, at step 680, the failed node is identified as being the current mid-point node and at 695 processing returns to the calling routine (see
Returning to decision 650, if the test of the current mid-point node does not fail, the test indicates that the failed node lies after the current mid-point node and before the remote target node. In this case, decision 650 branches to the “no” branch whereupon a decision is made as to whether a binary split forward is possible (e.g., a binary split between the current mid-point node and the remote target node so that roughly half of the relay nodes between these nodes are positioned before the new mid-point node and roughly half of the relay nodes between these nodes are positioned after the new mid-point node. If a binary split forward is possible, then decision 660 branches to the “yes” branch whereupon, at step 670, the binary split forward is calculated as described above and processing loops back to step 640 which tests the newly identified mid-point node. Once again, if the test fails, then decision 650 branches to the “yes” branch which loops back to determine if a binary split backward is possible and proceeds accordingly as outlined above.
Returning to decision 660, if a binary split forward is not possible, then decision 620 branches to the “no” branch whereupon, at step 680, the failed node is identified as being the current mid-point node and processing returns at 695 to the calling routine (see
While particular embodiments of the present invention have been shown and described, it will be obvious to those skilled in the art that, based upon the teachings herein, that changes and modifications may be made without departing from this invention and its broader aspects. Therefore, the appended claims are to encompass within their scope all such changes and modifications as are within the true spirit and scope of this invention. Furthermore, it is to be understood that the invention is solely defined by the appended claims. It will be understood by those with skill in the art that if a specific number of an introduced claim element is intended, such intent will be explicitly recited in the claim, and in the absence of such recitation no such limitation is present. For non-limiting example, as an aid to understanding, the following appended claims contain usage of the introductory phrases “at least one” and “one or more” to introduce claim elements. However, the use of such phrases should not be construed to imply that the introduction of a claim element by the indefinite articles “a” or “an” limits any particular claim containing such introduced claim element to inventions containing only one such element, even when the same claim includes the introductory phrases “one or more” or “at least one” and indefinite articles such as “a” or “an”; the same holds true for the use in the claims of definite articles.