Method and apparatus for maintaining multicast lists in a data network
AssigneeAgere Systems Inc.
InventorsDavid E. Clune, Hanan Z. Moller, David P. Sonnier
Life of this patent
Estimating the term…
Abstract
A multicast group list (i.e., destination node address list) for a network device is circularly linked such that the list can be entered at any point and traversed back to the entry point. The list traversal is then terminated as the entire list has been processed. The data packet received at the network device for transmission to the multicast group can indicate the entry point, although there are other techniques for determining the entry point. The destination node address for the entry point is skipped, that is the multicast data packet is not transmitted to the entry point destination address.
Claims15
A method for identifying destination nodes of a multicast session in a network having a plurality of nodes, comprising:
- forming a circularly linked list comprising a plurality of destination node entries each having an associated address;
- identifying an address for entering the list at an initial destination node entry;
- traversing the linked list;
- and
- terminating the traversing step prior to reaching the initial destination node entry.
A method for identifying the destination nodes for a multicast session in a network having a plurality of nodes, comprising:
- forming a multicast group list comprising a circularly linked plurality of destination node entries, wherein each destination node entry includes link information;
- receiving data intended for transmittal to the destination nodes of the multicast session;
- entering the list at an initial destination node entry as determined from the received data;
- traversing the list according to the link information;
- determining when the traversing step returns to the initial destination node entry;
- and
- terminating the traversing step prior to reaching the initial destination node.
An apparatus for identifying destination nodes of a multicast session in a network having a plurality of nodes, comprising:
- a circularly linked list comprising a plurality of destination node entries, wherein the contents of each destination node entry include an associated destination address and data transmission parameters;
- a processing engine for identifying an initial destination entry for entering the list and for traversing the linked list until the initial destination node entry is reached to;
- and
- terminating the traversing step prior to reaching the initial destination node entry.
Dependencies are inferred from the claim text.