System and method for storing and utilizing routing information in a computer network

• US 7,292,585 B1
• Filed: 03/31/2003
• Issued: 11/06/2007
• Est. Priority Date: 12/20/2002
• Status: Expired due to Fees

• Current Assignee: Clouding Corporation (Marathon Patent Group, Inc.)
• Original Assignee: Symantec Operating Corporation (Gen Digital Inc.)
• Inventors: Slaughter, Gregory L., Muth, John A., Saulpaugh, Thomas E., Krumel, Andrew
• Primary Examiner(s): Phunkulh; Bob A.
• Application Number:
  US10/403,919
• Time in Patent Office: 1,681 Days
• Field of Search: None
• US Class Current: 370/400
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04L 45/484 using multiple routing trees

Abstract

A system and method for storing and utilizing routing information in a computer network. Instances of a first network address may be created on each of N nodes in the network. Routing information for routing messages to the first network address may be stored on a first node. The first node may be operable to route a first message to the first network address using the routing information so that the message reaches each of the N nodes that have an instance of the first network address. However, the routing information stored by the first node may comprise information regarding less than all N instances of the first network address.

Claims

1. A system comprising:

a network;

a plurality of nodes coupled via the network;

wherein the plurality of nodes includes two or more nodes that each host an instance of a first network address, wherein N is the number of nodes that host an instance of the first network address;

wherein the plurality of nodes includes a first node operable to route a message to the first network address so that the message reaches each of the N nodes that host an instance of the first network address;

wherein the first node stores routing information for routing the message to the first network address;

wherein the routing information stored by the first node comprises information regarding less than N instances of the first network address;

wherein the plurality of nodes includes a second node which hosts a first instance of the first network address;

wherein the second node stores routing information for routing the message to the first network address; and

wherein the routing information stored by the second node comprises information regarding all N instances of the first network address.

2. The system of claim 1,

wherein the routing information stored by the first node comprises information regarding only one instance of the first network address.

3. The system of claim 1,

wherein the routing information stored by the first node comprises information useable to route a first message to the first instance of the first network address;

wherein the second node is operable to route the first message to all N instances of the first network address in response to receiving the first message from the first node.

4. The system of claim 1,

wherein said first node storing routing information for routing the message to the first network address comprises the first node storing one or more data structures representing a tree for routing the message to the first network address.

5. A method for storing routing information in a computer network, the method comprising:

creating an instance of a first network address on each of a plurality of nodes in the network, wherein N is the number of nodes that have an instance of the first network address;

storing routing information for routing messages to the first network address on a first node in the network;

wherein the first node is operable to route a first message to the first network address using the routing information so that the message reaches each of the N nodes that have an instance of the first network address;

wherein the routing information comprises information regarding less than N instances of the first network address;

storing routing information for routing messages to the first network address on a second node in the network; and

wherein the routing information stored by the second node comprises information regarding all N instances of the first network address.

6. The method of claim 5,

wherein the routing information stored by the first node comprises information regarding only one instance of the first network address.

7. The method of claim 5,

wherein the second node has a first instance of the first network address;

wherein the routing information stored by the first node comprises information useable to route messages to the first instance of the first network address.

8. The method of claim 7, further comprising:

the first node routing a first message to the first instance of the first network address;

the second node routing the message to all N instances of the first network address in response to receiving the first message from the first node.

9. A method for storing routing information in a computer network, the method comprising:

creating an instance of a first network address on each of a first plurality of nodes in the network;

for each of a subset of nodes in the network, storing routing information on the node, wherein the subset of nodes includes the first plurality of nodes and a second plurality of nodes which do not host an instance of the first network address;

wherein, for each node in the second plurality of nodes, said storing routing information on the node comprises storing information for routing a message to fewer than all instances of the first network address;

wherein, for each node in the first plurality of nodes, said storing routing information on the node comprises one or more of;

storing information for routing a message to all instances of the first network address;

storing information for routing a message to an instance of the first network address which is hosted on a node operable to route a message to all instances of the first network address.

10. The method of claim 9,

wherein, for each node in the first plurality of nodes and for each node in the second plurality of nodes, said storing routing information on the node comprises storing information representing one or more edges of a tree, wherein each edge is useable to route the message toward an instance of the first network address.

11. The method of claim 9,

wherein N is the number of instances of the first network address;

wherein the second plurality of nodes includes a first node that stores information for routing a message to M instances of the first network address, wherein M is less than N;

wherein the method further comprises;

the first node receiving a request to send a first message to the first network address;

the first node routing the first message to the M instances of the first network address in response to the request.

12. The method of claim 11,

wherein said first node routing the first message to the M instances of the first network address results in all N instances of the first network address receiving the first message.

13. The method of claim 11,

wherein said first node routing the first message to the M instances of the first network address includes the first node routing the first message to a second node;

wherein the second node stores information for routing the first message to all N instances of the first network address;

wherein the method further comprises the second node routing the first message to all N instances of the first network address in response to receiving the first message from the first node.

14. The method of claim 11,

wherein said first node routing the first message to the M instances of the first network address includes the first node routing the first message to a second node;

wherein the second node stores information for routing the first message to a first instance of the first network address which is hosted on a third node, wherein the third node is operable to route the first message to all N instances of the first network address;

wherein the method further comprises;

the second node routing the first message to the first instance of the first network address in response to receiving the first message from the first node; and

the third node routing the first message to all N instances of the first network address in response to receiving the first message from the second node.

15. A system comprising:

a network;

a plurality of nodes coupled via the network;

wherein the plurality of nodes includes two or more nodes that each host an instance of a first network address, wherein N is the number of nodes that host an instance of the first network address;

wherein the plurality of nodes includes a first node operable to route a message to the first network address so that the message reaches each of the N nodes that host an instance of the first network address;

wherein the first node stores routing information for routing the message to the first network address;

wherein the routing information stored by the first node comprises information regarding less than N instances of the first network address;

wherein the plurality of nodes includes a second node;

wherein the second node stores routing information for routing the message to the first network address; and

wherein the routing information stored by the second node comprises information useable to route the message to a third node, wherein the third node stores routing information regarding all N instances of the first network address.

16. The system of claim 15,

wherein the routing information stored by the first node comprises information useable to route a first message to the second node;

wherein the second node is operable to route the first message the third node in response to receiving the first message from the first node;

wherein the third node is operable to route the first message to all N instances of the first network address in response to receiving the first message from the second node.

17. A method for storing routing information in a computer network, the method comprising:

creating an instance of a first network address on each of a plurality of nodes in the network, wherein N is the number of nodes that have an instance of the first network address;

storing routing information for routing messages to the first network address on a first node in the network;

wherein the first node is operable to route a first message to the first network address using the routing information so that the message reaches each of the N nodes that have an instance of the first network address;

wherein the routing information comprises information regarding less than N instances of the first network address;

storing routing information for routing messages to the first network address on a second node in the network;

wherein the routing information stored by the first node comprises information useable to route messages to the second node; and

wherein the routing information stored by the second node comprises information useable to route the message to a third node, wherein the third node stores routing information regarding all N instances of the first network address.