Patent application number | Description | Published |
20080219264 | Upstream Label Allocation on Ethernets for MP2MP LSPS - An apparatus or method for upstream label allocation on LANs for multipoint (MP) label switched paths (LSPs). In one embodiment of the method, a first router receives a first incoming labeled data packet, wherein the first incoming labeled data packet comprises a first data packet and one or more first labels. The first router creates a first outgoing labeled data packet, wherein creating the first outgoing labeled data packet includes the step of swapping the one or more first labels of the first incoming labeled data packet with a context label and a forwarding label, wherein the first outgoing labeled data packet comprises the first data packet, the context label, and the forwarding label. Ultimately, the first router transmits the first outgoing labeled data packet to second and third routers via a LAN. | 09-11-2008 |
20090010272 | Root node shutdown messaging for multipoint-to-multipoint transport tree - 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. | 01-08-2009 |
20090122732 | Half-duplex multicast distribution tree construction - In one embodiment, a method includes sending upstream to a nearest neighbor node, by a Client Label Switched Router (LSR), a downstream label map message of a Server-Forwarding Equivalence Class type (S-FEC-DOWN). In response to the S-FEC-DOWN, a downstream forwarding state from the nearest neighbor node to the Client LSR is established. An upstream label map message of a Client-Forwarding Equivalence Class type (C-FEC UP) is received from the nearest neighbor node. An upstream forwarding state corresponding to the C-FEC UP is then established by the Client LSR. | 05-14-2009 |
20090135722 | Reducing packet flooding by a packet switch - 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. | 05-28-2009 |
20090161583 | CREATING MULTIPOINT-TO-MULTIPOINT MPLS TREES IN AN INTER-DOMAIN ENVIRONMENT - 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. | 06-25-2009 |
20090271467 | PREVENTING TRAFFIC FLOODING TO THE ROOT OF A MULTI-POINT TO MULTI-POINT LABEL-SWITCHED PATH TREE WITH NO RECEIVERS - 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. | 10-29-2009 |
20110058567 | ROOT NODE REDUNDANCY FOR MULTIPOINT-TO-MULTIPOINT TRANSPORT TREES - 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. | 03-10-2011 |
20110176545 | Source Specific Multicast Group to Source Mapping - 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. | 07-21-2011 |
20110268114 | UPSTREAM LABEL ALLOCATION ON ETHERNETS FOR MP2MP LSPS - An apparatus or method for upstream label allocation on LANs for multipoint (MP) label switched paths (LSPs). In one embodiment of the method, a first router receives a first incoming labeled data packet, wherein the first incoming labeled data packet comprises a first data packet and one or more first labels. The first router creates a first outgoing labeled data packet, wherein creating the first outgoing labeled data packet includes the step of swapping the one or more first labels of the first incoming labeled data packet with a context label and a forwarding label, wherein the first outgoing labeled data packet comprises the first data packet, the context label, and the forwarding label. Ultimately, the first router transmits the first outgoing labeled data packet to second and third routers via a LAN. | 11-03-2011 |
20110280123 | Multicast label distribution protocol node protection - In one embodiment, a method includes receiving at a router, a multicast label distribution protocol message comprising local node information for a protected node and one or more leaf nodes downstream of the protected node in a primary label switched path, creating one or more backup label switched paths to the one or more leaf nodes, detecting a failure at the protected node, and forwarding at the router, traffic for the one or more leaf nodes to the one or more backup label switched paths. An apparatus for multicast label distribution protocol node protection is also disclosed. | 11-17-2011 |
20110286450 | MULTICAST HELLO ON DEMAND - In one embodiment, a particular multicast-enabled device on a LAN may determine that it is to send a Join message to an upstream multicast-enabled device that is configured to source multicast data into the LAN. As such, the particular device may transmit a Join message to the upstream device, where the Join message may have a Hello Request indication when there are no downstream multicast neighbors for the upstream device in the LAN, or may not have the Hello Request indication if there is at least one downstream multicast neighbor for the upstream device. Specifically, the Hello Request requests that the upstream device transmit Hello messages onto the LAN. Multicast-enabled devices in the LAN may thus transmit Hello messages in response to receiving a Join message having a Hello Request directed to that particular device, that is, transmitting the Hello messages so long as there is interest in receiving them. | 11-24-2011 |
20120163373 | TRANSPORTING MULTICAST OVER MPLS BACKBONE USING VIRTUAL INTERFACES TO PERFORM REVERSE-PATH FORWARDING CHECKS - A mechanism is provided in which multicast reverse path forwarding can be performed at a provider network egress edge router wherein core routers of the provider network are not configured to support multicast protocols or point-to-multipoint LSPs. An embodiment of the present invention provides for the creation of virtual interfaces in the egress edge router element during configuration of a multicast connection in response to a subscriber request. A virtual interface will be associated with an upstream ingress edge router element and that ingress edge router element is provided a label associated with the virtual interface. Such a label can then be included in datastream packets transmitted through the provider network and be used by reverse path forward checking at the egress edge router element to ascertain whether the multicast datastream is being received by the correct upstream interface. | 06-28-2012 |
20120188909 | ACKNOWLEDGEMENT-BASED REROUTING OF MULTICAST TRAFFIC - Various techniques for exchanging control messages in order to gracefully reroute multicast traffic are disclosed. For example, one method involves sending a join message for a multicast group towards a root of a new multicast tree and forwarding multicast traffic, addressed to the multicast group, on a current multicast tree until an acknowledgment corresponding to the join message is received. The new multicast tree can be identified in response to detection of a topology change within the network. Until the acknowledgment is received, multicast traffic that is received via the new multicast tree can be dropped. | 07-26-2012 |
20120195312 | AUTOMATION FALLBACK TO P2P LSPS FOR MLDP BUILT MULTIPOINT-TREES - A method of using a point-to-point (P2P) label switched path (LSP) to transmit multicast data packets partially through a multiprotocol label switched (MPLS) network when one or more label switched routers (LSRs) of the MPLS are not multicast label distribution protocol (mLDP) enabled. The P2P LSP can be used to transmit multicast data packets to the head end of a point-to-multipoint (P2MP) LSP created with mLDP enabled LSRs. The P2MP LSP can be used to transmit the multicast data packets through the MPLS network to intended receivers that are external to the MPLS network. The P2MP LSP can be built from an egress edge LSR towards an ingress edge LSR, by mLDP enabled LSRs. The P2P LSP can be built from a core mLDP enabled LSR to the ingress edge LSR, across a non-mLDP enabled LSR between the core mLDP enabled LSR and the ingress edge LSR. | 08-02-2012 |
20130077629 | PIM SPARSE-MODE EMULATION OVER MPLS LSP'S - An apparatus and method for emulating a shared or source distribution tree within an MPLS network. In one embodiment of the method, a router receives a multicast data packet. The router transmits the multicast data packet to a first router via a first point-to-point label switched path (LSP). The router replicates the multicast data packet to produce a replicated multicast data packet. Then the router transmits the replicated multicast data packet to a second router via a second point-to-point LSP. The first point-to-point LSP is distinct from the second point-to-point LSP. | 03-28-2013 |
20130208582 | SYSTEM AND METHOD FOR MULTIPOINT LABEL DISTRIBUTION PROTOCOL NODE PROTECTION USING A TARGETED SESSION IN A NETWORK ENVIRONMENT - A method is provided in one example and includes receiving first address information from a protected node over a first label switched path having a first label. The first address information is associated with a first network element. A second label switched path has been previously established with the first network element. The method further includes establishing a targeted session with the first network element, assigning a second label to the second label switched path, and sending the second label to the first network element over the targeted session. | 08-15-2013 |
20130219035 | DYNAMIC GROUP CREATION AND TRAFFIC FLOW REGISTRATION UNDER A GROUP IN A GROUP KEY INFRASTRUCTURE - Upon detection of a new traffic flow, a registration node can dynamically register the new traffic flow with a key server policy manager by sending a registration request on behalf of the new traffic flow. A registration request indicates the new traffic flow should be protected by a security group. A registration request may also include a request to dynamically generate a new security group to protect the traffic flow. The registration request is received by a key server policy manager, which performs authentication and authorization checks of the requesting registration node, and determines whether to accept or reject the registration request. If accepted, the key server policy manager registers the new traffic flow by including a description of the traffic flow in a group policy of an existing security group or a newly created security group, depending on the registration request. | 08-22-2013 |
20130322436 | LOOP DAMPENING IN A COMPUTER NETWORK - In one embodiment, when a packet is received at a device in a network, the device may determine whether a time-to-live (TTL) value of the packet has expired. If the TTL value has not expired, the device forwards the packet to a next-hop device in the network. If the TTL value has expired, however, the device dampens a forwarding state related to the packet for an amount of time until resuming the forwarding state after that amount of time has elapsed. In an example embodiment, the packet is received within a multipoint-to-multipoint (MP2MP) bidirectional tunnel. | 12-05-2013 |
20130329546 | MLDP FAILOVER USING FAST NOTIFICATION PACKETS - An mLDP failover using fast notification packets. In one embodiment of a process for mLDP failover using fast notification packets, a first network node detects a failure of a second network node or a communication link coupled to the second network node. In response to detecting the failure, the first network node sends a packet to a third network node, wherein the packet comprises a notification of link or node failure and information identifying a multipoint label switched path (MLSP) that is configured to transmit multicast data packets of a multicast data stream. | 12-12-2013 |
20140036913 | ACKNOWLEDGED MULTICAST CONVERGENCE - In one embodiment, a device connected to a network as part of a multicast tree receives a revised unicast routing and distributes the revised unicast routing and a query packet to a downstream device in the multicast tree. The device receives an acknowledgement message from the downstream device based on the query packet and determines a new multicast route based on the revised unicast routing and the acknowledgement message from the downstream device. | 02-06-2014 |
20140052831 | MULTICAST SOURCE IN GROUP ADDRESS MAPPING - The present disclosure provides a source specific multicast service that maps multicast group addresses to corresponding source addresses. A boundary routing element can be configured to determine whether a received join request includes a mapped group address. If the join request does not include a mapped group address, boundary routing element can be configured to perform normal join request processing of the join request. If the join request includes a mapped group address, the boundary routing element can be configured to generate a corresponding source address using the mapped group address. The boundary routing element can also be configured to perform alternative join request processing as if the join request were an SSM join request that specified both a source address and a multicast group address. | 02-20-2014 |
20140079068 | UPSTREAM LABEL ALLOCATION ON ETHERNETS FOR MP2MP LSPS - An apparatus or method for upstream label allocation on LANs for multipoint (MP) label switched paths (LSPs). In one embodiment of the method, a first router receives a first incoming labeled data packet, wherein the first incoming labeled data packet comprises a first data packet and one or more first labels. The first router creates a first outgoing labeled data packet, wherein creating the first outgoing labeled data packet includes the step of swapping the one or more first labels of the first incoming labeled data packet with a context label and a forwarding label, wherein the first outgoing labeled data packet comprises the first data packet, the context label, and the forwarding label. Ultimately, the first router transmits the first outgoing labeled data packet to second and third routers via a LAN. | 03-20-2014 |
20140098711 | BICASTING USING NON-CONGRUENT PATHS IN A LOOP-FREE ROUTING TOPOLOGY HAVING ROUTING ARCS - In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, the loop-free routing topology providing first and second non-congruent paths; and forwarding bicasting data, comprising a data packet in a first direction from a network node and a bicasted copy of the data packet in a second direction from the network node, concurrently to the destination node respectively via the first and second non-congruent paths. | 04-10-2014 |
20140233422 | FLOODING AND MULTICASTING IN A LOOP-FREE ROUTING TOPOLOGY USING ROUTING ARCS - In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching multicast listeners from a multicast source, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for receiving from each of the first and second network devices a copy of a multicast packet originated from the multicast source; and causing the multicast packet to be propagated throughout the loop-free routing topology based on the first and second ends of each routing arc forwarding the corresponding copy into the corresponding routing arc. | 08-21-2014 |
20140254592 | Loop Avoidance Technique for the Multicast Control Plane - The present disclosure provides for a loop avoidance technique that implements an upstream neighbor check to detect any forwarding inconsistencies. When a message is received from a neighbor routing element, an upstream neighbor check is performed to determine whether the neighbor routing element is an upstream neighbor toward a content provider of a datastream identified in the message. If the check determines that the neighbor routing element is not an upstream neighbor, then a forwarding inconsistency is not detected. If the check determines that the neighbor routing element is an upstream neighbor, then a forwarding inconsistency is detected. | 09-11-2014 |
20140269412 | ON-DEMAND BOOT STRAP ROUTER SOURCE ANNOUNCEMENTS - In one embodiment, a node in a communication network receives a request for messages of a particular group, determines a rendezvous point, and transmits the request to the rendezvous point to cause the rendezvous point to return a source-message indicating a source-node of the particular group. The node further creates a path from itself to the source-node and receives messages of the particular group according to the path. | 09-18-2014 |
20140280711 | LOCAL REROUTE PROTECTION FOR MULTICAST MULTIPROTOCOL LABEL SWITCHING - In one embodiment, a merge process can determine a primary tree among nodes in a communication network, determine a backup tree for a protected segment of the primary tree, the backup tree having at least a portion of overlap with the primary tree, and stitch the backup tree to the primary tree for each node of the portion of overlap such that when a message is transmitted for a group according to the backup tree, each node of the portion of overlap receives a single instance of the message of the group. | 09-18-2014 |
20140334308 | PREVENTING TRAFFIC FLOODING TO THE ROOT OF A MULTI-POINT TO MULTI-POINT LABEL-SWITCHED PATH TREE WITH NO RECEIVERS - A method is provided for pruning an MP2MP tree. The method includes, in a first node of an MP2MP LSP tree, 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. 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 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. | 11-13-2014 |
20140362731 | DETECTION OF REPAIR NODES IN NETWORKS - An apparatus and method for detection of repair nodes in a network. In one embodiment of the method, a first node generates a first message and a second message, wherein each of the first and second messages includes a first node identification (ID) that uniquely identifies the first node within a network. The first message includes a first path ID, wherein the first path ID corresponds to a first path through which the first node receives data packets of a stream. The second message includes a second path ID, wherein the second path ID corresponds to a second path through which the first node receives copies of the data packets. The first and second path IDs are distinct from each other. The first node transmits the first message upstream towards a root node for the stream via a first interface of the first node, and the first node transmits the second message upstream towards the root node via a second interface of the first node. The first and second interfaces are distinct from each other. | 12-11-2014 |
20150036685 | MULTICAST LABEL DISTRIBUTION PROTOCOL OVER A REMOTE LOOP-FREE ALTERNATIVE - In one embodiment, a node in a multicast label distribution protocol (mLDP) network determines a remote protecting node for a particular root node in the mLDP network. In addition, the node determines a protecting node address of the remote protecting node and a root node address of the particular root node, and establishes an mLDP label-switched path (LSP) via the remote protecting node by using the protecting node address as a root of an outer forwarding equivalent class (FEC) of a recursive FEC, and using the root node address as an inner FEC of the recursive FEC for the mLDP LSP. As such, when the remote protecting node is reached, the outer FEC is stripped and the remote protecting node continues establishing the mLDP LSP toward the particular root node. | 02-05-2015 |
20150078377 | Bit Indexed Explicit Replication - Various systems and methods for performing bit indexed explicit replication (BIER). For example, one method involves receiving a packet at a node. The packet includes a multicast forwarding entry. The multicast forwarding entry has a plurality of elements, and each element corresponds to a particular node. The method also involves comparing the multicast forwarding entry with forwarding information stored by the node. The method involves selecting a neighbor node based on the comparing, updating the multicast forwarding entry in the packet, and forwarding the packet to the neighbor node. | 03-19-2015 |
20150078378 | Bit Indexed Explicit Replication Using Multiprotocol Label Switching - Various systems and methods for performing bit indexed explicit replication (BIER) using multiprotocol label switching (MPLS). For example, one method involves receiving a packet that includes a MPLS label. The packet also includes a multicast forwarding entry. The method also involves determining, based on the value of the MPLS label, whether to use the multicast forwarding entry to forward the packet. The method further includes forwarding the packet. | 03-19-2015 |
20150078379 | Bit Indexed Explicit Replication Using Internet Protocol Version 6 - Various systems and methods for performing bit indexed explicit replication (BIER) using IPv6. For example, one method involves receiving, at a node, a packet that includes an IP header. The packet also includes a multicast forwarding entry. The method also involves comparing the multicast forwarding entry with forwarding information stored by the node and selecting a neighbor based on the comparing. The method further includes forwarding the packet to the neighbor. | 03-19-2015 |
20150078380 | Bit Indexed Explicit Replication For Layer 2 Networking - Various systems and methods for performing bit indexed explicit replication (BIER). For example, one method involves receiving a link layer protocol frame at a network device. The link layer protocol frame includes a MAC address that identifies the link layer protocol frame as a being a multicast frame. The method then involves selecting a subset of ports included on the network device and forwarding the link layer protocol frame to only the selected subset of ports. | 03-19-2015 |
20150085635 | MIGRATION SUPPORT FOR BIT INDEXED EXPLICIT REPLICATION - A method and network device are disclosed for multicast forwarding. In one embodiment, the method includes receiving at a node configured to use a bit-indexed forwarding table a multicast message comprising an incoming message bit array. The method further includes comparing the incoming message bit array to a first neighbor bit array within a first forwarding table entry, and determining that for at least one relative bit position in the bit arrays a corresponding destination node is both a destination for the message and a reachable destination from a first neighboring node. The method further includes forwarding toward the first neighboring node a copy of the message, where a first node on the path of the forwarded message is not configured to use a respective bit-indexed forwarding table. An embodiment of the device includes a network interface, a memory and a processor configured to perform steps of the method. | 03-26-2015 |