Methods and apparatus for updating subsource addressing multicast routing records in a communications network

• US 7,813,340 B2
• Filed: 10/31/2007
• Issued: 10/12/2010
• Est. Priority Date: 07/16/2001
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Novaes, Marcos N.
• Primary Examiner(s): Kumar; Pankaj
• Assistant Examiner(s): Duong; Duc T
• Application Number:
  US11/931,519
• Publication Number:
  US 20080049750A1
• Time in Patent Office: 1,077 Days
• Field of Search: 370/389, 370/390, 370/392, 370/400, 370/401, 370/408, 370/432, 709220-224
• US Class Current: 370/389
• CPC Class Codes: H04L 12/185 with management of multicast group membership
• CPC Class Codes: H04L 45/02 Topology update or discovery
• CPC Class Codes: H04L 45/16 Multipoint routing
• CPC Class Codes: H04L 45/48 Routing tree calculation
• CPC Class Codes: H04L 45/484 using multiple routing trees
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

Methods and arrangements for facilitating subscription among at least two nodes in a distributed network, involving the designation of one of the nodes as a publisher node, the designation of one of the nodes as a subscriber node, and the recordation of a path between the subscriber node and the publisher node. The path includes at least one link between the subscriber node and the publisher node, and the recordation involves recording each distinct link in the path between the subscriber node and the publisher node.

Claims

1. A method of facilitating subscription among at least two nodes in a distributed network, said method comprising the steps of:

designating one of the nodes as a publisher node;

designating one of the nodes as a subscriber node; and

recording a path between the subscriber node and the publisher node, the path comprising at least one link between the subscriber node and the publisher node;

said recording step comprising the step of recording each distinct link in the path between the subscriber node and the publisher node;

said recording step comprising recording each node in the path between the subscriber node and the publisher node, one node at a time;

wherein a type of each node in the path is ascertained;

wherein the nodes belong to a distributed multicast network; and

wherein said step of recording a path comprises ascertaining whether any intervening node is present in the path between the subscriber node and the publisher node.

2. The method according to claim 1, wherein said step of recording a path comprises ascertaining whether any node is a fork node.

3. The method according to claim 1, wherein the distributed network includes at least one intervening node between the subscriber node and the publisher node, and further wherein:

said step of recording a path comprises ascertaining whether any intervening node is a fork node.

4. The method according to claim 1, wherein the distributed network includes at least three nodes, said method further comprising the steps of:

designating one of the nodes as an additional subscriber node; and

recording a path between the additional subscriber node and the publisher node, the path comprising at least one link between the additional subscriber node and the publisher node.

5. A non-transitory program storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform steps for facilitating subscription among nodes in a distributed network, said steps comprising:

designating one of the nodes as a publisher node;

designating one of the nodes as a subscriber node; and

recording a path between the subscriber node and the publisher node, the path comprising at least one link between the subscriber node and the publisher node;

said recording step comprising the step of recording each distinct link in the path between the subscriber node and the publisher node;

said recording step comprising recording each node in the path between the subscriber node and the publisher node, one node at a time;

wherein a type of each node in the path is ascertained;

wherein the nodes belong to a distributed multicast network; and

wherein said step of recording a path comprises ascertaining whether any intervening node is present in the path between the subscriber node and the publisher node.

6. The non-transitory program storage device according to claim 5, wherein said step of recording a path comprises ascertaining whether any node is a fork node.

7. The non-transitory program storage device according to claim 5, wherein the distributed network includes at least one intervening node between the subscriber node and the publisher node, and further wherein:

said step of recording a path comprises ascertaining whether any intervening node is a fork node.

8. The non-transitory program storage device according to claim 5, wherein the distributed network includes at least three nodes, said steps further comprising:

designating one of the nodes as an additional subscriber node; and

recording a path between the additional subscriber node and the publisher node, the path comprising at least one link between the additional subscriber node and the publisher node.

9. A method comprising:

obtaining one or more subscriptions via a bottom-up subscription among nodes in a distributed network of nodes, the distributed network of nodes comprising one or more publisher nodes, one or more fork nodes, and one or more subscriber nodes; and

transmitting one or more notifications from a publisher node directly to one or more subscriber nodes utilizing the one or more subscriptions;

wherein one or more fork nodes are utilized in transmitting the one or more notifications only in response to determining two or more notifications share a common. path to the one or more fork nodes.

10. The method according to claim 9, wherein said bottom-up subscription further comprises:

originating subscription operations at one or more subscriber nodes and propagating the subscription operations hop by hop in a path to a publisher node; and

recording a subscription at each node in the path.

11. The method according to claim 10, wherein:

in response to detection that two or more subscriptions at a node have identical addresses, identifying the node having the two or more subscriptions as a fork node.

12. The method according to claim 9, wherein:

the one or more notifications comprise a multicasted message;

the one or more fork nodes are positioned in-between a publisher node and one or more subscriber nodes; and

the one or more fork nodes are utilized only in response to determining the one or more fork nodes are included in a common path for a multicasted message.

13. The method according to claim 12, wherein the one or more fork nodes retransmit the multicasted message along distinct paths to two or more subscriber nodes.