US 7,353,259 B1Grant
Method and apparatus for exchanging configuration information between nodes operating in a master-slave configuration
Issue Date:2008-04-01
•23 Claims
•10 Drawing Sheets
Abstract
A node, within a networked computer system, is capable of supporting communications with other nodes relating to operating multiple application instances in a master-slave configuration. Each node periodically generates and sends a Heartbeat message that indicates the operational status and configuration information for one or more application instances being managed by the node. When a node receives a Heartbeat message from a remote node, it determines whether new configuration information should be obtained for each of the application instances the node is managing, and establishes a connection with a remote node that can access the new configuration information. The connection is an HTTP connection, in one embodiment. The node then requests and receives that new configuration information from the remote node. In one embodiment, the new configuration information is received in an XML format.
Metadata
Assignee
- Cisco Technology, Inc.
Inventors
- Mark A. Bakke
- James D. Muchow
- Craig A. Johnson
- Donald W. Teske
Application Information
Application Number:US 10/128,657
Filing Date:2002-04-22
Priority Date:2002-03-07
Art Unit:2144
Classifications
IPC:
G06F15/16G06F11/00G06F15/173
Patent Drawings (10 sheets)
Description
Related Application
[0001] This is a continuation-in-part of application Ser. No. 10/094,552, filed Mar. 7, 2002, entitled “Method and Apparatus for Exchanging Heartbeat Messages and Configuration Information Between Nodes Operating in a Master-Slave Configuration.”
Technical Field of the Invention
[0002] The present invention relates generally to methods for managing execution of multiple applications within a networked, multi-processor system, and more specifically, methods for exchanging configuration information between multiple, networked nodes, which execute applications using a master-slave configuration.
Background of the Invention
[0003] In some computer systems, it is important to maximize the availability of critical services and applications. Generally, this is achieved by using a fault tolerant system or by using high availability (“HA”) software, which is implemented on a cluster of multiple nodes. Both types of systems are described briefly in “A High-Availability Cluster for Linux,” Phil Lewis (May 2, 2000).
[0004] A fault tolerant computer system includes duplicate hardware and software. For example, a fault tolerant server may have redundant power supplies, storage devices, fans, network interface cards, and so on. When one or more of these components fails, the fault is detected, and a redundant component takes over to correct the problem. In many cases, fault tolerant systems are able to provide failure recovery which is nearly seamless (i.e., imperceivable to system users). However, because these systems rely on duplicate hardware, they tend to be expensive. In addition, these systems typically are proprietary, and are tightly coupled to the operating system, whatever that system may be.
[0005] HA software also provides fault detection and correction procedures. In contrast to fault tolerant systems, HA software is implemented on two or more nodes, which are arranged in a “cluster” and communicate over a link (e.g., a network). Typically, one node operates as the “master” for a particular application, where the master is responsible for executing the application. One or more other nodes within the cluster are “slaves” for that application, where each slave is available to take over the application from a failed master, if necessary.
[0006] Generally, an HA software implementation is loosely coupled to the operating system, and therefore may be more portable to different types of systems and nodes than a fault tolerant system would be. However, one disadvantage to an HA system is that failure recovery typically takes much longer than it would with a fault tolerant system. Therefore, significant system downtimes may be perceived by system users.
[0007] One reason for the relatively slow failure recovery times is the way that failures are detected and responded to. In some systems, each slave periodically “pings” other nodes to determine whether they are reachable. If a slave determines that a master node is unreachable before expiration of a certain timeout period, the slave declares a failure and attempts to take over as master. Because this process relies on timeout periods and network communications, it provides slower recovery than is possible using fault tolerant systems. Besides being somewhat slower to recover, another disadvantage to these systems is that it is not possible to detect a failure of a single application within a master node. Instead, the entire node must fail in order for a failure to be detected.
[0008] Alternatively, a node within an HA system may periodically send out a “heartbeat” message for an application that it is executing as a master. The heartbeat message indicates that the master node continues to be able to execute the application. If a slave node does not receive a heartbeat message for a particular application within a certain timeout period, then the slave assumes that the master has failed, and an election process is initiated to determine which slave should take over as master.
[0009] The “Time Synchronization Protocol” (TSP) is an example of such an HA protocol, which is used by the clock synchronization programs timed and TEMPO. TSP is described in detail in “The Berkeley UNIX Time Synchronization Protocol,” Gusella, et al. (1986). TSP supports messages for the election that occurs among slaves when, for any reason, the master disappears, as is described in detail in “An Election Algorithm for a Distributed Clock Synchronization Program,” Gusella et al. (December 1985). Basically, the election process chooses a new master from among the available slaves when the original master ceases to send out heartbeat messages.
[0010] The TSP protocol functions well in the context of supporting messages and elections that occur as part of a clock synchronization program. However, its portability to other types of applications is limited, and it is not well adapted to inclusion in modern systems for several reasons.
[0011] In modern networked computer systems, each machine may be capable of simultaneously running multiple applications, each of which is executed using a master-slave configuration. In such systems, it may be necessary to exchange status information between machines for each task and/or application. The primary limitation of TSP's application to modern systems is that TSP is capable of supporting message transfer for only a single application (e.g., a time daemon) per machine. Accordingly, TSP is not adapted to exchange status information for multiple tasks or applications between machines.
[0012] In addition, when a task or application has updateable configuration information associated with it, TSP has no facility to monitor or support the transfer of new configuration information between nodes. Therefore, TSP is not an acceptable protocol for providing status and configuration messaging capabilities for modern networked computer systems.
[0013] What is needed is a protocol and method that can provide efficient failure recovery and configuration information exchanges between nodes of a networked computer system. Further needed is a protocol and method that is scalable and efficient, so that configuration messaging between nodes can be performed for potentially many tasks and applications without burdening the network (or networks) with excessive network traffic.
Brief Description of the Drawing
[0014] FIG. 1 illustrates a typical computer system within which the various embodiments of the present invention can be practiced;
[0015] FIG. 2 is an example of an application instance state table in accordance with one embodiment of the present invention;
[0016] FIG. 3 illustrates a flowchart of a method for a node to generate and send a single instance Heartbeat message in accordance with one embodiment of the present invention;
[0017] FIG. 4 illustrates a flowchart of a method for a node to generate and send a multiple instance Heartbeat message in accordance with one embodiment of the present invention;
[0018] FIG. 5 illustrates a diagram of a multiple instance Heartbeat message format in accordance with one embodiment of the present invention;
[0019] FIG. 6 illustrates a flowchart of a method for a node to receive and process a heartbeat message in accordance with one embodiment of the present invention;
[0020] FIG. 7 illustrates a flowchart of a method for a new configuration task to execute in accordance with one embodiment of the present invention;
[0021] FIG. 8 illustrates a flowchart of a method for a node to format and send updated configuration information to a remote node in accordance with one embodiment of the present invention; and
[0022] FIG. 9 illustrates a general-purpose computer within which functions of the various embodiments can be practiced in accordance with one embodiment of the present invention.
Detailed Description of the Invention
[0023] Various embodiments of the present invention provide methods for operating a node, within a networked computer system, which is capable of supporting communications with other nodes relating to operating multiple application instances in a master-slave configuration. The node maintains a state diagram for each application instance currently running in the master-slave configuration on the node and on the other nodes. In addition, the node listens for new application instances that are discovered on the node and on the other nodes. The nodes can be interconnected using multiple networks.
[0024] Each node occasionally sends out a “Heartbeat” message (e.g., such as that shown in FIG. 5 ), which indicates the status of each master and/or slave that the node is operating or maintaining. In one embodiment, each Heartbeat message can include the status information for multiple masters and/or slaves. In addition, each node determines whether each application instance's configuration information is current, and requests new configuration information for an application instance when it is not current. The method and apparatus of the various embodiments could be used in almost any high-availability system where exchange of configuration information between nodes is desired. For example, the method and apparatus of the various embodiments could be used in a system that employs Cisco System's NHAP (Nuspeed High Availability Protocol), VRRP (Virtual Router Redundancy Protocol), or HSRP (Hot Standby Router Protocol). In addition, it could be used with various cluster servers (e.g., provided by Veritas or Microsoft) or with the IBM HACMP (High-Availability Cluster Multi-Processing) System.
[0025] FIG. 1 illustrates a typical computer system 100 within which the various embodiments of the present invention can be practiced. System 100 includes multiple nodes 102 interconnected by one or more communication networks 104. A “node,” as used herein, refers to a distinct processing element of a computer system, which could be co-located with or remote from other nodes of the computer system. For example, some or all of the multiple nodes 102 could be stand-alone computers within a networked computer system. Alternatively, some or all of the multiple nodes 102 could be processors that are co-located within a single computer or facility, and which are networked together.
[0026] Although FIG. 1 illustrates four nodes 102 and two networks 104, a system could include more or fewer nodes interconnected by more or fewer networks 104. An advantage to interconnecting nodes 102 using multiple networks is that it provides hardware redundancy. This means that, if one network fails for any reason, nodes 102 still can communicate using the remaining one or more functioning networks.
[0027] Messages relating to operating in the master-slave configuration are referred to herein as “master-slave messages.” In one embodiment, each node 102 sends some or all master-slave messages over multiple networks 104. Networks 104 could be any of various types of networks. For example, some or all networks 104 could be Ethernet links, DSL systems, telephone systems, the Internet, or combinations of these or other types of networks. In one embodiment, some or all of networks 104 are “bus” type networks, where each node connects to a single communication link. In bus type networks, when a node places a message on the network 104, the node 102 essentially “broadcasts” the message to all other nodes on the network 104. In another embodiment, some or all of networks 104 could be point-to-point networks, where message broadcasting is simulated.
[0028] Each node 102 includes one or more processors and one or more external network interfaces (e.g., ports). Each network interface allows a node 102 to send and receive messages from an external network 104. For example, a particular network interface could be an Ethernet port, fast Ethernet port, DSL port, or cable modem. In one embodiment, each network interface is a TCP/IP network interface, although other types of interfaces could be used, in other embodiments.
[0029] Each node 102 may be capable of running one or more different types of applications. In one embodiment, an application type can be virtually any type of software program that is executed using a master-slave configuration. For example, application types can include routers (e.g., IP and SCSI routers), login tasks, time synchronization tasks, and many other types of applications.
[0030] Some types of applications can initiate multiple “instances” of themselves on the same node, where an “application instance” is defined herein as a separately executable instance of a particular application type. An application instance can be, for example, a daemon, task, application program, or other type of software program that is executed by the node. For example, if a node is running an IP router, the node may simultaneously execute multiple instances of the router, where each instance is responsible for routing data between different destinations.
[0031] A node 102 that is primarily responsible for (i.e., actually “running”) an application instance is considered a “master” for that application instance, and all other nodes 102 are considered “slaves” (or “backups”) for that application instance. Any node 102 could be a master for one or more application instances, and/or a slave for one or more other application instances.
[0032] During steady state operations, only one master is present in the network for any particular application instance, and only the master actually executes the application instance's central task. The slaves, on the other hand, do not execute the application instance's central task, but are available to perform peripheral tasks and/or to take over the execution in the event that the master fails or resigns, for any reason. This situation is referred to as a “fail over,” where one of the slaves becomes the master for a particular application instance.
[0033] In one embodiment, during steady state operations, each node is aware of all application instances being executed in the network. Each node executes a task for those of the application instances that the node is a master or a slave. For convenience, this task is referred to as a “main master-slave task” or “main task,” although the term “task” is not meant to imply that the various embodiments are limited to use in any particular operating system. For the purposes of brevity and ease of description, the term “application instance” means any node function, operating system function, application or application instance whose communications relating to master-slave operation are being managed by a main task.
[0034] For each application instance, the main master-slave task on each node coordinates the transfer of state-related and “Heartbeat” messages between nodes, and also manages state transitions (e.g., master-to-slave, slave-to-candidate, etc.) in accordance with a defined state diagram.
[0035] Various aspects and details of the present invention will be depicted by FIGS. 2-9 and the associated description, below. First, the operation of the main master/state task will be described in conjunction with FIG. 2 .
[0036] Briefly, the main master-slave task is initialized upon boot up of the node or later. In one embodiment, the main task is then periodically invoked, and also invoked in response to receipt of a message, as will be described in detail below. The major functions of the main task are:
-
- [0037] 1) to initiate and maintain state machines for application instances operating in the master-slave configuration across the network; and
- [0038] 2) to respond to state timer timeouts, messages, and other events.
[0039] Initialization of the main task includes the creation of a table, referred to herein as an “application instance state table” or “state table.” The application instance state table indicates the current state of each application instance, across the network, which is being operated in the master-slave configuration. Accordingly, in one embodiment, the state table enables the main task to perform the first of its major functions, which is initiating and maintaining state machines for application instances across the network.
[0040] FIG. 2 is an example of an application instance state table 400 in accordance with one embodiment of the present invention. For each application instance, the table 400 has a field for the application type 402, application instance identifier (application ID) 404, current state 406, new configuration flag 414, and a configuration ID 416. As shown in FIG. 2 , the application type 402, application ID 404, new configuration flag 414, and configuration ID 416 are designated with integers, and the current state 406 is designated with ASCII values, although they could be designated with other types of characters (e.g., other types of arrays of signed or unsigned characters, or binary or hexadecimal values).
[0041] In one embodiment, each application instance is defined by two items of information: the application type 402; and the application ID 404. As its name implies, the application type 402 indicates the type of application (e.g., SCSI router, IP router, or other types) that the application instance corresponds to. In one embodiment, the designators used for the application type 402 are globally known, but they might not be, in another embodiment.
[0042] The application ID 404 is an identifier that uniquely identifies each application instance of a particular type to all nodes of the network. For example, the entry 420 having application type “433” has application ID “1037.” All nodes of a particular type would be able to uniquely identify the application instance by the application type “433” and application ID “1037.” Therefore, the combination of the application type 402 and application ID 404 enables the various nodes to communicate regarding particular application instances. In another embodiment, in which only one application type exists, the application type 402 is not used, and instead the node uses only the application ID 404 to identify the application instance. As indicated by entries 420 and 424, identical application IDs 404 can be assigned if their application types 402 are different. Thus, entries 420 and 424 have identical application IDs of “1037,” but different application types of “433” and “763,” respectively. The current state 406 indicates the state that each application instance is currently in. For example, in the example shown, entries 420, 422, and 426 are in the master state.
[0043] As mentioned previously, each slave attempts to maintain the most up to date configuration information, in one embodiment. Maintenance of current configuration information enables a slave to more rapidly take over as a master, if the need arises. Accordingly, in one embodiment, each entry in the application instance state table 400 also includes a new configuration flag 414 and a configuration ID 416.
[0044] These fields enable a node to determine whether or not the configuration information has changed for the corresponding application instance. A configuration change would be a change of the configuration information that is used by the master, and which should be used by the slaves, for a particular application instance. In one embodiment, a configuration change is indicated by the new configuration flag 414 corresponding to the selected entry. In other embodiments, a configuration change could be indicated by some other stored indicator or by a received message. As will be described in more detail later, the new configuration flag 414 is set during evaluation of a received Heartbeat message (see block 1022, FIG. 6 ), and is cleared by a new configuration task after the new configuration information has been received (see block 1214, FIG. 7 ).
[0045] The configuration ID 416 includes a value that uniquely identifies the most current configuration version that a node should be able to access. This enables the node to obtain the most current configuration version in the event that the new configuration flag 416 indicates that the node does not currently have the most current version.
[0046] Entries for various application instances are added to the table 400 upon boot up of the node, and also later, as various application instances are started on the node or discovered on the network. Once added to the table, an application instance is referred to herein as a “registered application instance.” In order for an application instance being run on the node to register itself, the application instance sends a message to the main task, which includes the application ID for the application. The main task, in turn, creates a table entry in the state table 400 for each of these “configured applications” (i.e., applications that are initialized and registered upon boot up). During operation, the main task can create new table entries, as well, for applications or application instances that are detected in other nodes, or that are started (e.g., automatically or from a console connected to the node) and register themselves after boot up.
[0047] In one embodiment, the node also maintains one entry (e.g., entry 428) in the null state, which is waiting to detect a new application instance within the node or elsewhere on the network. This entry corresponds to a “null application instance,” and not to any particular application type. Accordingly, the application type 402 and application ID 404 fields can be null or blank for this entry. Once a new application instance is discovered, the null state entry 428 will be assigned an application type 402 and application ID 404, and it will be transitioned out of the Null State toward either the slave state or the master state. As the above description indicates, state machines for application instances are initiated by adding entries to the state table 400.
[0048] Besides being defined by the application type and application ID, each application instance is also defined by a “cluster identifier” (cluster ID), in another embodiment. The cluster ID indicates to which “cluster” of application instances the particular application instance belongs. The concept of clusters enables grouping of application instances and/or application types.
[0049] The main master-slave task is executed periodically, and also can be executed upon the occurrence of some event (e.g., a monitor, resignation or message event). Basically, the main master-slave task is responsible for managing state transitions, and for receiving, processing, and sending out Heartbeat and other messages. This is achieved, in one embodiment, using an application instance state table, such as the table 400 described in conjunction with FIG. 2 .
[0050] FIG. 3 illustrates a flowchart of a method for a node to generate and send a single instance Heartbeat message in accordance with one embodiment of the present invention. The single instance Heartbeat message indicates that the associated master application instance is functioning properly. The method begins, in block 602, by determining whether an application instance has just been promoted to the master state.
[0051] If not, the method ends. If so, then a single instance Heartbeat message is generated, in block 604. A single instance Heartbeat message includes several items of information. Referring also to FIG. 5 , which will be described in more detail later, a single instance Heartbeat message includes a node identifier (field 810), a message type (field 812), and an application identifier (field 828). The node identifier (field 810) specifies the identity of the node that is sending the Heartbeat message. The message type (field 812) indicates that the message is a Heartbeat message. Finally, the application identifier (field 828) specifies the identity of the application instance that was just promoted to the Master State. In one embodiment, the Heartbeat message includes other fields, as well, but those fields will be described in more detail later.
[0052] Referring back to FIG. 3 , after the single instance Heartbeat message has been generated, the node sends the Heartbeat message out over one or more networks, in block 604, and the method ends. In an alternate embodiment, the node could wait until a later time before it sends out the message.
[0053] FIG. 4 illustrates a flowchart of a method for a node to generate and send a multiple instance Heartbeat message in accordance with one embodiment of the present invention. A multiple instance Heartbeat message includes a “heartbeat segment” for at least one, and potentially many, master and/or slave application instances. Each heartbeat segment included in the message indicates that the associated master or slave application instance is functioning properly.
[0054] The method begins, in block 702, by determining whether it is time to generate a multiple instance Heartbeat message. This is indicated, in one embodiment, when at least one of the application instances was a master or slave application instance that had timed out. In addition or alternatively, the method could have set aside all information necessary to build a heartbeat segment for each master or slave application instance. If it is determined, in block 702, that it is not time to generate a multiple instance Heartbeat message, then the method ends.
[0055] If it is determined that it is time to generate a multiple instance Heartbeat message, then a determination is made, in block 704, whether the Heartbeat message is identical to the last multiple instance Heartbeat message sent out by the node (e.g., during the last time the main master-slave task was executed). In one embodiment, each transmitted Heartbeat message is saved (e.g., in block 712, described later) until it becomes necessary to generate a new Heartbeat message.
[0056] The determination of block 704 is made, in one embodiment, by checking a “heartbeat change flag.” The flag is cleared (e.g., in block 714, described later) each time a new multiple instance Heartbeat is sent out. The flag is set, for example, when a configuration has changed for an application instance, or when an application instance enters or leaves the Master State or the Slave State (e.g., in block 518, FIG. 5 ), or when one or more application instances fail as a master or are incapable of being a slave. In such cases, a new heartbeat segment would be needed for the application instance, and thus the next Heartbeat message would be different.
[0057] If block 704 indicates that the new Heartbeat message is identical to the previously sent Heartbeat message, then the previously sent Heartbeat message is retrieved and sent, in block 706, and the method ends. If block 704 indicates that the new Heartbeat message is not identical to the previously sent Heartbeat message, then a new Heartbeat message is generated in blocks 708-714.
[0058] In block 708, a heartbeat segment is built for the first (or next) master or slave application instance having an expired state timer. Referring again to FIG. 5 , and similar to the single instance Heartbeat message, each multiple instance Heartbeat message has a node identifier 810, a message type 812, and one or more application identifiers 828. The node identifier 810 and the message type 812 are included in a Heartbeat message header 802. The application identifier 828 is included in a heartbeat segment 806. In one embodiment, the application identifier 818 is obtained from the application instance state table (e.g., table 400, FIG. 2 ), although it could be obtained elsewhere.
[0059] Each Heartbeat message includes a single header 802 and one or more heartbeat segments 806. Accordingly, for a single instance Heartbeat message, only a single heartbeat segment 806 is included. For a multiple instance Heartbeat message, a heartbeat segment 806 is included for each master and/or slave application instance whose state timer expired. This means that a multiple instance Heartbeat message could include from one to many heartbeat segments 806. A more detailed description of FIG. 5 is given later.
[0060] In one embodiment, if the Heartbeat message is at all different from the previously sent Heartbeat message, then all heartbeat segments are rebuilt, regardless of whether each individual segment would be different. In another embodiment, only those heartbeat segments that are different are rebuilt.
[0061] After building the heartbeat segment for the next master or slave application instance, a determination is made, in block 710, whether all segments have been built. For example, all segments would be considered built if a segment had been built for each timed out master and/or slave application instance in the application instance state table (e.g., table 400, FIG. 2 ). If all segments have not been built, then the procedure iterates as shown.
[0062] If all segments have been built, then the Heartbeat message is completed and saved, in block 712. Completing the Heartbeat message includes concatenating the header (e.g., header 802, FIG. 5 ) with the heartbeat segments (e.g., segment 806, FIG. 5 ), and adding other information or addressing layers, as needed. In another embodiment, the header could be built at an earlier time.
[0063] In block 714, the heartbeat change flag, which was evaluated in block 704, is then cleared, in one embodiment. As described previously, the heartbeat change flag can be used to determine whether something has occurred (e.g., a configuration change, state transition or application instance failure) that would somehow change the next Heartbeat message to be sent out. The Heartbeat message is then sent out over one or more networks, in block 716. In an alternate embodiment, the node could wait until a later time before it sends out the message. After sending out the Heartbeat message, the method ends.
[0064] FIG. 5 illustrates a diagram of a multiple instance Heartbeat message format in accordance with one embodiment of the present invention. In one embodiment, each message field 810-832 is in a long-word aligned, 32-bit format, rather than an 8-bit byte format, as was used for the TSP protocol of the prior art. Accordingly, the message format of this embodiment is better suited for modern computers, which work more efficiently on long-word aligned messages. The format makes message creation and processing easier, and avoids masking and shifts, to a large extent. In other embodiments, the message fields could have more or fewer bits, as is appropriate for the network and computer systems upon which the present invention is implemented.
[0065] The Heartbeat message format includes a header 802 and a payload. In one embodiment, the payload consists of one or more heartbeat segments 806. For a single instance Heartbeat message, only a single heartbeat segment 806 exists in the message. For a multiple instance Heartbeat message, anywhere from one to many heartbeat segments 806 are concatenated together within the message. Because the number of heartbeat segments 806 can vary from message to message, a heartbeat segment count field 822 is also present in the Heartbeat message. Basically, the segment count 822 indicates how many heartbeat segments 806 are present in the Heartbeat message. The segment count 822 could be, but is not necessarily, part of the header 802. The header 802 includes several fields: a node identifier 810; message type 812; payload length 814; version number 816; extended header length 818; cluster identifier length 820; and cluster identifier 821. The node identifier field 810 includes a value, which uniquely identifies the node from which the message was sent. The message type field 812 includes a value, which indicates what type of command or response the message is.
[0066] The payload length field 814 includes a value, which indicates the total size of the message's payload. This allows the node to perform buffer size comparisons against the size of the message payload to be processed. In some cases, elements of the payload may be zero-padded. In one embodiment, the length of the zero padding is included in the payload length. In another embodiment, the payload length field 814 could be used as a message length field and could include a value indicating the length of the entire message being processed, rather than just the payload length. As described above, the heartbeat message has a format that allows multiple heartbeat segments to be included within the heartbeat message, and the payload length field 814 enables the number of segments to be determined. In other embodiments, the number of heartbeat segments could be indicated in some other way (e.g., by including an integer value that indicates the number of segments).
[0067] The version number field 816 includes a value, which indicates the protocol version number of the message. For example, the initial version of the protocol could have a version number of “1.” Future updated versions, which could include changes to message contents or format, would have higher (or different) version numbers. The version number enables the receiving node to know the protocol version on which the node should base its processing of the message.
[0068] Similarly, the extended header length field 818 includes a value, which indicates how much longer the header 802 is for the new protocol version, if at all longer. For the initial version, the value would likely be “0.” By including the version number field 816 and the extended header length field 818, nodes that cannot process all the elements of the current version of the protocol are still able to process those fields that are known. Accordingly, the header format enables both backward and forward compatibility.
[0069] In one embodiment, the header 802 also includes two fields 820, 821, which help to identify a “cluster” of nodes for which the message is pertinent. A cluster is a named, virtual group of nodes, interconnected by one or more networks. The nodes in a cluster send each other Heartbeat messages and act as masters and slaves for each other for various application instances. The concept of clusters enables grouping of application instances and/or application types. In one embodiment, each node is a member of only one cluster. In other embodiments, a node could be a member of more than one cluster.
[0070] The cluster for which the message is pertinent is identified in a cluster identifier field 821 of header 802. In one embodiment, the cluster identifier is an array of unsigned characters that is padded out to the nearest long word address. Therefore, the cluster identifier field 821 may contain one or more bits of padding (e.g., zero padding). In order to identify the length of the cluster identifier, the header 802 also includes a cluster identifier length field 820, in one embodiment. The cluster identifier length specifies the true length of the cluster identifier, minus any padding.
[0071] As described previously, each message also includes a payload that consists of one or more heartbeat segments 806. In one embodiment, the heartbeat segment 806 includes several fields: a master flag 823; a sequence number 824; application identifier length 826; application identifier 828; an application configuration identifier field 830 and a preferred slave field 832. In other embodiments, these fields could be in different orders, and/or some fields could be excluded, and/or other fields could be included in the message.
[0072] The master flag 823 includes a value, which indicates whether the node that created the message (as identified by node ID 810) is the master of the application instance associated with the heartbeat segment. In one embodiment, the flag 823 is set if the node is the master, and is cleared if the node is a slave.
[0073] It is not imperative that messages receive responses, in accordance with one embodiment. However, certain message exchanges do hope for a request-response sequence. Therefore, in one embodiment, a sequence number is included with some or all messages. In one embodiment, no responses are expected for Heartbeat messages. Therefore, a sequence number may or may not be included in the message. Regardless, the sequence number is described in detail below.
[0074] The sequence number field 824 includes a sequence number, which is incremented for every request message that a master creates and sends for a particular application instance. In one embodiment, slaves do not maintain a sequence number to identify requests that it sends, because slaves rarely (or never) send such requests. In another embodiment, each slave does maintain a sequence number for requests that it sends. In still another embodiment, sequence numbers are not needed, and therefore are not used by masters or slaves at all.
[0075] A response that a slave makes to the master's request message uses the same sequence number that was in the master's request message. Therefore, the sequence number enables the master to associate a slave's response to the associated, previously-sent request.
[0076] In one embodiment, each slave keeps track of a master's sequence number for each application instance. This enables a slave to avoid reacting to or responding to previously received messages. In other words, the sequence number enables the slave to identify duplicate messages, such as duplicate messages that a master sends out on multiple networks.
[0077] In one embodiment, when a slave is promoted to a master for an application instance, the slave uses an incremented continuation of the sequence number used by the previous master. By using a continuation of the sequence number, other slaves will not reject the new master's messages as having been previously sent or unrecognized.
[0078] The application instance for which the message is pertinent is identified in an application identifier field 828. In one embodiment, the application identifier includes the application type and the particular application instance ID to which the message pertains (i.e., the destination application instance). The application identifier is an array of unsigned characters that is padded out to the nearest long word address. Therefore, the application identifier field 828 may contain one or more bits of padding (e.g., zero padding). In order to identify the length of the application identifier, the heartbeat segment 806 also includes an application identifier length field 826, in one embodiment. The application identifier length specifies the true length of the application identifier, minus any padding.
[0079] The application configuration identifier field 830, which forms a portion of a heartbeat segment 806, indicates an identifier of the current configuration of the database, if any, that a master is using for a particular application instance. This enables slaves to determine whether the configuration information that they are using is correct or is outdated. In the event that the configuration information that a slave is using is outdated, the slave node can request the correct configuration information from the master or elsewhere. The process of evaluating and requesting configuration information is described in detail later.
[0080] Finally, the heartbeat segment 806 includes a preferred slave field 832. The preferred slave field 832 includes a value that identifies which of the potential slaves is preferred as the new master, in the event that the current master resigns or is unable to continue serving as the master for an application instance.
[0081] Although the description of FIG. 5 , above, specifies a number of different message fields 810-832 arranged in a certain order, more, fewer or different message fields could be included in other embodiments, and these message fields could be arranged in different orders than the order shown in FIG. 5 .
[0082] As described previously, the main master-slave task can execute periodically or the task can execute when an event occurs (e.g., a monitor, resignation or message event). A message event can be, for example, a receipt of a message from a remote node that warrants a state transition in the local node.
[0083] FIG. 6 illustrates a flowchart of a method for a node to receive and process a Heartbeat message in accordance with one embodiment of the present invention. In one embodiment, receiving a Heartbeat message from a remote node is considered a message event, which causes the main master-slave task to be invoked. The method begins after a Heartbeat message has been received from a remote node. After the message has been validated, a heartbeat segment is selected for processing, in block 1002. The message is considered valid, for example, if the header information indicates that the message is a Heartbeat message from a remote node.
[0084] As described previously, a heartbeat segment (e.g., segment 806, FIG. 5 ) is a segment of the message that pertains to a particular application instance. In one embodiment, the first heartbeat segment following the message's header is initially selected for processing. During later iterations of the method, if any are necessary, the next sequential heartbeat segment is selected for processing, and so on. In another embodiment, the heartbeat segments could be selected in a different order.
[0085] In block 1004, a determination is made whether the remote application instance identified in the heartbeat segment (e.g., by the application identifier 828, FIG. 5 ) is known to the local node. In one embodiment, the remote application instance would be known if an entry with the same application identifier (e.g., field 404, FIG. 2 ) exists in the application instance state table (e.g., table 400, FIG. 2 ) stored at the local node.
[0086] If the remote application instance is not known, then the local node creates a new remote instance and indicates that new configuration information is needed, in block 1006. In one embodiment, this is done by adding a new table entry to the application instance state table, where the new entry includes the application identifier (e.g., in field 404, FIG. 2 ) of the remote instance, and where the state (e.g., field 406, FIG. 2 ) of the instance is set to “slave.” In addition, the new configuration flag (e.g., field 414, FIG. 2 ) is set to indicate that the node should obtain configuration information, if any, for the new application instance. In one embodiment, the system (e.g., the operating system) is notified that a new application instance exists, which gives the system the opportunity to allocate memory and/or other resources, if necessary.
[0087] If, as determined in block 1004, the remote instance is known, then a determination is made, in block 1008, whether the remote instance is a master. In one embodiment, this determination is made by checking a master flag (e.g., flag 823, FIG. 5 ) within the heartbeat segment 806. If the flag is set, then the remote instance is presumed to be the master for the application instance, in one embodiment. If the flag is cleared, then the remote instance is presumed not to be the master. If the remote instance is not master, then new configuration information is not needed and the process proceeds to block 1024, described later, to process the next heartbeat segment, if any.
[0088] If the remote instance is master, as determined in block 1008, then a determination is made, in block 1020, whether the configuration information for the application instance is considered current. This determination is made, in one embodiment, by comparing the application configuration identifier (e.g., field 830, FIG. 5 ) corresponding to the remote application instance with a stored configuration identifier for the local application instance (e.g., in field 416, FIG. 2 ). If the configuration information is current, then the process proceeds to block 1024, described later. If the comparison indicates that the local node does not have the newest configuration information for the application instance, then an indication is made, in block 1022, that a new configuration is needed. In one embodiment, this is done by setting a new configuration flag (e.g., flag 414, FIG. 2 ) and changing the configuration ID (e.g., field 416, FIG. 2 ) to the new configuration identifier, which was included in the heartbeat segment.
[0089] After the heartbeat segment has been evaluated, in blocks 1002-1022, a determination is made, in block 1024, whether all heartbeat segments (e.g., all segments 806, FIG. 5 ) within the received Heartbeat message have been evaluated. In one embodiment, this is done by comparing the number of heartbeat segments evaluated with the heartbeat segment count 822 (FIG. 5 ) within the Heartbeat message. If all heartbeat segments have not been evaluated, then the next heartbeat segment is selected for evaluation, in block 1002, and the method iterates as shown. If all heartbeat segments have been evaluated, then the method ends. As described previously, a single instance Heartbeat message would include only one heartbeat segment. For such a message, only one iteration of the method would be performed. In contrast, a multiple instance Heartbeat message could include from one to many heartbeat segments, so from one to many iterations of blocks 1002-1022 would be performed.
[0090] As described previously, in one embodiment, a separate “monitor task,” exists to monitor, for correct operation, those application instances that are in the master state on the node. In addition, the monitor task can monitor the operation of the node itself and/or various functions or components associated with the node (e.g., the CPU, memory, operating system, temperature or radiation sensor, power supply, etc.). For ease of description, the term “application instance” is meant to refer to any entity that is being monitored by the monitor task, including but not limited to, applications, application instances, the node, and/or various software or hardware components associated with the node. Each application instance that wants to be monitored for correct operation “registers” itself by sending a message to the main task. This message identifies the application instance, and also includes the criteria that the monitor task should use to determine whether or not the application instance is operating correctly. The operating system and/or the node itself can also ask the monitor task to monitor particular functions for correct operation, in one embodiment. For example, the node may ask the monitor task to periodically check the value of a sensor that measures the temperature of the node, a component, or the atmosphere. As another example, the operating system may ask the monitor task to periodically check certain performance metrics, such as operating system throughput, for example.
[0091] FIG. 7 illustrates a flowchart of a method for a new configuration task to execute in accordance with one embodiment of the present invention. In one embodiment, the method begins, in block 1202, when a determination is made that it is time for the configuration update task to run. The new configuration task could be run upon the occurrence of some event, in one embodiment. For example, a node could receive a message indicating that a new configuration is available, and that message could invoke execution of the new configuration task. Alternatively, the node could send an internal message indicating that a configuration is not current or has been corrupted, which also could invoke the configuration task.
[0092] In other embodiments, the new configuration task could be run periodically (e.g., upon expiration of a timer) or as part of the main master-slave task. In the latter case, it would be time for the new configuration task to run when it is time for the main master-slave task to run. In such an embodiment, some of the blocks shown in FIG. 7 would not be necessary, as they would already be performed as part of the main master-slave task.
[0093] If it is time for the configuration update task to run, then the next entry in the application instance state table (e.g., table 400, FIG. 2 ) is selected, in block 1204. In one embodiment, entries are evaluated in a top-down, sequential order, although the entries could be evaluated in a different order as well.
[0094] A determination is then made, in block 1206, whether a configuration change has occurred. A configuration change would be a change of the configuration information that is used by the master, and which should be used by the slaves, for a particular application instance. In one embodiment, a configuration change is indicated by evaluating the new configuration flag 414 (FIG. 2 ) corresponding to the selected entry. In other embodiments, a configuration change could be indicated by some other stored indicator or by a received message.
[0095] If a configuration change is indicated, then information is identified, in block 1208, which enables the local node (e.g., the slave) to obtain the updated configuration information from a remote node (e.g., the master or some other node). In one embodiment, this information includes the remote node address (e.g., the address of the master), the application identifier (e.g., application ID 404, FIG. 2 ), and the configuration identifier (e.g., configuration ID 416, FIG. 2 ) for the new configuration.
[0096] In block 1210, the local node establishes a connection with the remote node, specifically for the purpose of exchanging configuration information. This connection, referred to as a “data retrieval connection,” is distinct from the interconnections between the various nodes for the purpose of exchanging master-slave type messages. However, the data retrieval connection can be made over one of the same networks that is used for master-slave type messages. Alternatively, the data retrieval connection can be made over a separate and distinct communication path.
[0097] In one embodiment, the data retrieval connection is an HTTP (Hyper-Text Transfer Protocol) connection, or a secure HTTP connection (e.g., HTTP over SSL (Secure Sockets Layer) or TLS (Transport Layer Security)). In alternate embodiments, the connection could be FTP (File Transfer Protocol), TFTP (Trivial FTP), or some other type of data retrieval connection.
[0098] Once the connection is established, the local node requests updated configuration information from the remote node, in block 1212. Eventually, the updated configuration information should be received by the local node, in block 1214. Upon receipt, the updated configuration information is stored, in block 1216. In addition, the stored configuration identifier associated with the application instance is changed to reflect the configuration identifier associated with the updated configuration information.
[0099] In one embodiment, the updated configuration information is sent by the remote node and received by the local node in a self-describing structured text format, which includes tags that specify attribute names. For example, the configuration information could be sent in the standard XML (Extensible Markup Language) format or some other proprietary or standard format. One advantage to formatting the configuration information using a structured text format is that it supports various data types and hierarchical data structures.
[0100] In one embodiment, upon receipt of the updated configuration information, the configuration identifier is re-computed locally to ensure that the updated configuration information is intact and correct. If it is not intact or correct, the out-of-date indicator remains in force.
[0101] As long as the updated configuration information is verified, and is received within any applicable time limits, then the new configuration task indicates receipt of the new configuration information in block 1218. In one embodiment, receipt of the updated configuration information is indicated by clearing the new configuration flag (e.g., flag 414, FIG. 2 ).
[0102] If no configuration change is indicated for the selected entry in block 1206, or after indicating receipt of the new configuration information in block 1218, a determination is made whether the selected entry is the last entry in the application instance state table (e.g., table 400, FIG. 2 ), in block 1220. If not, the procedure iterates as shown. If so, then the procedure ends.
[0103] FIG. 8 illustrates a flowchart of a method for a node to format and send updated configuration information to a remote node in accordance with one embodiment of the present invention. The method is performed by a node that has access to updated configuration information, which the remote node is seeking to obtain.
[0104] The method begins, in block 1302, when the local node establishes a “data retrieval connection” (as described in conjunction with FIG. 7 ) with the remote node, specifically for the purpose of exchanging configuration information. In one embodiment, establishment of the connection would be initiated by the remote node that is seeking to obtain the updated configuration information.
[0105] Once the connection is established, the local node receives a request for the updated configuration information from the remote node, in block 1304. The node then retrieves the updated configuration information from a local or remote data storage device, in block 1306.
[0106] In one embodiment, the node then produces formatted configuration information, in block 1308, and sends the formatted configuration information to the remote node over the configuration connection, in block 1310. In one embodiment, the node formats the updated configuration information using a self-describing structured text format (e.g., XML). After sending the formatted configuration information to the remote node, the method ends.
[0107] The functions of the various embodiments can be practiced on a general- or special purpose computer system. FIG. 9 illustrates a general-purpose computer system 1400 (e.g., a node) within which functions of the various embodiments can be practiced in accordance with one embodiment of the present invention. The computer system is housed on one or more PC boards, and includes one or more microprocessors 1402, power supplies 1406, storage media 1408, and from one to N interfaces 1410 to outside networks. In one embodiment, each of these devices is coupled to one or more busses 1404, so that signals and power can be exchanged between devices. In alternative embodiments, each of the devices could be coupled together through different connections.
[0108] Interfaces 1410 provide network connections between computer 1400 and one or more networks. Accordingly, interfaces 1410 enable the exchange of messages and information between computer 1400 and other nodes relating to operating one or more application instances in a master-slave configuration. These messages are processed and/or created by one or more microprocessors 1402 or other processing devices, in one embodiment. In addition microprocessor 1402 executes the main master-slave task, the monitor task, and the new configuration task, at various times, in accordance with the various embodiments of the invention.
[0109] Besides executing the various embodiments on a general-purpose computer system, computer executable instructions for performing the methods of the various embodiments can be stored on one or more computer readable media. For example, such computer executable instructions can be stored on RAM, ROM, hard drive, CD, magnetic disk, disk drive, a combination of these types of storage media, and/or other types of storage media that are well known to those of skill in the art.
Conclusion
[0110] Various embodiments of methods for supporting communications between multiple nodes operating in a master-slave configuration have been described. The various embodiments have numerous advantages over prior art methods and apparatus. For example, the methods of the various embodiments enable multiple application instances within a single node to be managed using a master-slave configuration, rather than managing only a single application instance, as was possible with the prior art. In addition, the various embodiments can continually listen for and begin managing new application instances within the node or in other nodes. The methods and apparatus of the various embodiments also are easily scalable from 2 to N nodes, without changing the design or implementation of the protocol.
[0111] Besides providing an automatic and scalable means of updating and synchronizing existing configurations, the method and apparatus of one embodiment of the present invention also can automatically propagate (and instantiate) new application instances to a node (or any number of nodes) that joins a cluster and that did not previously manage that application instance. This means that a user can introduce a new node into a given cluster, and all applications (and their configurations) will automatically migrate to and be created on that node. At that point, the new node will be able to take part in any failover operations in the defined cluster.
[0112] Besides these advantages, each node efficiently maintains accurate configuration information by exchanging formatted configuration data over data retrieval connection between the local and a remote node. The methods and apparatus of the present invention provide numerous other advantages over the prior art, as well.
[0113] In the foregoing detailed description of the preferred embodiments, reference is made to the accompanying drawings, which form a part hereof, and in which are shown by way of illustration specific preferred embodiments in which the invention may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice the invention. It will be appreciated by those of ordinary skill in the art that any arrangement, which is calculated to achieve the same purpose, may be substituted for the specific embodiments shown.
[0114] This application is intended to cover various adaptations or variations of the present invention. The foregoing detailed description is, therefore, not to be taken in a limiting sense, and it will be readily understood by those skilled in the art that various other changes in the details, materials, and arrangements of the parts and steps, which have been described and illustrated in order to explain the nature of this invention, may be made without departing from the scope of the invention as expressed in the adjoining claims. Therefore, all such changes are intended to fall within the scope of the present invention.
Claims
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A method for maintaining configuration information at a first node, wherein the first node is connected by one or more networks to one or more other nodes which operate in a master-slave configuration, the method comprising:
determining with a multiple instance heartbeat message including multiple configuration identifier fields whether configuration information for an application instance being managed by the first node is current, wherein the application instance is operating on the first node in at least one of a master and a slave configuration;
if the configuration information at the first node is not current, establishing a Hyper-Text Transfer Protocol (HTTP) connection with a remote node of the one or more other nodes from which updated configuration information can be obtained;
requesting the updated configuration information from the remote node; and
receiving the updated configuration information, the updated configuration information including a configuration identifier and providing data for operation of the application instance.
2. The method as claimed in claim 1, wherein determining whether the configuration information is current comprises:
receiving the multiple instance heartbeat message, which includes a configuration identifier field associated with the application instance;
comparing a first configuration identifier within the configuration identifier field with a stored configuration identifier that identifies current configuration information being used by the first node for the application instance; and
if the first configuration identifier identifies a different version of configuration information than the stored configuration identifier, determining that the configuration information is not current.
3. The method as claimed in claim 1, wherein determining whether the configuration information is current comprises:
receiving the multiple instance heartbeat message, wherein each of the multiple configuration identifier fields is associated with one of multiple application instances being managed by the first node in the master-slave configuration;
comparing a first configuration identifier within one of the multiple configuration identifier fields with a stored configuration identifier that identifies current configuration information being used by the first node for the application instance; and
if the first configuration identifier identifies a different version of configuration information than the stored configuration identifier, determining that the configuration information is not current.
4. The method as claimed in claim 1, wherein establishing the HTTP connection comprises establishing an HTTP over Secure Sockets Layer (SSL) connection.
5. The method as claimed in claim 1, wherein establishing the HTTP connection comprises establishing an HTTP over Transport Layer Security (TLS) connection.
6. The method as claimed in claim 1, wherein receiving the updated configuration information comprises receiving the updated configuration information in a self-describing structured text format.
7. The method as claimed in claim 6, wherein receiving the updated configuration information comprises receiving the updated configuration information in an Extensible Markup Language (XML) format.
8. The method as claimed in claim 2, further comprising: storing the updated configuration information; and
changing the stored configuration identifier for the application instance to the first configuration identifier.
9. A node within a computer system which operates in a master-slave configuration, the node comprising:
at least one processor that determines with a multiple instance heartbeat message including multiple configuration identifier fields whether configuration information for an application instance being managed by the node is current, and if not, establishes a Hyper-Text Transfer Protocol (HTTP) connection with a remote node from which updated configuration information can be obtained, requests the updated configuration information from the remote node, and receives the updated configuration information, the updated configuration information including a configuration identifier and providing data for operation of the application instance; and
at least one interface to at least one external network, which supports establishment of the connection with the remote node.
10. The node as claimed in claim 9, wherein the at least one processor establishes the HTTP connection by establishing an HTTP over Secure Sockets Layer (SSL) connection.
11. The node as claimed in claim 9, wherein the at least one processor establishes the HTTP connection by establishing an HTTP over Transport Layer Security (TLS) connection.
12. The node as claimed in claim 9, wherein the at least one processor receives the updated configuration information by receiving the updated configuration information in a self-describing structured text format.
13. The node as claimed in claim 12, wherein the at least one processor receives the updated configuration information by receiving the updated configuration information in an Extensible Markup Language (XML) format.
14. A computer readable medium having computer executable instructions stored thereon to maintain configuration information by a first node, wherein the first node is connected by one or more networks to one or more other nodes which operate in a master-slave configuration, the instructions which, when executed by a computer, cause the computer to:
determine with a multiple instance heartbeat message including multiple configuration identifier fields whether configuration information for an application instance being managed by the node is current, wherein the application instance is operating on the first node in at least one of a master and a slave configuration;
if not, establish a Hyper-Text Transfer Protocol (HTTP) connection with a remote node from which updated configuration information can be obtained;
request the updated configuration information from the remote node; and
receive the updated configuration information, the updated configuration information including a configuration identifier and providing data for operation of the application instance.
15. The computer readable medium as claimed in claim 14, wherein establishing the HTTP connection comprises establishing an HTTP over Secure Sockets Layer (SSL) connection.
16. The computer readable medium as claimed in claim 14, wherein establishing the HTTP connection comprises establishing an HTTP over Transport Layer Security (TLS) connection.
17. The computer readable medium as claimed in claim 14, wherein receiving the updated configuration information comprises receiving the updated configuration information in a self-describing structured text format.
18. The computer readable medium as claimed in claim 17, wherein receiving the updated configuration information comprises receiving the updated configuration information in an Extensible Markup Language (XML) format.
19. A node within a computer system which operates in a master-slave configuration, the node comprising:
means for processing, which determines with a multiple instance heartbeat message including multiple configuration identifier fields whether configuration information for an application instance being managed by the node is current, and if not, establishes a Hyper-Text Transfer Protocol (HTTP) connection with a remote node from which updated configuration information can be obtained, requests the updated configuration information from the remote node, and receives the updated configuration information, the updated configuration information including a configuration identifier and providing data for operation of the application instance; and
means for interfacing with at least one external network, which supports establishment of the connection with the remote node.
20. The node as claimed in claim 19, wherein the means for processing establishes the HTTP connection by establishing an HTTP over Secure Sockets Layer (SSL) connection.
21. The node as claimed in claim 19, wherein the means for processing establishes the HTTP connection by establishing an HTTP over Transport Layer Security (TLS) connection.
22. The node as claimed in claim 19, wherein the means for processing receives the updated configuration information by receiving the updated configuration information in a self-describing structured text format.
23. The node as claimed in claim 22, wherein the means for processing receives the updated configuration information by receiving the updated configuration information in an Extensible Markup Language (XML) format.
Patent Citations (134)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4495617(A) | 1985-01-01 | Ampulski et al. | Applicant |
| US5390326(A) | 1995-02-01 | Shah | Applicant |
| US5461608(A) | 1995-10-01 | Yoshiyama | Applicant |
| US5473599(A) | 1995-12-01 | Li et al. | Applicant |
| US5491812(A) | 1996-02-01 | Pisello et al. | Applicant |
| US5535395(A) | 1996-07-01 | Tipley et al. | Applicant |
| US5544077(A) | 1996-08-01 | Hershey | Applicant |
| US5600828(A) | 1997-02-01 | Johnson et al. | Applicant |
| US5642337(A) | 1997-06-01 | Oskay et al. | Applicant |
| US5666486(A) | 1997-09-01 | Alfieri et al. | Applicant |
| US5732206(A) | 1998-03-01 | Mendel | Applicant |
| US5812821(A) | 1998-09-01 | Sugi et al. | Applicant |
| US5832299(A) | 1998-11-01 | Wooten | Applicant |
| US5850573(A) | 1998-12-01 | Wada | Applicant |
| US5870571(A) | 1999-02-01 | Duburcq et al. | Applicant |
| US5909544(A) | 1999-06-01 | Anderson et al. | Applicant |
| US5941972(A) | 1999-08-01 | Hoese et al. | Applicant |
| US5951683(A) | 1999-09-01 | Yuuki et al. | Applicant |
| US5991813(A) | 1999-11-01 | Zarrow | Applicant |
| US5996024(A) | 1999-11-01 | Blumenau | Applicant |
| US5996027(A) | 1999-11-01 | Volk et al. | Applicant |
| US6006259(A) | 1999-12-01 | Adelman et al. | Applicant |
| US6009476(A) | 1999-12-01 | Flory et al. | Applicant |
| US6009480(A) | 1999-12-01 | Pleso | Applicant |
| US6018765(A) | 2000-01-01 | Durana et al. | Applicant |
| US6041381(A) | 2000-03-01 | Hoese | Applicant |
| US6078957(A) | 2000-06-01 | Adelman et al. | Applicant |
| US6108300(A) | 2000-08-01 | Coile et al. | Applicant |
| US6108699(A) | 2000-08-01 | Moiin | Applicant |
| US6131119(A) | 2000-10-01 | Fukui | Applicant |
| US6134673(A) | 2000-10-01 | Chrabaszcz | Examiner |
| US6145019(A) | 2000-11-01 | Firooz et al. | Applicant |
| US6163855(A) | 2000-12-01 | Shrivastava et al. | Examiner |
| US6178445(B1) | 2001-01-01 | Dawkins et al. | Applicant |
| US6185620(B1) | 2001-02-01 | Weber et al. | Applicant |
| US6195687(B1) | 2001-02-01 | Greaves et al. | Applicant |
| US6195760(B1) | 2001-02-01 | Chung et al. | Examiner |
| US6209023(B1) | 2001-03-01 | Dimitroff et al. | Applicant |
| US6219771(B1) | 2001-04-01 | Kikuchi et al. | Applicant |
| US6268924(B1) | 2001-07-01 | Koppolu et al. | Applicant |
| US6269396(B1) | 2001-07-01 | Shah et al. | Applicant |
| US6314526(B1) | 2001-11-01 | Arendt et al. | Examiner |
| US6327622(B1) | 2001-12-01 | Jindal et al. | Applicant |
| US6343320(B1) | 2002-01-01 | Fairchild et al. | Applicant |
| US6353612(B1) | 2002-03-01 | Zhu et al. | Applicant |
| US6363416(B1) | 2002-03-01 | Naeimi et al. | Applicant |
| US6378025(B1) | 2002-04-01 | Getty | Applicant |
| US6392990(B1) | 2002-05-01 | Tosey et al. | Applicant |
| US6393583(B1) | 2002-05-01 | Meth et al. | Examiner |
| US6400730(B1) | 2002-06-01 | Latif et al. | Applicant |
| US6449652(B1) | 2002-09-01 | Blumenau et al. | Applicant |
| US6470382(B1) | 2002-10-01 | Wang et al. | Applicant |
| US6470397(B1) | 2002-10-01 | Shah et al. | Applicant |
| US6473803(B1) | 2002-10-01 | Stern et al. | Applicant |
| US6480901(B1) | 2002-11-01 | Weber et al. | Applicant |
| US6484245(B1) | 2002-11-01 | Sanada et al. | Applicant |
| US6591310(B1) | 2003-07-01 | Johnson | Applicant |
| US6597956(B1) | 2003-07-01 | Aziz et al. | Applicant |
| US6640278(B1) | 2003-10-01 | Nolan et al. | Applicant |
| US6654830(B1) | 2003-11-01 | Taylor et al. | Applicant |
| US6658459(B1) | 2003-12-01 | Kwan et al. | Applicant |
| US6678721(B1) | 2004-01-01 | Bell | Applicant |
| US6683883(B1) | 2004-01-01 | Czeiger et al. | Applicant |
| US6684209(B1) | 2004-01-01 | Ito et al. | Applicant |
| US6691244(B1) | 2004-02-01 | Kampe et al. | Applicant |
| US6697875(B1) | 2004-02-01 | Wilson | Applicant |
| US6697924(B2) | 2004-02-01 | Swank | Applicant |
| US6718361(B1) | 2004-04-01 | Basani et al. | Applicant |
| US6721907(B2) | 2004-04-01 | Earl | Applicant |
| US6724757(B1) | 2004-04-01 | Zadikian et al. | Applicant |
| US6738854(B2) | 2004-05-01 | Hoese et al. | Applicant |
| US6748550(B2) | 2004-06-01 | McBrearty et al. | Examiner |
| US6757291(B1) | 2004-06-01 | Hu | Applicant |
| US6760783(B1) | 2004-07-01 | Berry | Applicant |
| US6763195(B1) | 2004-07-01 | Willebrand et al. | Applicant |
| US6763419(B2) | 2004-07-01 | Hoese et al. | Applicant |
| US6766520(B1) | 2004-07-01 | Rieschl et al. | Applicant |
| US6771663(B1) | 2004-08-01 | Jha | Applicant |
| US6771673(B1) | 2004-08-01 | Baum et al. | Applicant |
| US6799316(B1) | 2004-09-01 | Aguilar et al. | Applicant |
| US6807581(B1) | 2004-10-01 | Starr et al. | Applicant |
| US6823418(B2) | 2004-11-01 | Langendorf et al. | Applicant |
| US6839752(B1) | 2005-01-01 | Miller et al. | Applicant |
| US6845403(B2) | 2005-01-01 | Chadalapaka | Applicant |
| US6848007(B1) | 2005-01-01 | Reynolds et al. | Applicant |
| US6856591(B1) | 2005-02-01 | Ma et al. | Applicant |
| US6859462(B1) | 2005-02-01 | Mahoney et al. | Applicant |
| US6877042(B2) | 2005-04-01 | Tawil et al. | Applicant |
| US6877044(B2) | 2005-04-01 | Lo et al. | Applicant |
| US6885633(B1) | 2005-04-01 | Mikkonen | Applicant |
| US6886171(B2) | 2005-04-01 | MacLeod | Applicant |
| US6889338(B2) | 2005-05-01 | Srinivasan et al. | Applicant |
| US6895461(B1) | 2005-05-01 | Thompson | Applicant |
| US6920491(B2) | 2005-07-01 | Kim | Applicant |
| US6922743(B2) | 2005-07-01 | Mizuno | Applicant |
| US6934799(B2) | 2005-08-01 | Acharya et al. | Applicant |
| US6938092(B2) | 2005-08-01 | Burns | Applicant |
| US6944785(B2) | 2005-09-01 | Gadir et al. | Applicant |
| US6965934(B1) | 2005-11-01 | Reynolds et al. | Applicant |
| US7043727(B2) | 2006-05-01 | Bennett et al. | Applicant |
| US7165258(B1) | 2007-01-01 | Kuik et al. | Applicant |
| US7281062(B1) | 2007-10-01 | Kuik et al. | Applicant |
| US2002/0010750(A1) | 2002-01-01 | Baretzki | Applicant |
| US2002/0042693(A1) | 2002-04-01 | Kampe et al. | Applicant |
| US2002/0049845(A1) | 2002-04-01 | Sreenivasan et al. | Applicant |
| US2002/0055978(A1) | 2002-05-01 | Joon-Bo et al. | Applicant |
| US2002/0059392(A1) | 2002-05-01 | Ellis | Applicant |
| US2002/0065872(A1) | 2002-05-01 | Genske et al. | Applicant |
| US2002/0103943(A1) | 2002-08-01 | Lo et al. | Applicant |
| US2002/0116460(A1) | 2002-08-01 | Treister et al. | Applicant |
| US2002/0126680(A1) | 2002-09-01 | Inagaki et al. | Applicant |
| US2002/0156612(A1) | 2002-10-01 | Schulter et al. | Applicant |
| US2002/0178143(A1) | 2002-11-01 | Fujimoto | Applicant |
| US2002/0188657(A1) | 2002-12-01 | Traversat et al. | Examiner |
| US2002/0188711(A1) | 2002-12-01 | Meyer et al. | Applicant |
| US2003/0005068(A1) | 2003-01-01 | Nickel et al. | Applicant |
| US2003/0014462(A1) | 2003-01-01 | Bennett et al. | Applicant |
| US2003/0018813(A1) | 2003-01-01 | Antes et al. | Applicant |
| US2003/0018927(A1) | 2003-01-01 | Gadir et al. | Applicant |
| US2003/0037284(A1) | 2003-02-01 | Srinivasan et al. | Applicant |
| US2003/0115447(A1) | 2003-06-01 | Pham et al. | Applicant |
| US2003/0140193(A1) | 2003-07-01 | Acharya et al. | Applicant |
| US2003/0149830(A1) | 2003-08-01 | Torr et al. | Applicant |
| US2003/0182455(A1) | 2003-09-01 | Hetzler et al. | Applicant |
| US2003/0208579(A1) | 2003-11-01 | Brady et al. | Applicant |
| US2003/0210686(A1) | 2003-11-01 | Terrell et al. | Applicant |
| US2004/0024778(A1) | 2004-02-01 | Cheo | Applicant |
| US2004/0064553(A1) | 2004-04-01 | Kjellberg | Examiner |
| US2004/0141468(A1) | 2004-07-01 | Christensen | Applicant |
| US2004/0233910(A1) | 2004-11-01 | Chen et al. | Applicant |
| US2005/0055418(A1) | 2005-03-01 | Blanc et al. | Examiner |
| US2005/0063313(A1) | 2005-03-01 | Nanavati et al. | Applicant |
| US2005/0268151(A1) | 2005-12-01 | Hunt et al. | Applicant |
| US2006/0265529(A1) | 2006-11-01 | Kuik et al. | Applicant |
Non-Patent Literature (12)
- US 7,231,429, 06/2007, Muchow (withdrawn)Applicant
- Knight, S., et al., “Virtual Router Redundancy Protocol”, http://www.search.ietf.org/rfc/rfc2338.txt, VRRP, RFC 2338,(1998), pp. 1-26.Applicant
- Li, T., et al., “Cisco Hot Standby Router Protocol (HSRP)”, http://www.search.ietf.org/rfc/rfc2281.txt, Cisco HSRP, RFC 2281,(1998),pp. 1-16.Applicant
- Moore, K., “On the use of HTTP as a Substrate”, http://www.search.ietf.org/rfc/rfc3205.txt, HTTP Layering, RFC 3205,(2002),pp. 1-14.Applicant
- Gusella, R., et al. ,“An Election Algorithm for a Distributed Clock Synchronization Program”, CS Technical Report #275, University of California, Berkeley,(Dec. 1985),pp. 1-14.Applicant
- Gusella, R., et al. ,“The Berkeley UNIX Time Synchronization Protocol”, UNIX Programmers Manual, 4.3 Berkeley Software Distrib., vol. 2C, (1986),10 pages.Applicant
- Lewis, P..,“A High-Availability Cluster for Linux”, http://www2.linuxjournal.com/lj-issues/issue64/3247.html,(Apr. 1994),11 pages.Applicant
- Meth, K. Z., et al., “Design of the iSCSI protocol”, Proceedings of the 20th IEEE Conference on Mass Storage Systems and Technologies, (Apr. 7-10, 2003),116-122.Applicant
- Satran, J. , et al., iSCSI, IPS Internet Draft, draft-ietf-ips-iSCSI-12.txt, Category: standards—track,(Apr. 17, 2002),260 p.Applicant
- Simitci, H. , et al., “Evaluation of SCSP over TCP/IP and SCSI over fibre channel connections”, Hot Interconnects, 9, (Aug. 2001),87-91.Applicant
- VMware ESX Server: User's Manual, Version 1.0, obtained from http://web.archive.org/web/20010608201203/www.vmware.com/support,(Jun. 6, 2001),122-124.Applicant
- Bakker, G. , IP Aliasing, obtained from http://www.zone-h.org/files/24/ip—aliasing.txt,(1999),3 p.Applicant