Abstract: A system and method of generating a channel address. The method includes mapping a first address, obtained from a membership report, to a second address to generate a channel address. A multicast network device (MND) for subscribing one or more hosts on a multicast network to one or more channels is disclosed. The MND includes a memory containing a first address and a SSM mapping engine configured to map the first address to a second address to generate a channel address, identifying a channel, in response to the first address contained in the memory.

Abstract: A method, apparatus and computer program product for building multipoint Pseudo Wires (PWs) using Multicast Label Distribution Protocol (MLDP) is presented. A multipoint PW leaf identifier (mTAI) is configured on one or more Layer 2 (L2) leaf interface(s) of a multipoint PW. A multipoint PW root identifier identifying the root of the multipoint PW is also configured and an opaque value is computed, the opaque value used in MLDP label mapping messages that will flow upstream towards a the root of the multipoint PW. The opaque value is computed from the multipoint leaf identifier and the multipoint root identifier. The PE leaf routers direct MLDP label mapping to the root PE router via a core network.

Abstract: Various systems and methods for rerouting multicast traffic in response to detecting imminent network disruption are disclosed. One method involves detecting an imminent topology change and, in response, identifying a new multicast distribution tree for a multicast group. A join message for the multicast group is then sent towards a root of the new multicast distribution tree. Multicast traffic addressed to the multicast group continues to be forwarded via the current multicast distribution tree, subsequent to sending the join message. The multicast traffic is not forwarded via the new multicast distribution tree until one or more multicast data packets have been received via the new multicast distribution tree.

Abstract: A system and method of generating a channel address. The method includes mapping a first address, obtained from a membership report, to a second address to generate a channel address. A multicast network device (MND) for subscribing one or more hosts on a multicast network to one or more channels is disclosed. The MND includes a memory containing a first address and a SSM mapping engine configured to map the first address to a second address to generate a channel address, identifying a channel, in response to the first address contained in the memory.

Abstract: A method and apparatus for providing multicast messages across a data communication network, the method comprising receiving a multicast message and adding to the multicast message a vector stack including at least one address of a router to which the multicast message is to be sent. The multicast message and the vector stack are then forwarded. At the first router indicated by the vector stack, the next address to which the multicast message is to be sent is read. This is repeated as necessary until the multicast message is received by the final address in the vector stack. The multicast message is then routed to the address indicated in the original multicast message.

Abstract: Each of several routers connected to a LAN elects the same router as the designated router for a multicast group identified by a multicast address. Each of the several routers implements a method for electing the designated router. The method includes in one embodiment, generating several values corresponding to the several routers, respectively. The several values are generated as a function of the several routers' IP addresses, respectively, and an IP address of a first multicast group. The values, in one embodiment, are then compared to determine which is the largest. Thereafter each router elects as the designated router for the multicast group, the router corresponding to the largest value.

Abstract: A mechanism is provided to configure a plurality of transport trees in a transport network, each of which correspond to a native tree (e.g., a bidirectional multicast tree). In embodiments of the present invention, each of the plurality of transport trees has a unique root node so that in the event of a failure of any root node, the transport trees with surviving root nodes can be used to transport traffic from the native tree. The present invention provides for each transport network edge router being independently responsible for selection of a transport tree that the edge router will use to transmit a datastream, while also being capable of receiving packets from any transport tree. Through the use of such configured transport trees along with independent selection of a transport tree, the present invention provides a reduction in the disruption of datastream transmission due to a root node failure.

Abstract: A mechanism is provided by which a transport tree identifier can be generated using one or more identifiers for a multicast datastream. The transport tree identifier can then be used in the process of building a transport tree across a transport network. A transport network egress router can receive a request to join a multicast datastream from a downstream node outside of the transport network. The information contained in the join message that identifies the desired multicast datastream can be encoded in the transport tree identifier. The transport tree identifier can be related to one or more of a multicast group destination address, a multicast datastream source address, and a broadcast domain identifier.

Abstract: A mechanism is provided to configure a plurality of transport trees in a transport network, each of which correspond to a native tree (e.g., a bidirectional multicast tree). In embodiments of the present invention, each of the plurality of transport trees has a unique root node so that in the event of a failure of any root node, the transport trees with surviving root nodes can be used to transport traffic from the native tree. The present invention provides for each transport network edge router being independently responsible for selection of a transport tree that the edge router will use to transmit a datastream, while also being capable of receiving packets from any transport tree. Through the use of such configured transport trees along with independent selection of a transport tree, the present invention provides a reduction in the disruption of datastream transmission due to a root node failure.

Abstract: A multicast transmission scheme is introduced. A multicast data stream is sent on a default tunnel and switched to a data tunnel during flooding conditions. The default tunnel is a point-to-multipoint tunnel from, for example, a source provider edge router to all other provider edge routers in a virtual private network. The data tunnel is a point-to-multipoint tunnel from, for example, a source provider edge router to other provider edge routers that have recipients. Flooding conditions can occur when sending the multicast data stream on the default tunnel, for example, when a specified bandwidth threshold has been exceeded on a source provider edge router. Additionally, the data tunnel is created by selecting a multicast distribution tunnel group from a configured pool of addresses, advertising the group, receiving data joins from, for example, provider edge routers with recipients, and waiting a specified send time.

Abstract: A Multicast Source Discovery Protocol (MSDP) speaker can associate a “key” with a set of one or more source address/group address pairs within a Source Active (SA) message and send the SA message to a MSDP peer. Initially, the MSDP speaker sends both the key and the source address/group address pairs associated with that key. Subsequently, the MSDP speaker can simply resend the key, without also sending all of the associated source address/group address pairs, in order to refresh the SA information at the peer. Additionally, several keys can be sent in a single message.

Abstract: A mechanism to dynamically map a multicast session to a transport tree to reduce flooding of egress routers on the transport tree is provided. A mechanism to reduce the length of time in which transient flooding can occur while the transport tree is being chosen or configured is also provided. The disclosed dynamic mapping mechanisms avoid interruption of an established multicast session. One mechanism disclosed provides for remapping of a multicast session by cloning an original transport tree with which the multicast session is associated, associating the multicast session with the cloned transport tree, and then reconfiguring the cloned transport tree in accord with edge egress routers that have subscribers to that multicast session.

Abstract: A mechanism by which PIM network traffic can be aggregated is provided, thereby reducing the number of PIM messages transmitted by routers in a multicast network. PIM messages are adapted to permit information targeted at multiple destination routers to be included in one PIM message. Join/prune lists for a plurality of upstream neighbor routers can thereby be included in a single PIM message. PIM Hello messages can be similarly aggregated in a single PIM message and both PIM join/prunes and PIM Hellos can be aggregated in a single aggregated PIM message. Through such aggregation of information that would traditionally be transmitted in multiple PIM messages, network bandwidth consumption and router load due to transmission of PIM messages can be reduced.

Abstract: Techniques for dynamically distribute replication points based on routing metrics are provided. A receiver list may be split based on the routing metrics. For example, the receiver list may be split based on unicast reachability over an interface. If portions of egress routers are reachable over different interfaces, the portions are included together in a sublist. Thus, the list is split into sublists based on the reachability. Point-to-point links are then set up between a head end router and an egress router in each sublist. The sublist is then sent to each egress router, which can perform the process above in setting up a point-to-point link to another egress router in each sublist.

Abstract: In one embodiment, a method comprises registering, by a first label switching router having been identified as a root of a prescribed transport tree for transport of a prescribed group of data packets, at least two next hop label switching routers as belonging to the prescribed transport tree based on receiving respective label mapping messages; detecting by the first label switching router a prescribed condition indicating the first label switching router is to be removed from service as the root of the prescribed transport tree; and outputting, by the first label switching router, label distribution protocol messages for the prescribed transport tree to each of the next hop label switching routers determined as belonging to the prescribed transport tree, each label distribution protocol message indicating the first label switching router is to be removed from the service as the root of the prescribed transport tree.

Abstract: A method is provided for pruning an MP2MP tree. The method includes (a) in a first node of an MP2MP LSP tree, the MP2MP LSP tree including a plurality of nodes, determining whether the first node has only a single replication branch for the MP2MP LSP tree, the single replication branch representing a downstream path to only a second node of the plurality of nodes, (b) in response to determining that the first node has only a single replication branch for the MP2MP LSP tree, sending a message to the second node indicating that the second node should refrain from sending upstream traffic towards the first node, and (c) in response to determining that the first node does not have only a single replication branch for the MP2MP LSP tree, refraining from sending a message to the second node indicating that the second node should refrain from sending upstream traffic of the MP2MP LSP tree towards the first node. Apparatus are also provided for use in practicing certain embodiments.

Abstract: In one embodiment, a method is provided. A first root node of a first Multipoint-to-Multipoint (MP2MP) Multi-Protocol Label Switching (MPLS) tree, advertises to a second root node of a second MP2MP MPLS tree a first label for the second root node to use to send multicast traffic to the first MP2MP MPLS tree. The first root node receives a second label from the second root node for the first root node to use to send multicast traffic to the second MP2MP MPLS tree. Communications are carried out between the first MP2MP MPLS tree and the second MP2MP MPLS tree using the first label and the second label. In another embodiment, apparatus are also provided.

Abstract: Disclosed are, inter alia, methods, apparatus, computer-readable media, mechanisms, and means for reducing packet flooding by a packet switch. A packet switch receives a flood prevention request message from an upstream router, with this message identifying a forwarding media access control (MAC) address and one or more destination MAC addresses of downstream routers. The packet switch looks up, typically in its forwarding data structure(s), these specified MAC addresses of the downstream routers in order to determine its corresponding ports on which to communicate with these MAC addresses. The packet switch updates its forwarding data structures accordingly such that a received multicast packet having as its destination MAC address the received forwarding MAC address will be forwarded out only these determined ports.

Abstract: A first message, received from a first device, identifies a multicast distribution tree and includes first information associated with a route leading to a root of the multicast distribution tree. A second message, received from a second device, also identifies that tree, but the second message includes second information, which conflicts with the first information. In one embodiment, the conflict is resolved by building a first version of the tree based on the first information and building a second version of the tree based on the second information. The first version is used to forward multicast packets to the first device, while the second version is used to forward multicast packets to the second device. In another embodiment, the conflict is resolved by selecting either the first information or the second information, based on a policy, and then building a single version of the tree corresponding to the selected information.

Abstract: In one embodiment, a method comprises registering, by a first label switching router having been identified as a root of a prescribed transport tree for transport of a prescribed group of data packets, at least two next hop label switching routers as belonging to the prescribed transport tree based on receiving respective label mapping messages; detecting by the first label switching router a prescribed condition indicating the first label switching router is to be removed from service as the root of the prescribed transport tree; and outputting, by the first label switching router, label distribution protocol messages for the prescribed transport tree to each of the next hop label switching routers determined as belonging to the prescribed transport tree, each label distribution protocol message indicating the first label switching router is to be removed from the service as the root of the prescribed transport tree.