System for multipoint infrastructure transport in a computer network

• US 8,886,826 B2
• Filed: 07/10/2003
• Issued: 11/11/2014
• Est. Priority Date: 06/01/1999
• Status: Active Grant

• Current Assignee: Google LLC (Alphabet Inc.)
• Original Assignee: Google Inc. (Alphabet Inc.)
• Inventors: McCanne, Steven, Swan, Andrew
• Primary Examiner(s): CHRISTENSEN, SCOTT B
• Application Number:
  US10/618,369
• Publication Number:
  US 20040139150A1
• Time in Patent Office: 4,142 Days
• Field of Search: 709/238, 370/210
• US Class Current: 709/238
• CPC Class Codes: H04L 12/185 with management of multicast group membership
• CPC Class Codes: H04L 47/15 in relation to multipoint traffic arrangements for broadcast or multicast in data networks H04L12/18
• CPC Class Codes: H04L 47/24 Traffic characterised by specific attributes, e.g. priority or QoS
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/783 Distributed allocation of resources, e.g. bandwidth brokers
• CPC Class Codes: H04L 47/806 Broadcast or multicast traffic
• CPC Class Codes: H04L 69/24 Negotiation of communication capabilities
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

A method and apparatus for implementing a Multipoint Infrastructure Transport (MINT) protocol in a data network. The present invention includes a method for distributing data in a data network. The data network connects a plurality of nodes and at least a portion of the plurality of the nodes form a multicast group. One of the nodes in the multicast group is designated as a rendezvous node. The method includes a step of maintaining a data store containing a group state at each of the nodes in the multicast group. State updates, received at the rendezvous node are used to update the group state in the data store at the rendezvous node. The state updates are propagated, using a reliable protocol, from the rendezvous node to the other nodes in the multicast group. Finally, the group states in the data stores at the other nodes in the multicast group are updated.

Claims

1. An apparatus for processing data at a node in a data network, wherein the data network connects a plurality of nodes and at least a portion of the plurality of the nodes form a multicast group, the apparatus comprising:

a non-transitory computer-readable data store that stores, in a database, a plurality of entries associated with the multicast group, wherein each entry comprises data to be transmitted from a rendezvous node of the multicast group to members of the multicast group; and

one or more hardware processors;

one or more sequences of instructions which, when executed by the one or more hardware processors, cause the one or more hardware processors to execute;

logic that disseminates the plurality of entries to members of the multicast group;

logic that receives, from a node that is not a member of the multicast group, a request to run a query against the entries stored in the data store, wherein the query specifies matching criteria;

logic that runs the query against the entries in the data store;

logic that indicates that the apparatus has been designated as the rendezvous node in the multicast group, wherein designation as the rendezvous node indicates that the apparatus is to disseminate the plurality of entries to members of the multicast group; and

logic that disseminates one or more entries that satisfy the matching criteria to the node that is not a member of the multicast group.

2. The apparatus of claim 1, further comprising logic that adds a first entry to the plurality of entries in the data store in response to a request from a first node to add the first entry.

3. The apparatus of claim 2, wherein the logic that adds a first entry to the plurality of entries further automatically disseminates the first entry to the plurality of the nodes that form the multicast group in response to the request from the first node to add the first entry to the plurality of entries.

4. The apparatus of claim 1, further comprising logic that deletes a first entry of the plurality of entries in the data store in response to a request from a first node to relinquish the first entry.

5. The apparatus of claim 4, further comprising logic that indicates, to the plurality of the nodes that form the multicast group, that the first entry has been relinquished, wherein the indication is in response to the request from the first node to relinquish the first entry.

6. The apparatus of claim 1, wherein a source that published the entry is not a member of the multicast group.

7. The apparatus of claim 1, wherein a source that published the entry is a member of the multicast group.

8. The apparatus of claim 1, wherein each entry is associated with a priority that specifies its delivery priority relative to other entries.

9. The apparatus of claim 1, wherein the plurality of entries to members of the multicast group comprises updates to data stores associated with nodes that are not members of the multicast group.

10. A method for operating an apparatus coupled to a selected node in a data network, wherein the data network connects a plurality of nodes and at least a portion of the plurality of the nodes, including the selected node, form a multicast group, the method comprising steps of:

storing, in a database, of a data store, at the apparatus, a plurality of entries associated with the multicast group, wherein each entry comprises data to be transmitted from a rendezvous node of the multicast group to members of the multicast group;

disseminating the plurality of entries to members of the multicast group;

receiving a request from a node that is not member of the multicast group to run a query against the entries stored in the data store, wherein the query specifies matching criteria;

indicating that the apparatus has been designated as the rendezvous node in the multicast group, wherein designation as the rendezvous node indicates that the apparatus is to disseminate the plurality of entries to members of the multicast group; and

disseminating one or more entries that satisfy the matching criteria to the node that is not member of the multicast group.

11. The method of claim 10, further comprising adding a first entry to the plurality of entries stored at the apparatus in response to a request from a first node to add the first entry.

12. The method of claim 11, further comprising automatically disseminating the first entry to the plurality of the nodes that form the multicast group in response to the request from the first node to add the first entry.

13. The method of claim 10, further comprising deleting a first entry of the plurality of entries stored at the apparatus in response to a request from a first node to relinquish the first entry.

14. The method of claim 13, further comprising indicating to the plurality of the nodes that form the multicast group that the first entry of the plurality of entries stored at the apparatus has been relinquished, wherein the indicating is performed in response to the request from the first node to relinquish the first entry.

15. The method of claim 10, wherein a source that published the entry is not a member of the multicast group.

16. The method of claim 10, wherein a source that published the entry is a member of the multicast group.

17. The method of claim 10, wherein each entry is associated with a priority that specifies its delivery priority relative to other entries.

18. The method of claim 10, further comprising:

receiving, from a particular node, a request to run a query against the entries stored at the apparatus, wherein the query specifies a source that published one or more entries; and

asynchronously notifying the particular node of a modification to a first entry;

wherein the asynchronously notifying the particular node is performed in response to the source that published the first entry modifying the first entry.

19. The method of claim 10, wherein the plurality of entries to members of the multicast group comprises updates to data stores associated with nodes that are not members of the multicast group.

20. A data network for transmitting data, wherein the data network connects a plurality of nodes and at least a portion of the plurality of the nodes form a multicast group, the data network comprising:

a plurality of apparatuses, each of the apparatuses comprising;

a non-transitory computer-readable data store that stores, in a database, a plurality of entries associated with the multicast group, wherein each entry comprises data to be transmitted from a rendezvous node of the multicast group to members of the multicast group; and

one or more hardware processors;

one or more sequences of instructions which when executed by the one or more hardware processors, cause the one or more hardware processors to execute;

logic that disseminates the plurality of entries to members of the multicast group;

logic that receives, from a node that is not a member of the multicast group, a request to run a query against the entries stored in the data store, wherein the query specifies matching criteria;

logic that runs the query against the entries in the data store;

logic that indicates that the apparatus has been designated as the rendezvous node in the multicast group, wherein designation as the rendezvous node indicates that the apparatus is to disseminate the plurality of entries to members of the multicast group; and

logic that disseminates one or more entries that satisfy the matching criteria to the node that is not a member of the multicast group.

21. The data network of claim 20, wherein the plurality of entries to members of the multicast group comprises updates to data stores associated with nodes that are not members of the multicast group.