US7801136B2 - Source routed multicast LSP - Google Patents
Source routed multicast LSP Download PDFInfo
- Publication number
- US7801136B2 US7801136B2 US11/706,125 US70612507A US7801136B2 US 7801136 B2 US7801136 B2 US 7801136B2 US 70612507 A US70612507 A US 70612507A US 7801136 B2 US7801136 B2 US 7801136B2
- Authority
- US
- United States
- Prior art keywords
- label
- packet
- node
- stack
- labels
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active, expires
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/48—Routing tree calculation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
Definitions
- the present invention relates generally to network communications. More particularly, this invention relates to source routed multicast LSP (label switch protocol).
- LSP label switch protocol
- IP Internet protocol
- multicast builds multicast distribution trees to deliver packets from senders to receivers.
- the distribution trees are formed by installing multicast forwarding states on routers in a network.
- the multicast forwarding states are difficult to aggregate, hence posting a scalability issue for backbone service providers that need support a relatively large number of multicast groups.
- MPLS multi-protocol label switching
- incoming packets are assigned a “label” by a “label edge router (LER)”.
- Packets are forwarded along a label switch path (LSP) where each label switch router (LSR) makes forwarding decisions based solely on the contents of the label.
- LSR label switch router
- the LSR strips off the existing label and applies a new label which tells the next hop how to forward the packet.
- a label is a short, fixed length, locally significant identifier which is used to identify a FEC (forwarding equivalence class).
- the label which is put on a particular packet represents the FEC to which that packet is assigned.
- FEC is a set of packets which will be forwarded in the same manner (e.g., over the same path with the same forwarding treatment). Typically, packets belonging to the same FEC will follow the same path in the MPLS domain. While assigning a packet to an FEC, the ingress LSR may look at the IP header and also some other information such as the interface on which this packet arrived.
- the FEC to which a packet is assigned is identified by a label.
- LSPs Label switch paths
- An LSP is a set of LSRs that packets belonging to a certain FEC travel in order to reach their destination. Since MPLS allows hierarchy of labels known as a label stack, it is possible to have different LSPs at different levels of labels for a packet to reach its destination. So more formally, a LSP of a packet with a label of level m is a set of LSRs that a packet p has to travel at level m to reach its destination. Further detailed information regarding MPLS can be found in RFC3031, which is herein incorporated by reference in its entirety.
- LSP is provisioned using label distribution protocols (LDPs) such as RSVP-TE (reserved protocol-traffic engineering) or CR-LDP. Either of these protocols will establish a path through an MPLS network and will reserve necessary resources to meet pre-defined service requirements for the data path.
- LDPs label distribution protocols
- RSVP-TE reserved protocol-traffic engineering
- CR-LDP CR-LDP
- An LDP is a specification that lets a label switch router (LSR) distribute labels to its LDP peers.
- LSR label switch router
- LDP helps in establishing a LSP by using a set of procedures to distribute the labels among the LSR peers.
- An LSP can be established that crosses multiple Layer 2 transports such as ATM (asynchronous transport mode), Frame Relay or Ethernet.
- Layer 2 transports such as ATM (asynchronous transport mode), Frame Relay or Ethernet.
- a conventional MPLS label stack is a linear data structure.
- operations 1) and 2) may be combined to form a “swap and push” operation that replaces a label on the top of the label stack and then pushes one or more new labels onto the label stack.
- Source routed multicast LSP is described herein.
- a first node receives a first packet having a label stack including a plurality of labels compatible with MPLS (multi-protocol label switching)
- MPLS multi-protocol label switching
- the first packet is duplicated into a second packet.
- at least two labels are popped from the top of the label stack of the second packet forming a third packet.
- the first and third packets are processed based on a label on the top of the label stack of the first and third packets respectively.
- FIG. 1 is a block diagram illustrating an MPLS network configuration which may be used as an embodiment of the invention.
- FIG. 2 is a block diagram illustrating an example of operations associated with a popN label, according to one embodiment of the invention.
- FIG. 3 is a flow diagram illustrating a process for MPLS labels according to one embodiment of the invention.
- FIGS. 4A-4C are diagrams illustrating a process of MPLS labels according to another embodiment of the invention.
- FIGS. 5A-5C are diagrams illustrating a process of MPLS labels according to another embodiment of the invention.
- FIG. 6 is a flow diagram illustrating a process of MPLS labels according to a further embodiment of the invention.
- FIGS. 7A-7E are diagrams illustrating a process of forming a label stack according to one embodiment of the invention.
- FIG. 8 is a flow diagram illustrating a process for forming a label stack according to one embodiment of the invention.
- FIG. 9 is a block diagram illustrating a network element which may be used as an embodiment of the invention.
- Source routed multicast LSP is described herein.
- numerous details are set forth to provide a more thorough explanation of embodiments of the present invention. It will be apparent, however, to one skilled in the art, that embodiments of the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form, rather than in detail, in order to avoid obscuring embodiments of the present invention.
- Embodiments of the invention include a scheme that can encode a multicast distribution tree in data packets using a stack of MPLS compatible labels.
- the scheme introduces minimum changes to the conventional MPLS forwarding plane or module and allows relatively efficient implementations.
- packets can be delivered to multiple destinations in a network following a pre-computed or predetermined multicast distribution tree without having to create multicast forwarding states in the network. As a result, the scalability of the multicast is greatly improved.
- FIG. 1 is a block diagram illustrating a network configuration according to one embodiment of the invention.
- network configuration 100 includes, but is not limited to, a variety of customer or client sites 102 - 105 coupled to each other via an MPLS network 101 .
- the MPLS network 101 may be implemented on the top of a variety of networks, such as, for example, IP and/or ATM networks.
- Each of the customer sites 102 - 105 may include a customer edge (CE) device 106 - 109 respectively.
- CE customer edge
- the MPLS network 101 includes one or more label switch routers (LSRs) 114 - 117 to route network traffic within the MPLS network.
- LSRs 114 - 117 are also referred to as core routers. Note that four LSRs 114 - 117 are shown for the purposes of illustration only. It will be appreciated that more or less LSRs may be implemented.
- MPLS network 101 may further include one or more label edge routers (LERs) 110 - 113 coupled to customer sites 102 - 105 via CEs 106 - 109 respectively. LERs 110 - 113 may also be referred to as edge LSRs while LSRs 114 - 117 may be referred to as core LSRs.
- LERs label edge routers
- each of the LERs 110 - 113 and LSRs 114 - 117 may include a database or table, also referred to as label information base (LIB), for storing label information across the MPLS network 101 .
- LIB label information base
- an example of LIB may be implemented similar to one shown in FIG. 5B .
- a LIB may be implemented as a part of a routing table and/or forwarding table of each node.
- Any node in a customer site may reach any one or more of other customer sites through the MPLS network 101 via one or more LERs 110 - 113 and LSRs 114 - 116 , which form one or more LSPs coupling one or more of the customer sites in the MPLS network 101 .
- customer site 102 may reach one or more of customer sites 103 - 105 via one or more LSPs formed by one or more of LERs 110 - 113 and LSRs 114 - 116 .
- MPLS labels are used in a point-to-point communication situation (e.g., a unicast situation) using operations set forth above, including pop, swap, push, etc.
- This is typically a linear node structure, where a label is individually popped, pushed, and/or swapped, one at a time.
- a point-to-multipoint situation e.g., a multicast situation
- it is a non-linear node structure.
- a node has to send out duplicated packets (e.g., at least one for each destination node) to multiple destination nodes via multiple LSPs.
- the corresponding CE 106 and/or LER 110 may have to send multiple copies of the packet to the multiple destinations (e.g., customer sites 103 - 105 ) via one or more LSRs 114 - 117 .
- the multiple destinations e.g., customer sites 103 - 105
- any one of the LSRs 114 - 117 has to operate one label at a time in order to figure out a next hop.
- new operations of labels are utilized in which multiple labels or multiple operations per label in a label stack can be operated. With the new operations, duplicated packets may be reduced in a multicast situation.
- a popN and a copy&pop operations may be utilized. It will be appreciated that other types labels/operations, such as multiple operations on a label, labels on one operation, and/or multiple operations on multiple labels, etc., apparent to one with ordinary skill in the art may also be utilized.
- a next label or next header is processed, for example, depending upon whether the bottom of label stack is reached.
- the existing pop operation is a special case of popN where n equals to one.
- a copy&pop action may be a secondary label action attached to another primary label operation.
- the packet is replicated.
- the primary operation of the top label is executed as normal, for example, resulting the top of the label to be replaced (e.g., similar to swap) with another label that does not have a copy&pop action associated with it.
- a pop operation is performed and the resulting packet is further processed based on the new top label or next header in the label stack.
- FIG. 2 is a block diagram illustrating an example of operations associated with a popN label, according to one embodiment of the invention.
- packet 201 will be transmitted by a transmitting node and to a receiving node.
- Packet 202 is a packet after the receiving node processes the packet 201 in view of the label stack of the packet 201 .
- the transmitting and receiving nodes may be any one of nodes in FIG. 1 .
- the receiving node is a next hop of the transmitting node in an MPLS network similar to MPLS network 101 of FIG. 1 .
- packet 201 includes, but is not limited to, an MPLS label stack 204 , also referred to as an MPLS header, and payload 203 .
- MPLS label stack 204 may be embedded within a header of packet 201 , for example, between a layer 2 header (e.g., a MAC header) and a layer 3 header (e.g., an IP header).
- a layer 2 header e.g., a MAC header
- layer 3 header e.g., an IP header
- packet 201 is transmitted from a transmitting node to a receiving node.
- the receiving node processes a label 207 on the top of the label stack 204 .
- the label 207 is a popN label.
- “n” numbers of labels e.g., labels 205
- packet 202 is transmitted to the next hop and processed at the next hope using one or more techniques set forth above and so on.
- FIG. 3 is a flow diagram illustrating a process for process a label stack according to one embodiment of the invention.
- Process 300 may be performed by a processing logic that may comprise hardware (circuitry, dedicated logic, etc.), software (such as is run on a dedicated machine), or a combination of both.
- process 300 may be processed by any one of the nodes shown in FIG. 1 prior to transmitting a packet to a next hop.
- a node which may be a network element, a computer system of a cluster, and/or a processor core of a data processing system, etc., receives a packet having a stack of labels (e.g., packet 201 of FIG. 2 ) for MPLS routing.
- the node parses a label on the top of the label stack (e.g., label 207 of FIG. 2 ) to determine whether the top label is a popN label. If the top label is a popN label, at block 303 , one or more labels are popped from the label stack, where the number of labels popped is determined based on information of the top label prior to popping.
- a “pop3” label indicates that 3 labels should be popped when the “pop3” label is processed.
- the remaining packet is routed to a next hop based on a next label on the top of the remaining label stack (e.g., label 208 of packet 202 in FIG. 2 ).
- the next hope of the next top label may be determined based on a LIB associated with the node. Other operations may also be performed.
- an LSP using one or more popN labels for an FEC includes a popN operation associated with the FEC, either at an LSP egress or at the penultimate LSR (e.g., if PHP is enabled).
- a popN may include a swap operation on some or all other LSRs on the LSP path.
- a popN LSP delivers packets to the LSP egress as normal, where the only difference is that at the egress or the penultimate LSR, “n” labels instead of one are popped from the stack.
- a label stack represents a hierarchy of LSPs.
- a label at level m in the label stack of packet corresponds to an LSP of level m.
- the label at level m will deliver the packet to the egress of LSP of level m, where the level m label will be popped (if PHP is enabled, the level m label may be popped at the penultimate hop, rather than the egress) and the next forwarding decision is based on the label at level m- 1 . Effectively, the packet will be forwarded along LSP of level m- 1 .
- LSR I For any ingress LSR (referred to as LSR I), according to certain embodiments of the invention, it may have k popN LSPs that has an egress LSR (referred to as LSR E), where n is between 1 and k inclusive.
- LSR E egress LSR
- an LSP En is used to represent popN LSPs with egress E.
- LSP E 2 will have a pop2 operation at the egress or penultimate hop, while LSP E 5 will remove 5 labels at the egress or penultimate hop.
- LSP E is the same as LSP E 1 , which has a normal pop operation that removes one label from the stack at the LSP egress or penultimate hop.
- a branch popN LSP (or branch LSP for short) is introduced.
- a branch popN LSP for an FEC is a popN LSP that also includes a copy and pop (copy&pop) action. This is typically associated with an LSP on the first hop of the LSP.
- a branch LSP creates a branch in packet processing.
- a branch popN LSP may include a corresponding popN LSP that does not have a copy&pop action on the first hop.
- En′ is utilized to represent the branch popN LSP with egress E, while a normal En is used to represent a popN LSP.
- the primary operation for L 1 ′ is a swap that would replace L 1 ′ with L 2 , causing LSP En′ to merge with LSP En.
- This swap operation for L 1 ′ is similar to the operation for label L 1 .
- label L 1 ′ has a copy&pop action associated with it, which label L 1 does not have.
- the other labels L 2 through Ln do not have a copy&pop action attached in this example.
- FIG. 4B when packet 401 is delivered to R 1 where label L 1 ′ is processed, the packet is replicated forming packet 403 . On the duplicate packet 403 , L 1 ′ is swapped to L 2 forming packet 404 and the packet 404 is further forwarded along the branch LSP towards Rn (e.g., via node 406 ). On the original packet, L 1 ′ is popped forming packet 402 , and the packet 402 is further processed based on label at level m- 1 , for example, to be delivered to node 405 . Note that the sequence of operations in FIG. 4B is shown for purposes of illustration only. It will be appreciated that other sequences, such as those shown in FIG. 4C , may be utilized.
- the label at level m-q is also a copy label, thus creating yet another branch in packet delivery, according to certain embodiments of the invention.
- the ingress R 0 of the branch LSP may perform the replication on R 0 itself.
- R 0 can push L 1 ′ onto the stack and send the packet to a forwarding engine for processing.
- a label stack with k- 1 labels on top corresponding to k- 1 branch popN LSPs with egress R 1 through Rk- 1 may be constructed, where one label at the bottom corresponding to a popN LSP with egress Rk.
- the value n for the popN operation may be chosen such that appropriate number of labels is popped and the packet processing continues at the correct place in the label stack.
- FIG. 5A is an example of a LIB for node A according to one embodiment.
- LIB 520 is shown for the purposes of illustration only. More or less information may be included in LIB 520 . Further, configurations similar to LIB 520 may also be utilized by other nodes.
- the labels and LSPs are formed using labels for branch LSPs resulting a label stack that can deliver packets correctly to B, C and D.
- label b 3 ′ is used for a branch pop3 LSP with egress B.
- Label c 2 ′ is used for a branch pop2 LSP with egress C.
- Label d is used for LSP with egress D.
- the top label b 3 ′ 551 will be processed first. Since it is a copy label based on LIB 520 of FIG. 5B , a replicate packet is created from packet 550 and the top label b 3 ′ is popped, forming packet 552 . On the original packet 500 , label b 3 ′ is swapped to a non-copy label b 3 ′′ forming packet 553 , and the packet 553 is forwarded along pop3 LSP B 3 towards B, where payload X is retrieved via the pop3 operation.
- label b 3 ′ is popped and label c 2 ′ becomes the top label. Since the label c 2 ′ is also a copy label based on LIB 520 , when it is processed, another replicate packet is created and the top label c 2 ′ is popped, forming packet 554 .
- label c 2 ′ is swapped to a non-copy label c 2 ′′, forming packet 553 , and the packet 553 is forwarded along pop2 LSP C 2 towards C.
- top label c 2 ′ is popped and label d becomes the top label.
- label d When label d is processed on packet 554 , it is swapped to the next label d′′ forming packet 555 and the packet 555 is forwarded along LSP D towards D, where the payload is retrieved via a pop operation.
- FIG. 6 is a flow diagram illustrating a label process according to another embodiment of the invention.
- Process 600 may be performed by a processing logic that may comprise hardware (circuitry, dedicated logic, etc.), software (such as is run on a dedicated machine), or a combination of both.
- process 600 may be processed by any one of the nodes shown in FIG. 1 prior to transmitting a packet to a next hop.
- a node receives a first packet (e.g., packet 550 ) having a stack of labels compatible with MPLS routing.
- the node parses a first label on the top of the label stack (e.g., label 551 ).
- the first packet is duplicated forming a second packet (e.g., packet 552 ).
- the first label (e.g., label 551 ) of the first packet is swapped with a second label (e.g., label b 3 ′′), forming a third packet 553 , and the third packet is transmitted to a destination associated with the second label (e.g., node B).
- a second label e.g., label b 3 ′′
- the third packet is transmitted to a destination associated with the second label (e.g., node B).
- the second packet e.g., packet 552
- one or more labels are popped from the label stack of the second packet (e.g., packet 552 ), forming a fourth packet (e.g., packet 554 ).
- the fourth packet is transmitted to a destination associated with the remaining top label of the label stack of the fourth packet (e.g., node D).
- Other operations may also be performed.
- a label stack may be used to distribute a packet with a payload along a predetermined distribution tree.
- the packet is forwarded to the branching nodes, gets replicated there then forwarded further to the next set of branching nodes and so on, until the packet is delivered to all receiving nodes.
- a branch list may be used to encode a branching node.
- a sequence of branch lists may be used to encode an arbitrary distribution tree.
- the egress of a branch LSP in a branch list may be another branch node.
- the value n in popN operation for a branch LSP inside a branch list may be chosen such that the packet processing continues at the appropriate branch list corresponding to the branch node at the egress of that branch LSP.
- FIGS. 7A-7E are diagrams illustrating a process of encoding an arbitrary tree according to certain embodiments of the invention. Since a label stack is essentially an array, a level order sequential representation (LOSR) is utilized to encode the tree in the label stack. Alternatively, a depth order sequential representation (DOSR) may also be utilized.
- LLR level order sequential representation
- DOSR depth order sequential representation
- a pointer to the child can be encoded as an offset from itself in number of elements.
- the separator “.” does no count as an element.
- B 2 means that a first child of B, which is D, is two elements away from B. In this way, the tree can be encoded as the array shown in FIG. 7D , also referred to as an LOSR.
- labels can be used to encode the array shown in FIG. 7D .
- Each list of siblings may be converted to a branch list, and each pointer to children encoded as offset of n may be converted to a label corresponding to a branch popN LSP or a popN LSP, as shown in FIG. 7E .
- a label corresponding to a branch popN LSP whose egress is the node corresponding to the element
- the label may be allocated by the parent node of the element on the tree.
- a label corresponding to a popN LSP whose egress is the node corresponding to the element, may be utilized.
- the label may be allocated by the parent nodes of the element on the tree.
- FIG. 8 is a flow diagram illustrating a process for encoding an arbitrary tree according to one embodiment.
- Process 800 may be performed by a processing logic that may comprise hardware (circuitry, dedicated logic, etc.), software (such as is run on a dedicated machine), or a combination of both.
- process 800 may be processed by any one of the nodes shown in FIG. 1 .
- substantially all nodes in a multicast tree are stored into an array in one or more levels.
- the nodes are stored in a from root to bottom and/or from left to right configuration.
- the tree is converted into a DAG by appending a payload at the end of the array.
- the DAG is converted to, for example, an LOSR, where a pointer to a child is encoded as an offset from a parent node in a number of elements in between. Alternatively, a DOSR may also be used.
- the LOSR is converted into a stack of labels suitable for MPLS routing.
- an element with an offset that is not the last one is encoded with a branch popN label, while an element with an offset that is the last one is encoded with a popN label.
- the outcome label stack may be processed using one or more techniques set forth above. Other operations may also be performed.
- FIG. 9 is a block diagram illustrating an example of a network element capable of processing MPLS packets according to one embodiment of the invention.
- network element 901 includes, but not limited to, a control module or modules 902 and a forwarding module or modules 903 .
- control module 902 includes one or more control policies 904 , which may include one or more routing policies.
- Forwarding module 903 may also include one or more forwarding policies 905 to control how a packet is being forwarded via one or more ports or interfaces 907 - 910 , which may be implemented within one or more line cards respectively.
- the forwarding policies 904 may be the same or a subset of the control policies 904 .
- the control and forwarding policies 904 - 905 may be stored in a machine-readable medium within the respective control module 902 and forwarding module 903 . Alternatively, the control and forwarding policies 904 - 905 may be stored in a machine-readable medium shared by the control module 902 and forwarding module 903 .
- network element 901 further includes a LIB or LIBs 906 to store labels suitable for MPLS routing, such as, for example, LIB 520 of FIG. 5B .
- LIB 906 may be accessible by the control module 902 and/or forwarding module 903 .
- LIB 906 may be implemented as a part of the control policies 904 and/or forwarding policies 905 .
- forwarding module 903 searches the forwarding policies 905 and/or LIB 906 to make a routing decision for each of the packets.
- the forwarding module 903 examines the information within a packet's header, searches the forwarding policies 905 and/or LIB 906 for a match, and directs the packet from an input interface to an output interface across a switch fabric (not shown), using one or more of the techniques set forth above. Other components may also be included.
- Embodiments of the present invention also relate to an apparatus for performing the operations herein.
- This apparatus may be specially constructed for the required purposes, or it may comprise a general-purpose computer selectively activated or reconfigured by a computer program stored in the computer.
- a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), erasable programmable ROMs (EPROMs), electrically erasable programmable ROMs (EEPROMs), magnetic or optical cards, or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus.
- ROMs read-only memories
- RAMs random access memories
- EPROMs erasable programmable ROMs
- EEPROMs electrically erasable programmable ROMs
- magnetic or optical cards or any type of media suitable for storing electronic
- a machine-readable medium may include any mechanism for storing or transmitting information in a form readable by a machine (e.g., a computer).
- a machine-readable medium includes read only memory (“ROM”); random access memory (“RAM”); magnetic disk storage media; optical storage media; flash memory devices; electrical, optical, acoustical or other form of propagated signals (e.g., carrier waves, infrared signals, digital signals, etc.); etc.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims (18)
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/706,125 US7801136B2 (en) | 2006-02-15 | 2007-02-12 | Source routed multicast LSP |
PCT/US2007/004008 WO2007095331A2 (en) | 2006-02-15 | 2007-02-15 | Source routed multicast lsp |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US77386706P | 2006-02-15 | 2006-02-15 | |
US11/706,125 US7801136B2 (en) | 2006-02-15 | 2007-02-12 | Source routed multicast LSP |
Publications (2)
Publication Number | Publication Date |
---|---|
US20070189291A1 US20070189291A1 (en) | 2007-08-16 |
US7801136B2 true US7801136B2 (en) | 2010-09-21 |
Family
ID=38368377
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/706,125 Active 2028-04-08 US7801136B2 (en) | 2006-02-15 | 2007-02-12 | Source routed multicast LSP |
Country Status (2)
Country | Link |
---|---|
US (1) | US7801136B2 (en) |
WO (1) | WO2007095331A2 (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20140036729A1 (en) * | 2012-08-03 | 2014-02-06 | Cisco Technology, Inc. | Label distribution and route installation in a loop-free routing topology using routing arcs |
US9148362B2 (en) | 2010-12-08 | 2015-09-29 | At&T Intellectual Property I, L.P. | Methods and apparatus for network multicasting using hierarchical replication |
US9699071B2 (en) | 2014-04-28 | 2017-07-04 | Huawei Technologies Co., Ltd. | Centrally optimized variable length coding for source routed multicast |
Families Citing this family (59)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7016351B1 (en) * | 2000-02-29 | 2006-03-21 | Cisco Technology, Inc. | Small group multicast in a computer network |
US7570604B1 (en) | 2004-08-30 | 2009-08-04 | Juniper Networks, Inc. | Multicast data trees for virtual private local area network (LAN) service multicast |
US20070274286A1 (en) * | 2006-05-24 | 2007-11-29 | Ranganathan Krishnan | Overhead reduction in an ad-hoc wireless network |
US8064441B2 (en) | 2007-03-09 | 2011-11-22 | Cisco Technology, Inc. | Upstream label allocation on Ethernets for MP2MP LSPS |
JP5115033B2 (en) * | 2007-05-30 | 2013-01-09 | 富士通株式会社 | Packet relay method and apparatus |
US20090168779A1 (en) * | 2007-12-31 | 2009-07-02 | Nguyen Loc Q | Integration of multi-protocol label switching (MPLS) |
US7936780B1 (en) * | 2008-03-12 | 2011-05-03 | Juniper Networks, Inc. | Hierarchical label distribution protocol for computer networks |
US20100110937A1 (en) * | 2008-10-31 | 2010-05-06 | Hewlett-Packard Development Company, L.P. | Systems and Methods for Improving Multicast Communications |
US7929557B2 (en) * | 2008-11-14 | 2011-04-19 | Juniper Networks, Inc. | Summarization and longest-prefix match within MPLS networks |
US8370394B2 (en) * | 2009-07-17 | 2013-02-05 | International Business Machines Corporation | Parallel processing of data organized in a tree structure |
US9369371B2 (en) | 2012-10-05 | 2016-06-14 | Cisco Technologies, Inc. | Method and system for path monitoring using segment routing |
US9049233B2 (en) | 2012-10-05 | 2015-06-02 | Cisco Technology, Inc. | MPLS segment-routing |
US10419335B1 (en) | 2012-12-27 | 2019-09-17 | Sitting Man, Llc | Region scope-specific outside-scope indentifier-equipped routing methods, systems, and computer program products |
US10447575B1 (en) | 2012-12-27 | 2019-10-15 | Sitting Man, Llc | Routing methods, systems, and computer program products |
US10587505B1 (en) | 2012-12-27 | 2020-03-10 | Sitting Man, Llc | Routing methods, systems, and computer program products |
US10411997B1 (en) | 2012-12-27 | 2019-09-10 | Sitting Man, Llc | Routing methods, systems, and computer program products for using a region scoped node identifier |
US10476787B1 (en) | 2012-12-27 | 2019-11-12 | Sitting Man, Llc | Routing methods, systems, and computer program products |
US10904144B2 (en) | 2012-12-27 | 2021-01-26 | Sitting Man, Llc | Methods, systems, and computer program products for associating a name with a network path |
US10397101B1 (en) | 2012-12-27 | 2019-08-27 | Sitting Man, Llc | Routing methods, systems, and computer program products for mapping identifiers |
US10404582B1 (en) | 2012-12-27 | 2019-09-03 | Sitting Man, Llc | Routing methods, systems, and computer program products using an outside-scope indentifier |
US10374938B1 (en) | 2012-12-27 | 2019-08-06 | Sitting Man, Llc | Routing methods, systems, and computer program products |
US10419334B1 (en) | 2012-12-27 | 2019-09-17 | Sitting Man, Llc | Internet protocol routing methods, systems, and computer program products |
US10411998B1 (en) | 2012-12-27 | 2019-09-10 | Sitting Man, Llc | Node scope-specific outside-scope identifier-equipped routing methods, systems, and computer program products |
US10404583B1 (en) | 2012-12-27 | 2019-09-03 | Sitting Man, Llc | Routing methods, systems, and computer program products using multiple outside-scope identifiers |
US10212076B1 (en) | 2012-12-27 | 2019-02-19 | Sitting Man, Llc | Routing methods, systems, and computer program products for mapping a node-scope specific identifier |
US10397100B1 (en) | 2012-12-27 | 2019-08-27 | Sitting Man, Llc | Routing methods, systems, and computer program products using a region scoped outside-scope identifier |
US9565160B2 (en) | 2013-03-11 | 2017-02-07 | Cisco Technology, Inc. | Advertisement of adjacency segment identifiers |
US9559954B2 (en) | 2013-03-11 | 2017-01-31 | Cisco Technology, Inc. | Indexed segment ID |
US9537718B2 (en) | 2013-03-15 | 2017-01-03 | Cisco Technology, Inc. | Segment routing over label distribution protocol |
US9537769B2 (en) | 2013-03-15 | 2017-01-03 | Cisco Technology, Inc. | Opportunistic compression of routing segment identifier stacks |
US9319312B2 (en) | 2013-05-17 | 2016-04-19 | Cisco Technology, Inc. | Segment routing mapping server for LDP/SR interoperability |
US9571897B2 (en) | 2013-09-17 | 2017-02-14 | Cisco Technology, Inc. | Bit indexed explicit replication for professional media networks |
US9544230B2 (en) | 2013-09-17 | 2017-01-10 | Cisco Technology, Inc. | Migration support for bit indexed explicit replication |
US10218524B2 (en) | 2013-09-17 | 2019-02-26 | Cisco Technology, Inc. | Bit indexed explicit replication for layer 2 networking |
US11451474B2 (en) | 2013-09-17 | 2022-09-20 | Cisco Technology, Inc. | Equal cost multi-path with bit indexed explicit replication |
US10461946B2 (en) | 2013-09-17 | 2019-10-29 | Cisco Technology, Inc. | Overlay signaling for bit indexed explicit replication |
US10003494B2 (en) | 2013-09-17 | 2018-06-19 | Cisco Technology, Inc. | Per-prefix LFA FRR with bit indexed explicit replication |
US9438432B2 (en) | 2013-09-17 | 2016-09-06 | Cisco Technology, Inc. | Bit indexed explicit replication packet encapsulation |
US9806897B2 (en) | 2013-09-17 | 2017-10-31 | Cisco Technology, Inc. | Bit indexed explicit replication forwarding optimization |
US9942053B2 (en) | 2013-09-17 | 2018-04-10 | Cisco Technology, Inc. | Bit indexed explicit replication using internet protocol version 6 |
US9762488B2 (en) | 2014-03-06 | 2017-09-12 | Cisco Technology, Inc. | Segment routing extension headers |
US9401858B2 (en) | 2014-06-30 | 2016-07-26 | Cisco Technology, Inc. | Loop avoidance during network convergence in switched networks |
US9807001B2 (en) | 2014-07-17 | 2017-10-31 | Cisco Technology, Inc. | Segment routing using a remote forwarding adjacency identifier |
US9432205B2 (en) | 2014-11-04 | 2016-08-30 | Telefonaktiebolaget L M Ericsson (Publ) | Explicit block encoding of multicast group membership information with bit index explicit replication (BIER) |
US9742575B2 (en) | 2014-11-04 | 2017-08-22 | Telefonaktiebolaget L M Ericsson (Publ) | Explicit list encoding of sparse multicast group membership information with Bit Index Explicit Replication (BIER) |
US9906378B2 (en) | 2015-01-27 | 2018-02-27 | Cisco Technology, Inc. | Capability aware routing |
US10341221B2 (en) | 2015-02-26 | 2019-07-02 | Cisco Technology, Inc. | Traffic engineering for bit indexed explicit replication |
US9736058B2 (en) * | 2015-05-20 | 2017-08-15 | Huawei Technologies Co., Ltd. | Multi-region source routed multicast using sub-tree identifiers |
US10263881B2 (en) | 2016-05-26 | 2019-04-16 | Cisco Technology, Inc. | Enforcing strict shortest path forwarding using strict segment identifiers |
US10530661B2 (en) | 2016-06-30 | 2020-01-07 | At&T Intellectual Property I, L.P. | Systems and methods for modeling networks |
US10223475B2 (en) | 2016-08-31 | 2019-03-05 | At&T Intellectual Property I, L.P. | Database evaluation of anchored length-limited path expressions |
US11032197B2 (en) | 2016-09-15 | 2021-06-08 | Cisco Technology, Inc. | Reroute detection in segment routing data plane |
US10621236B2 (en) | 2016-09-16 | 2020-04-14 | At&T Intellectual Property I, L.P. | Concept based querying of graph databases |
US10685063B2 (en) | 2016-09-16 | 2020-06-16 | At&T Intellectual Property I, L.P. | Time-based querying of graph databases |
US10630743B2 (en) | 2016-09-23 | 2020-04-21 | Cisco Technology, Inc. | Unicast media replication fabric using bit indexed explicit replication |
US10637675B2 (en) | 2016-11-09 | 2020-04-28 | Cisco Technology, Inc. | Area-specific broadcasting using bit indexed explicit replication |
US10447496B2 (en) | 2017-03-30 | 2019-10-15 | Cisco Technology, Inc. | Multicast traffic steering using tree identity in bit indexed explicit replication (BIER) |
US10164794B2 (en) | 2017-04-28 | 2018-12-25 | Cisco Technology, Inc. | Bridging of non-capable subnetworks in bit indexed explicit replication |
US11140074B2 (en) | 2019-09-24 | 2021-10-05 | Cisco Technology, Inc. | Communicating packets across multi-domain networks using compact forwarding instructions |
Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20030043745A1 (en) * | 2001-08-27 | 2003-03-06 | Shinya Kano | Path modifying method, label switching node and administrative node in label transfer network |
US6694323B2 (en) * | 2002-04-25 | 2004-02-17 | Sybase, Inc. | System and methodology for providing compact B-Tree |
US20050149471A1 (en) * | 2002-02-27 | 2005-07-07 | Edmond Lassalle | Computer representation of a data tree structure and the associated encoding/decoding methods |
US20050169270A1 (en) * | 2003-03-19 | 2005-08-04 | Ryoichi Mutou | Router, frame forwarding method, and lower layer frame virtual forwarding system |
US20060159009A1 (en) * | 2005-01-14 | 2006-07-20 | Jin-Hyoung Kim | Fast rerouting apparatus and method for MPLS multicast |
US20060209840A1 (en) * | 2001-05-04 | 2006-09-21 | Slt Logic Llc | System and method for providing transformation of multi-protocol packets in a data stream |
-
2007
- 2007-02-12 US US11/706,125 patent/US7801136B2/en active Active
- 2007-02-15 WO PCT/US2007/004008 patent/WO2007095331A2/en unknown
Patent Citations (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060209840A1 (en) * | 2001-05-04 | 2006-09-21 | Slt Logic Llc | System and method for providing transformation of multi-protocol packets in a data stream |
US20030043745A1 (en) * | 2001-08-27 | 2003-03-06 | Shinya Kano | Path modifying method, label switching node and administrative node in label transfer network |
US20050149471A1 (en) * | 2002-02-27 | 2005-07-07 | Edmond Lassalle | Computer representation of a data tree structure and the associated encoding/decoding methods |
US6694323B2 (en) * | 2002-04-25 | 2004-02-17 | Sybase, Inc. | System and methodology for providing compact B-Tree |
US20050169270A1 (en) * | 2003-03-19 | 2005-08-04 | Ryoichi Mutou | Router, frame forwarding method, and lower layer frame virtual forwarding system |
US20060159009A1 (en) * | 2005-01-14 | 2006-07-20 | Jin-Hyoung Kim | Fast rerouting apparatus and method for MPLS multicast |
Non-Patent Citations (4)
Title |
---|
Albert J. Tian, et al., "Source Routed MPLS LSP Using Domain Wide Label", Network Working Group, Internet Draft, Jul. 2004, http://tools.ietf.org/html/draft-tian-mpls-lsp-source-route-01. |
E. Rosen, et al., "BGP/MPLS VPNs", Network Working Group, Informational, 24 pgs., http://www.ietf.org/rfc/rfc/2547.txt?number=2547, Mar. 1999. |
E. Rosen, et al., "Multiprotocol Label Switching Architecture", Network Working Group, Standards Track, Jan. 2001, 57 pgs., http://www.ietf.org/rfc/rfc/3031.txt. |
L. Anderson, et al., "LDP Specification", Network Working Group, Standards Track, Jan. 2001, 124 pgs., http://www.ietf.org/rfc/rfc/3036.txt. |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9148362B2 (en) | 2010-12-08 | 2015-09-29 | At&T Intellectual Property I, L.P. | Methods and apparatus for network multicasting using hierarchical replication |
US9800421B2 (en) | 2010-12-08 | 2017-10-24 | At&T Intellectual Property I, L.P. | Methods and apparatus for network multicasting using hierarchical replication |
US20140036729A1 (en) * | 2012-08-03 | 2014-02-06 | Cisco Technology, Inc. | Label distribution and route installation in a loop-free routing topology using routing arcs |
US9246794B2 (en) * | 2012-08-03 | 2016-01-26 | Cisco Technology, Inc. | Label distribution and route installation in a loop-free routing topology using routing arcs |
US9699071B2 (en) | 2014-04-28 | 2017-07-04 | Huawei Technologies Co., Ltd. | Centrally optimized variable length coding for source routed multicast |
Also Published As
Publication number | Publication date |
---|---|
WO2007095331A2 (en) | 2007-08-23 |
US20070189291A1 (en) | 2007-08-16 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7801136B2 (en) | Source routed multicast LSP | |
JP5314046B2 (en) | Replacing MPLS SP nodes using link state protocol controlled Ethernet networks | |
US9338087B2 (en) | Source identification preservation in multiprotocol label switching networks | |
CN112583717B (en) | Method, peer device, and medium for constructing next hop attribute change label | |
US11483237B2 (en) | BIER traffic engineering (BIER-TE) using unicast MPLS-TE tunnels | |
AU2004227785B2 (en) | Method for recursive BGP route updates in MPLS networks | |
US7529199B1 (en) | System and method for resolving conflicts in proxy routing information associated with multicast distribution trees | |
US7787380B1 (en) | Resource reservation protocol with traffic engineering point to multi-point label switched path hierarchy | |
US8064440B2 (en) | Technique for avoiding IP lookup with multipoint-to-multipoint label switched paths | |
US7792111B2 (en) | Point-to-multipoint for multicast and unicast forwarding | |
CN107070788B (en) | Method and apparatus for distribution of multicast traffic over a computer network | |
CN109309623A (en) | The maximum redundancy tree to redundant multicast source node for multicast protection | |
CN113347091B (en) | Flexible algorithm aware border gateway protocol prefix segment route identifier | |
US20070189170A1 (en) | Method and system for maximizing network capacity utilization in multiprotocol label switched networks by moving label switched paths | |
EP2747356A1 (en) | Reduced complexity multiprotocol label switching | |
CN101243648A (en) | Method and apparatus for enabling routing of label switched data packets | |
US9088498B2 (en) | Communication networks that provide a common transport domain for use by multiple service domains and methods and computer program products for using the same | |
US9344357B2 (en) | Label-switched path aggregation | |
KR101318001B1 (en) | Linking inner and outer mpls labels | |
US7319699B1 (en) | Distributed imposition of multi-level label stack using local label | |
US8176201B1 (en) | Controlling the signaling of label-switched paths using a label distribution protocol employing messages which facilitate the use of external prefixes | |
JP4522955B2 (en) | Multicast point-to-point (MP2P) multiprotocol label switching (MPLS) traffic engineering (TE) communication system | |
Salvador et al. | Supporting IP dense mode multicast routing protocols in WDM all-optical networks | |
Rosen | RFC 8277: Using BGP to Bind MPLS Labels to Address Prefixes | |
Chaitou et al. | On optimizing leaf initiated point to multi point trees in MPLS |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: REDBACK NETWORKS INC., CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:TIAN, ALBERT JINING;REEL/FRAME:018987/0886 Effective date: 20070209 |
|
AS | Assignment |
Owner name: ERICSSON AB,SWEDEN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:REDBACK NETWORKS INC.;REEL/FRAME:024002/0363 Effective date: 20070125 Owner name: ERICSSON AB, SWEDEN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:REDBACK NETWORKS INC.;REEL/FRAME:024002/0363 Effective date: 20070125 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
CC | Certificate of correction | ||
FPAY | Fee payment |
Year of fee payment: 4 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 8TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1552) Year of fee payment: 8 |
|
MAFP | Maintenance fee payment |
Free format text: PAYMENT OF MAINTENANCE FEE, 12TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: M1553); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Year of fee payment: 12 |