SYSTEMS AND METHODS FOR SCALABLE MULTICAST COMMUNICATION USING SELF-ROOTED FORWARDING TREES

• US 20130148658A1
• Filed: 12/09/2011
• Published: 06/13/2013
• Est. Priority Date: 12/09/2011
• Status: Abandoned Application

• Current Assignee: Raytheon BBN Technlogies Corp. (Rtx Corporation)
• Original Assignee: Raytheon BBN Technlogies Corp. (Rtx Corporation)
• Inventors: Santivanez, Cesar A., Ramanathan, Subramanian, Tetteh, William Nii, Khanna, Bakul Grover, Wiggins, David P.
• Application Number:
  US13/315,469
• Publication Number:
  US 20130148658A1
• Time in Patent Office: Days
• US Class Current: 370/390
• CPC Class Codes: H04L 12/1854 with non-centralised forwarding system, e.g. chaincast
• CPC Class Codes: H04L 12/1886 with traffic restrictions for efficiency improvement, e.g. involving subnets or subdomains
• CPC Class Codes: H04L 12/189 in combination with wireless systems selective distribution or broadcast in wireless communication networks H04W4/06
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04L 45/16 Multipoint routing

Abstract

Systems and methods are disclosed herein for multicasting a data packet through a wireless network. The method includes a packet metadata which maintains a set of next-hop nodes on the routing path as well as the assigned destination nodes of the packet. In addition, each node maintains only a single self-rooted forwarding tree for determining the routing path. By using the metadata in conjunction with a single forwarding tree at each node, the method introduces a highly scalable alternative to multicast protocols based on link state routing source-based trees while substantially reducing the processor load. Furthermore, the method does not require a consistent view of the network topology, making it useful in mobile scenarios. Also included is a mechanism to minimize the packet metadata size for minimal impact to performance while supporting arbitrarily large multicast group sizes.

Claims

1. A method for multicasting a data packet through a network including a plurality of wireless links between nodes, comprising:

maintaining at a first node a self-rooted forwarding tree which indicates the routing path from the first node to each node in the network;

identifying, at the first node, members of a multicast group to which the data packet is targeted;

determining, using the maintained self-rooted forwarding tree at the first node, metadata including a set of next-hop nodes to receive the data packet and a subset of the multicast group members to which each of such next-hop nodes is responsible for forwarding the data packet;

processing the metadata at the first node to reduce a number of bits necessary to convey the metadata over the network;

augmenting the data packet with the processed metadata at the first node; and

broadcasting, at the first node, the augmented data packet over the network.

2. The method of claim 1 wherein the first node is the original source of the data packet.

3. The method of claim 1 wherein the network further includes a plurality of wired links.

4. The method of claim 1, comprising receiving the data packet at the first node prior to the first node determining the metadata, wherein identifying members of a multicast group to which the data packet is targeted comprises

processing the metadata included in the received packet to identify members of the multicast group to which the first node is responsible for forwarding the data packet;

and

identifying a next-hop node associated with each identified member of the multicast group.

5. The method of claim 4, wherein augmenting the data packet comprises replacing the metadata in the received data packet with the processed metadata generated by the first node.

6. The method of claim 4, further comprising

receiving a second data packet at the first node;

processing the metadata of the second data packet to determine whether the first node is included in the set of next-hop nodes; and

dropping the second data packet if the first node is not included in the set of next-hop nodes.

7. The method of claim 1, wherein identifying members of a multicast group to which the data packet is targeted comprises resolving the multicast group.

8. The method of claim 1 wherein identifying members of a multicast group to which the data packet is targeted comprises identifying fewer than a predetermined number of members.

9. The method of claim 1, wherein maintaining the self-rooted forwarding tree comprises updating the self-rooted forwarding tree in response to detecting a change in network topology.

10. The method of claim 1, comprising assigning by the first node an alias which is shorter than an original node ID associated with a given next-hop node, and wherein processing the metadata comprises replacing the original node IDs associated with the next-hop nodes with the corresponding assigned aliases.

11. The method of claim 1 wherein the first node detects whether a duplicate packet as a previous packet has already been transmitted.

12. The method of claim 1 wherein the first node transmits an intentional redundant data packet as a previous packet to different next-hop nodes.

13. The method of claim 1 wherein the self-rooted forwarding tree is one of the following:

a Shortest Path Forwarding (SPF) tree, a multi-point relaying (MPR) tree, or a Steiner tree.

14. A device for forwarding data throughout a network including a plurality of wireless links between nodes, the device comprising:

a communications device for receiving and transmitting data packets;

a memory for storing information including a self-rooted forwarding tree, a list of multicast group memberships; and

a processor configured to;

maintain a self-rooted forwarding tree which indicates a routing path from a first node to a plurality of nodes in the network;

determine, using the maintained forwarding tree, metadata including a set of next-hop nodes to receive a data packet and a subset of multicast group members to which each of such next-hop nodes is responsible for forwarding the data packet;

process the determined metadata to reduce a number of bits necessary to convey the metadata over a network;

augment the data packet with the processed metadata; and

broadcast the augmented data packet over a network.

15. The device of claim 14, wherein the network further includes a plurality of wired links.

16. The device of claim 14, wherein augmenting the data packet comprises replacing the metadata from the data packet with the processed metadata.

17. The device of claim 14, wherein the processor is further configured to determine based on the metadata of a second data packet whether the node is included in a set of next-hop nodes and drop the second data packet if the node is not included in the set of next-hop nodes.

18. The device of claim 14, wherein identifying members of a multicast group to which the data packet is targeted comprises resolving the multicast group.

19. The device of claim 14, wherein identifying members of a multicast group to which the data packet is targeted comprises identifying fewer than a predetermined number of members.

20. The device of claim 14, wherein maintaining the self-rooted forwarding tree comprises updating the self-rooted forwarding tree in response to detecting a change in network topology.

21. The device of claim 14, wherein the processor is further configured to assign an alias which is shorter than an original node ID associated with a given next-hop node to the next-hop node, and wherein processing the metadata comprises replacing the original node ID associated with the next-hop node with the corresponding assigned alias.

22. The device of claim 14, wherein the processor is further configured to detect whether a duplicate packet as a previous packet has already been transmitted.

23. The device of claim 14, wherein the processor is further configured to transmit an intentional redundant data packet as a previous packet to different next-hop nodes.

24. The device of claim 14, wherein the self-rooted forwarding tree is one of the following:

a Shortest Path Forwarding (SPF) tree, a multi-point relaying (MPR) tree, or a Steiner tree.