US20110292838A1 - Provider link state bridging (plsb) computation method - Google Patents
Provider link state bridging (plsb) computation method Download PDFInfo
- Publication number
- US20110292838A1 US20110292838A1 US13/204,309 US201113204309A US2011292838A1 US 20110292838 A1 US20110292838 A1 US 20110292838A1 US 201113204309 A US201113204309 A US 201113204309A US 2011292838 A1 US2011292838 A1 US 2011292838A1
- Authority
- US
- United States
- Prior art keywords
- node
- partition
- nodes
- immediate neighbor
- shortest path
- 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.)
- Granted
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
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- 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/02—Topology update or discovery
- H04L45/04—Interdomain routing, e.g. hierarchical routing
-
- 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/16—Multipoint routing
-
- 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/18—Loop-free operations
-
- 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/66—Layer 2 routing, e.g. in Ethernet based MAN's
Definitions
- the present invention relates to traffic forwarding in packet networks, and in particular to a Provider Link State Bridging (PLSB) computation method.
- PLSB Provider Link State Bridging
- IP Internet Protocol
- Ethernet Ethernet frames are forwarded according to forwarding state stored at each Ethernet switch in the network.
- PDU Protocol Data Unit
- Multicast forwarding of data packets is of increasing importance as demand for services such as Internet Protocol Television (IPTV) and Video on Demand (VoD) grows.
- IPTV Internet Protocol Television
- VoD Video on Demand
- Protocols such as Intermediate System-Intermediate System (IS-IS) and Open Shortest Path First (OSPF) and Multicast OSPF are used to distribute topology information to permit distributed calculation of paths that interconnect multiple nodes, resulting in the installation of the forwarding state required to implement those paths.
- OSPF and IS-IS are run in a distributed manner across nodes of the network so that, for example, when a topology change occurs in the network such as a node or link failure, this information is flooded to all nodes by the protocol's operation, and each node will locally recompute paths to circumvent the failure based on a consistent view of the network topology.
- PBT Provider Backbone Transport
- PBB-TE Provider Back-Bone Bridging-Traffic Engineering
- PBB-TE Provider Back-Bone Bridging-Traffic Engineering
- PBSB Provider Link State Bridging
- FDB filtering database
- multicast trees in a PLSB network are computed using an all-pairs shortest path multicast route computation algorithm known, for example, from Applicant's co-pending U.S. Patent Application Publication No. 20070165657.
- shortest path multicast route computation algorithm known, for example, from Applicant's co-pending U.S. Patent Application Publication No. 20070165657.
- the node when a node receives either a multicast group membership change or a network topology change (for example via a Link State Protocol Data Unit—LSP) the node employs algorithms such as Dijkstra's algorithm to compute both unicast connectivity and the set of pairs of network nodes that are connected by a shortest path which traverses the computing node.
- LSP Link State Protocol Data Unit
- the node determines where intersections of multicast group membership occur, and defines the required FDB entries to instantiate its portion of multicast paths accordingly.
- Both Unicast and Multicast forwarding state implementing the computed paths is then installed in the node's filtering database (FDB), so that received packets can be forwarded to the appropriate output port(s) of the node, based on the destination address in the frame.
- FDB filtering database
- identifying pairs of nodes for which the respective shortest path traverses a particular node is computationally intensive, because it involves examining the paths extending from each node to every other node. In some cases, the challenge of performing the required computations within an acceptable period of time can impose limitations on the size of the network. Clearly, more powerful processors can be used to increase the speed of computation, but only by increasing the cost of each node, which may be undesirable.
- an aspect of the present invention provides a method of multicast route computation in a link state protocol controlled network.
- a spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol.
- the network is then divided into two or more partitions, each partition encompassing an immediate neighbour node of the first node and any nodes of the network subtending the neighbour node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node is examined to identify node pairs for which a respective shortest path traverses the first node.
- FIG. 1 is a flow chart illustrating principle steps in a method according to a representative embodiment of the present invention
- FIGS. 2 a - e illustrate steps in the process of FIG. 1 implemented in a representative network.
- the present invention provides a PLSB computation method in which the number of nodes that must be examined, in order to find all of the node pairs for which the respective shortest path traverses a given node, is minimized. In some cases, the number of nodes that must be examined can be reduced to zero. Embodiments of the invention are described below, by way of example only, with reference to FIGS. 1-2 e.
- the method of the present invention is valid for networks in which computed shortest paths are symmetric (that is, the network can be represented as an undirected graph) and, if two or more equal-cost paths can be computed between any two nodes, a tie-breaking method must be implemented which will select one of the equal-cost paths in such a way that the selected “shortest” paths are symmetric and locally consistent.
- “locally consistent” means that any sub-path of the equal-cost path selected by the tie-breaking method must itself be a shortest path selected by the tie-breaking method.
- a representative tie-breaking method which may be used in conjunction with the methods of the present invention, is known from Applicant's co-pending U.S. patent application Ser. No. 11/964,478, which was filed on Dec. 26, 2007.
- FIG. 1 is a flow chart illustrating principle steps in a method according to a representative embodiment of the present invention
- FIGS. 2 a - e illustrate steps in the process of FIG. 1 implemented in a representative network.
- a representative PLSB network comprises a plurality of nodes (labelled as nodes A-R) interconnected by links.
- nodes A-R nodes interconnected by links.
- every node in the network of FIGS. 2 a - e is connected to at least two other nodes, although this is not essential.
- the method of the present invention will be implemented to execute in every node, substantially in parallel. In the following description, the method is described by way of an example in which shortest paths traversing node “A” are identified.
- a spanning tree from node “A” to every other node in the network is computed, for example using a known shortest path tree algorithm such as Dijkstra's algorithm.
- the spanning tree (indicated by bold lines in FIGS. 2 b - e ) comprises a plurality of branches extending from node “A” to each of its immediate neighbours (nodes B, C, D and E). By construction, all of the nodes of the network are on one of these branches.
- each partition will therefore include a respective one of the neighbour nodes, and all of the nodes that subtend that neighbour node on the spanning tree.
- each branch/partition may be referenced using the identifier of the respective neighbour node which serves as the root of that branch.
- the four partitions are identified as partitions “B”, “C”, “D” and “E”, following the identity of their respective root nodes.
- any shortest path that traverses node “A” must necessarily originate in one partition and terminate in a second partition. Because of path symmetry between node pairs, the number of nodes that need to be examined, in order to find all of the node pairs for which the respective shortest path traverses node “A”, can be reduced by considering the nodes in all but one of the partitions. The benefits of this reduction can be maximized by recognising that the largest partition, in terms of the number of member nodes, can be selected as the omitted partition, so that only paths terminating at nodes in the remaining smaller partitions are considered.
- a further reduction in the number of nodes that must be examined can be obtained by recognising that the shortest path between any node in one partition and any node in any other partition will not traverse node “A” if, and only if, there is a path between the respective root nodes of the involved partitions that is shorter than the two-hop path through node “A”. For example, consider a path between nodes M and R in the embodiment of FIG. 2 , which are respectively located in partitions “D” and “E”. In this example we will only consider number of hops as the shortest path criterion although other criteria are equally applicable. Inspection of the network reveals that the root nodes “D” and “E” are directly connected by a link.
- This process of identifying shorter paths between pairs of root nodes in the pair of partitions or super-partitions under consideration, and merging partitions whenever a sufficient number of shorter paths is found, can be repeated until either: all of the partitions have been merged into a one super-partition (which in fact encompasses the entire network except node “A”); or there are no more pairs of partitions for which all the root nodes are interconnected by paths that are shorter than the two-hop paths through node “A”. Whether two partitions can be merged can be determined by considering the root nodes in the proposed merged partition.
- the two partitions can be merged if, and only if, the respective root nodes of the two partitions are connected by a shorter path than the two-hop path through node “A”.
- the two partitions can be merged together if none of the shortest paths between the root node of the partition and the N root nodes of the super-partition go through node “A”.
- partition “C” can not be merged with super partition “BDE”, because there is no direct link between root node “C” and root node E of the super partition “BDE”. In fact, partition “C” could not be merged with partition “E” or any super-partition including partition “E”.
- the benefits obtained by merging partitions is dependent on the network topology.
- the number of nodes that must be examined is zero (after the initial overhead of the partitioning step).
- the process of merging partitions will result in a plurality of partitions and/or super-partitions.
- node “A” is a dual-connected edge node
- the initial number of partitions is two. If these two partitions can be merged successfully, the number of nodes that must be subsequently examined is reduced to zero. Otherwise, in the worst case, the number of nodes that must be examined is slightly less than half the number of nodes in the network, which is still a substantial improvement over conventional methods.
- route computation methods such as Intermediate System-Intermediate System (IS-IS) and Open Shortest Path First (OSPF) and Multicast OSPF can produce multiple equal-cost paths between node pairs.
- IS-IS Intermediate System-Intermediate System
- OSPF Open Shortest Path First
- Multicast OSPF Multicast OSPF
- the above-described method for merging partitions may be used without modification where either: the “cost” of each path is proportional to the number of hops; or the “cost” of a direct link between two partitions is less than the “cost” of the two-hop path through the node of interest (node “A” in the example of FIG. 2 ).
- a tie-breaking algorithm must be used to select a “shortest” path or subset of shortest paths from among the set of equal-cost paths between a node pair.
- the above-described method for merging partitions can be used, provided that the “shortest” path(s) selected by the tie-breaking algorithm are symmetric and locally consistent.
- the route computation methods yields three equal cost paths between nodes C and E, and a tie-breaking algorithm is used to select one of these equal-cost paths as the “shortest” path.
- the above-described methods could be used to merge partition “C” with super-partition “BDE” if the tie-breaking method selected, as the shortest path, either one of the two paths through nodes B or D, but not the path through node “A”.
- this same methodology can be extended to a case where the route computation algorithm computes a set of equal-cost paths, and the tie breaking mechanism operates to select a subset of two or more of these equal cost paths as the shortest paths.
- the criterion for merging two partitions is that none of the selected shortest paths traverse the node under consideration.
- the tie-breaking mechanism could potentially select any two of the paths between nodes C and E as the set of shortest paths, and the above-described methods could be used to merge partition “C” with super-partition “BDE” if this set of shortest paths did not include the path through node “A”.
Abstract
Description
- This is the first application filed for the present invention.
- Not Applicable.
- The present invention relates to traffic forwarding in packet networks, and in particular to a Provider Link State Bridging (PLSB) computation method.
- Network operators and carriers are deploying packet-switched communications networks in place of circuit-switched networks. In packet-switched networks such as Internet Protocol (IP) networks, IP packets are routed according to routing state stored at each IP router in the network. Similarly, in Ethernet networks, Ethernet frames are forwarded according to forwarding state stored at each Ethernet switch in the network. The present invention applies to communications networks employing any Protocol Data Unit (PDU) based network and in this document, the terms “packet” and “packet-switched network”, “routing”, “frame” and “frame-based network”, “forwarding” and cognate terms are intended to cover any PDUs, communications networks using PDUs and the selective transmission of PDUs from network node to network node.
- Multicast forwarding of data packets (where packets are sent from a source node to multiple destination nodes more or less simultaneously) is of increasing importance as demand for services such as Internet Protocol Television (IPTV) and Video on Demand (VoD) grows.
- Protocols such as Intermediate System-Intermediate System (IS-IS) and Open Shortest Path First (OSPF) and Multicast OSPF are used to distribute topology information to permit distributed calculation of paths that interconnect multiple nodes, resulting in the installation of the forwarding state required to implement those paths. OSPF and IS-IS are run in a distributed manner across nodes of the network so that, for example, when a topology change occurs in the network such as a node or link failure, this information is flooded to all nodes by the protocol's operation, and each node will locally recompute paths to circumvent the failure based on a consistent view of the network topology.
- In Ethernet networks, Provider Backbone Transport (PBT), also known as Provider Back-Bone Bridging-Traffic Engineering (PBB-TE), as described in Applicant's British patent number GB 2422508 is used to provide a unicast Ethernet transport technology. Provider Link State Bridging (PLSB) as described in Applicant's co-pending U.S. patent application Ser. No. 11/537,775 will be used to provide a multicast transport capability for Ethernet networks using IS-IS to set up both unicast paths and multicast trees in the network. Both above patent documents are hereby incorporated by reference.
- While the present invention is not limited to the application of a routing system to Ethernet bridging, Ethernet terminology is used in this disclosure where possible. So, for example, the term filtering database (FDB) can be considered interchangeable with any term for an information repository of packet forwarding information, such as forwarding information base or label information base.
- Typically, multicast trees in a PLSB network are computed using an all-pairs shortest path multicast route computation algorithm known, for example, from Applicant's co-pending U.S. Patent Application Publication No. 20070165657. In accordance with this method, when a node receives either a multicast group membership change or a network topology change (for example via a Link State Protocol Data Unit—LSP) the node employs algorithms such as Dijkstra's algorithm to compute both unicast connectivity and the set of pairs of network nodes that are connected by a shortest path which traverses the computing node. For that set of node pairs, the node determines where intersections of multicast group membership occur, and defines the required FDB entries to instantiate its portion of multicast paths accordingly. Both Unicast and Multicast forwarding state implementing the computed paths is then installed in the node's filtering database (FDB), so that received packets can be forwarded to the appropriate output port(s) of the node, based on the destination address in the frame.
- As may be appreciated, identifying pairs of nodes for which the respective shortest path traverses a particular node is computationally intensive, because it involves examining the paths extending from each node to every other node. In some cases, the challenge of performing the required computations within an acceptable period of time can impose limitations on the size of the network. Clearly, more powerful processors can be used to increase the speed of computation, but only by increasing the cost of each node, which may be undesirable.
- Techniques for improving the efficiency of multicast route computation in packet switched networks remain highly desirable.
- Thus, an aspect of the present invention provides a method of multicast route computation in a link state protocol controlled network. A spanning tree is computed from a first node to every other node in the network using a known spanning tree protocol. The network is then divided into two or more partitions, each partition encompassing an immediate neighbour node of the first node and any nodes of the network subtending the neighbour node on the spanning tree. Two or more of the partitions are merged when a predetermined criterion is satisfied. Nodes within all of the partitions except a largest one of the partitions are then identified, and each identified node is examined to identify node pairs for which a respective shortest path traverses the first node.
- Further features and advantages of the present invention will become apparent from the following detailed description, taken in combination with the appended drawings, in which:
-
FIG. 1 is a flow chart illustrating principle steps in a method according to a representative embodiment of the present invention; -
FIGS. 2 a-e illustrate steps in the process ofFIG. 1 implemented in a representative network. - It will be noted that throughout the appended drawings, like features are identified by like reference numerals.
- The present invention provides a PLSB computation method in which the number of nodes that must be examined, in order to find all of the node pairs for which the respective shortest path traverses a given node, is minimized. In some cases, the number of nodes that must be examined can be reduced to zero. Embodiments of the invention are described below, by way of example only, with reference to
FIGS. 1-2 e. - As an initial matter, it should be noted that the method of the present invention is valid for networks in which computed shortest paths are symmetric (that is, the network can be represented as an undirected graph) and, if two or more equal-cost paths can be computed between any two nodes, a tie-breaking method must be implemented which will select one of the equal-cost paths in such a way that the selected “shortest” paths are symmetric and locally consistent. In this respect, “locally consistent” means that any sub-path of the equal-cost path selected by the tie-breaking method must itself be a shortest path selected by the tie-breaking method. A representative tie-breaking method, which may be used in conjunction with the methods of the present invention, is known from Applicant's co-pending U.S. patent application Ser. No. 11/964,478, which was filed on Dec. 26, 2007.
-
FIG. 1 is a flow chart illustrating principle steps in a method according to a representative embodiment of the present invention, andFIGS. 2 a-e illustrate steps in the process ofFIG. 1 implemented in a representative network. - Referring first to
FIG. 2 a, a representative PLSB network comprises a plurality of nodes (labelled as nodes A-R) interconnected by links. As is typical in a PLSB network, every node in the network ofFIGS. 2 a-e is connected to at least two other nodes, although this is not essential. Preferably, the method of the present invention will be implemented to execute in every node, substantially in parallel. In the following description, the method is described by way of an example in which shortest paths traversing node “A” are identified. - Referring now to
FIGS. 1 and 2 b, at a first step, a spanning tree from node “A” to every other node in the network is computed, for example using a known shortest path tree algorithm such as Dijkstra's algorithm. As may be seen inFIG. 2 b, the spanning tree (indicated by bold lines inFIGS. 2 b-e) comprises a plurality of branches extending from node “A” to each of its immediate neighbours (nodes B, C, D and E). By construction, all of the nodes of the network are on one of these branches. Thus it is possible to notionally divide the network into a set of partitions, each of which encompasses a respective branch of the spanning tree. - By construction, each partition will therefore include a respective one of the neighbour nodes, and all of the nodes that subtend that neighbour node on the spanning tree. For convenience of description, each branch/partition may be referenced using the identifier of the respective neighbour node which serves as the root of that branch. Thus, in
FIG. 2 c, the four partitions are identified as partitions “B”, “C”, “D” and “E”, following the identity of their respective root nodes. - As may be seen from
FIG. 2 c, any shortest path that traverses node “A” must necessarily originate in one partition and terminate in a second partition. Because of path symmetry between node pairs, the number of nodes that need to be examined, in order to find all of the node pairs for which the respective shortest path traverses node “A”, can be reduced by considering the nodes in all but one of the partitions. The benefits of this reduction can be maximized by recognising that the largest partition, in terms of the number of member nodes, can be selected as the omitted partition, so that only paths terminating at nodes in the remaining smaller partitions are considered. - A further reduction in the number of nodes that must be examined can be obtained by recognising that the shortest path between any node in one partition and any node in any other partition will not traverse node “A” if, and only if, there is a path between the respective root nodes of the involved partitions that is shorter than the two-hop path through node “A”. For example, consider a path between nodes M and R in the embodiment of
FIG. 2 , which are respectively located in partitions “D” and “E”. In this example we will only consider number of hops as the shortest path criterion although other criteria are equally applicable. Inspection of the network reveals that the root nodes “D” and “E” are directly connected by a link. Consequently, the shortest path between nodes M and R traverses only root nodes “D” and “E”, and does not traverse node “A”. Consideration of the other nodes in partitions “D” and “E” reveals that, while not all of the shortest paths (between a node in partition “D” and a node in partition “E”) traverse the direct link between root nodes “D” and “E”, the presence of that direct link guarantees that none of these shortest paths will traverse node “A”. Accordingly, partitions “D” and “E” can be merged into a single super-partition “DE” for the purpose of the computations at “A”. - This process of identifying shorter paths between pairs of root nodes in the pair of partitions or super-partitions under consideration, and merging partitions whenever a sufficient number of shorter paths is found, can be repeated until either: all of the partitions have been merged into a one super-partition (which in fact encompasses the entire network except node “A”); or there are no more pairs of partitions for which all the root nodes are interconnected by paths that are shorter than the two-hop paths through node “A”. Whether two partitions can be merged can be determined by considering the root nodes in the proposed merged partition. In the simple case of a pair of partitions each having a single root node, the two partitions can be merged if, and only if, the respective root nodes of the two partitions are connected by a shorter path than the two-hop path through node “A”. For the more complex case of a partition having one root node and a super-partition having N (where N>1) root nodes, the two partitions can be merged together if none of the shortest paths between the root node of the partition and the N root nodes of the super-partition go through node “A”.
- Thus, continuing the example at
FIG. 2 d, and continuing to use the number of hops as shortest path criteria, the partition “B” can be merged with super-partition “DE” (having N=2 root nodes) to produce super-partition “BDE”, because root node “B” is directly connected to the two root nodes of super-partition “DE”. This guarantees that there is no shortest path between any pair of nodes in super-partition “BDE” which traverses node “A”. On the other hand, and referring toFIG. 2 e, partition “C” can not be merged with super partition “BDE”, because there is no direct link between root node “C” and root node E of the super partition “BDE”. In fact, partition “C” could not be merged with partition “E” or any super-partition including partition “E”. - As may be seen in
FIG. 2 e, completion of the above process of merging partitions results in the network being divided into two partitions, namely partition “C” and super partition “BDE”. As noted above, all of the shortest paths of interest can be found by examining the nodes within each partition except the largest partition. In the case ofFIG. 2 e, all of the shortest paths that traverse node “A” can be discovered by examining node “C” to identify each shortest path extending from node “C” which traverses node “A”. As will be appreciated, this dramatically reduces the PLSB computation required for the network in this example, since paths extending from only one node (as opposed to 17 nodes using conventional methods) must be considered. - It will be understood that the benefits obtained by merging partitions is dependent on the network topology. In a scenario in which all partitions can be merged into a single super-partition, which therefore encompasses the entire network, then the number of nodes that must be examined is zero (after the initial overhead of the partitioning step). In a more typical scenario, the process of merging partitions will result in a plurality of partitions and/or super-partitions. In the special case in which node “A” is a dual-connected edge node, the initial number of partitions is two. If these two partitions can be merged successfully, the number of nodes that must be subsequently examined is reduced to zero. Otherwise, in the worst case, the number of nodes that must be examined is slightly less than half the number of nodes in the network, which is still a substantial improvement over conventional methods.
- As is known in the art, route computation methods such as Intermediate System-Intermediate System (IS-IS) and Open Shortest Path First (OSPF) and Multicast OSPF can produce multiple equal-cost paths between node pairs. In such cases, the above-described method for merging partitions may be used without modification where either: the “cost” of each path is proportional to the number of hops; or the “cost” of a direct link between two partitions is less than the “cost” of the two-hop path through the node of interest (node “A” in the example of
FIG. 2 ). - A tie-breaking algorithm must be used to select a “shortest” path or subset of shortest paths from among the set of equal-cost paths between a node pair. In such cases, the above-described method for merging partitions can be used, provided that the “shortest” path(s) selected by the tie-breaking algorithm are symmetric and locally consistent.
- For example, in the network of
FIG. 2 , consider a scenario in which the route computation methods yields three equal cost paths between nodes C and E, and a tie-breaking algorithm is used to select one of these equal-cost paths as the “shortest” path. In this case, the above-described methods could be used to merge partition “C” with super-partition “BDE” if the tie-breaking method selected, as the shortest path, either one of the two paths through nodes B or D, but not the path through node “A”. - As may be appreciated, this same methodology can be extended to a case where the route computation algorithm computes a set of equal-cost paths, and the tie breaking mechanism operates to select a subset of two or more of these equal cost paths as the shortest paths. In this case, the criterion for merging two partitions is that none of the selected shortest paths traverse the node under consideration. Thus, for example, the tie-breaking mechanism could potentially select any two of the paths between nodes C and E as the set of shortest paths, and the above-described methods could be used to merge partition “C” with super-partition “BDE” if this set of shortest paths did not include the path through node “A”.
- The embodiment(s) of the invention described above is(are) intended to be exemplary only. The scope of the invention is therefore intended to be limited solely by the scope of the appended claims.
Claims (25)
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US13/204,309 US8605627B2 (en) | 2008-10-28 | 2011-08-05 | Provider link state bridging (PLSB) computation method |
US14/099,717 US20140105071A1 (en) | 2008-10-28 | 2013-12-06 | Provider link state bridging (plsb) computation method |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/259,650 US8005016B2 (en) | 2008-10-28 | 2008-10-28 | Provider link state bridging (PLSB) computation method |
US13/204,309 US8605627B2 (en) | 2008-10-28 | 2011-08-05 | Provider link state bridging (PLSB) computation method |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/259,650 Continuation US8005016B2 (en) | 2008-10-28 | 2008-10-28 | Provider link state bridging (PLSB) computation method |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/099,717 Continuation US20140105071A1 (en) | 2008-10-28 | 2013-12-06 | Provider link state bridging (plsb) computation method |
Publications (2)
Publication Number | Publication Date |
---|---|
US20110292838A1 true US20110292838A1 (en) | 2011-12-01 |
US8605627B2 US8605627B2 (en) | 2013-12-10 |
Family
ID=42117410
Family Applications (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/259,650 Expired - Fee Related US8005016B2 (en) | 2008-10-28 | 2008-10-28 | Provider link state bridging (PLSB) computation method |
US13/204,309 Expired - Fee Related US8605627B2 (en) | 2008-10-28 | 2011-08-05 | Provider link state bridging (PLSB) computation method |
US14/099,717 Abandoned US20140105071A1 (en) | 2008-10-28 | 2013-12-06 | Provider link state bridging (plsb) computation method |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US12/259,650 Expired - Fee Related US8005016B2 (en) | 2008-10-28 | 2008-10-28 | Provider link state bridging (PLSB) computation method |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US14/099,717 Abandoned US20140105071A1 (en) | 2008-10-28 | 2013-12-06 | Provider link state bridging (plsb) computation method |
Country Status (9)
Country | Link |
---|---|
US (3) | US8005016B2 (en) |
EP (1) | EP2342864A4 (en) |
JP (2) | JP5385984B2 (en) |
KR (1) | KR20110079689A (en) |
CN (2) | CN102197625B (en) |
BR (1) | BRPI0919634A2 (en) |
CA (1) | CA2742775A1 (en) |
RU (1) | RU2517431C2 (en) |
WO (1) | WO2010048698A1 (en) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120039164A1 (en) * | 2008-11-17 | 2012-02-16 | Gabor Enyedi | System And Method Of Implementing Lightweight Not-Via IP Fast Reroutes In A Telecommunications Network |
US20150249568A1 (en) * | 2012-09-13 | 2015-09-03 | Nec Corporation | Control apparatus, control method, communication system, and program |
US9904721B1 (en) * | 2013-01-25 | 2018-02-27 | Gravic, Inc. | Source-side merging of distributed transactions prior to replication |
Families Citing this family (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8005016B2 (en) * | 2008-10-28 | 2011-08-23 | Nortel Networks Limited | Provider link state bridging (PLSB) computation method |
GB2469467B (en) * | 2009-04-14 | 2015-05-20 | Skype | Optimising communications |
US8619785B2 (en) * | 2009-04-28 | 2013-12-31 | Ciena Corporation | Pre-computing alternate forwarding state in a routed ethernet mesh network |
US8627137B1 (en) | 2010-09-16 | 2014-01-07 | Cisco Technology, Inc. | Graceful handling of critical traffic blackholing faults |
US9413637B2 (en) * | 2012-10-22 | 2016-08-09 | Avaya Inc. | Architecture for virtualization and distribution of routing information used in a transport network |
US9306856B2 (en) * | 2013-03-15 | 2016-04-05 | Cisco Technology, Inc. | Optimal tree root selection for trees spanning multiple sites |
CN107682415A (en) * | 2017-09-20 | 2018-02-09 | 郑州云海信息技术有限公司 | A kind of method and system of peer-to-peer network transmission neighbor node selection |
US11671329B2 (en) | 2018-04-04 | 2023-06-06 | Arista Networks, Inc. | Computation of network flooding topologies |
US11218399B2 (en) | 2018-06-20 | 2022-01-04 | Arista Networks, Inc. | Embedded area abstraction |
US11296948B2 (en) * | 2020-01-09 | 2022-04-05 | Arista Networks, Inc. | Topology partition detection |
CN112787688A (en) * | 2020-12-31 | 2021-05-11 | 广东电网有限责任公司电力调度控制中心 | Multicast tree node communication method and device |
Citations (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6262976B1 (en) * | 1998-09-17 | 2001-07-17 | Ordered Networks, Inc. | System and method for network flow optimization using traffic classes |
US20020131363A1 (en) * | 1998-05-01 | 2002-09-19 | Maged E. Beshai | Multi-class network |
US20030086425A1 (en) * | 2001-10-15 | 2003-05-08 | Bearden Mark J. | Network traffic generation and monitoring systems and methods for their use in testing frameworks for determining suitability of a network for target applications |
US6603769B1 (en) * | 1998-05-28 | 2003-08-05 | Cisco Technology, Inc. | Method and system for improving traffic operation in an internet environment |
US20040218622A1 (en) * | 2003-04-30 | 2004-11-04 | Krishnan Kumaran | Method of scheduling bursts of data for transmission in a communication network |
US20080107027A1 (en) * | 2006-11-02 | 2008-05-08 | Nortel Networks Limited | Engineered paths in a link state protocol controlled Ethernet network |
US20080159290A1 (en) * | 2006-12-28 | 2008-07-03 | Futurewei Technologies, Inc. | Method of Preventing Transport Leaks in Hybrid Switching Networks |
US7457646B2 (en) * | 1991-05-13 | 2008-11-25 | Broadcom Corporation | Radio frequency local area network |
US20080316917A1 (en) * | 2005-10-11 | 2008-12-25 | Janos Farkas | Method of Generating Spanning Trees |
US7917145B2 (en) * | 1992-11-02 | 2011-03-29 | Broadcom Corporation | Radio frequency local area network |
US8005016B2 (en) * | 2008-10-28 | 2011-08-23 | Nortel Networks Limited | Provider link state bridging (PLSB) computation method |
Family Cites Families (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4912656A (en) * | 1988-09-26 | 1990-03-27 | Harris Corporation | Adaptive link assignment for a dynamic communication network |
US6330605B1 (en) * | 1998-11-19 | 2001-12-11 | Volera, Inc. | Proxy cache cluster |
US20030026268A1 (en) * | 2000-11-28 | 2003-02-06 | Siemens Technology-To-Business Center, Llc | Characteristic routing |
US6738960B2 (en) * | 2001-01-19 | 2004-05-18 | Cadence Design Systems, Inc. | Method and apparatus for producing sub-optimal routes for a net by generating fake configurations |
US8031630B2 (en) | 2003-03-03 | 2011-10-04 | Alcatel Lucent | Method and apparatus for updating provider domain due to customer TCNs |
EP1571789A1 (en) * | 2004-03-05 | 2005-09-07 | Siemens Aktiengesellschaft | Probabilistic link selection in routing algorithm |
US20050220096A1 (en) | 2004-04-06 | 2005-10-06 | Robert Friskney | Traffic engineering in frame-based carrier networks |
US20070036178A1 (en) * | 2005-02-02 | 2007-02-15 | Susan Hares | Layer 2 virtual switching environment |
KR100850912B1 (en) * | 2005-06-15 | 2008-08-07 | 삼성전자주식회사 | Apparatus and method for power-saving in wireless communication system |
KR101406922B1 (en) * | 2005-10-05 | 2014-06-20 | 노오텔 네트웍스 리미티드 | Provider Link State Bridging |
US8059647B2 (en) * | 2005-10-05 | 2011-11-15 | Nortel Networks Limited | Multicast implementation in a link state protocol controlled ethernet network |
US8223668B2 (en) * | 2006-12-14 | 2012-07-17 | Rockstar Bidco Lp | Method and apparatus for exchanging routing information and the establishment of connectivity across multiple network areas |
US7792050B2 (en) * | 2007-10-26 | 2010-09-07 | Motorola, Inc. | Method for intelligent merging of ad hoc network partitions |
-
2008
- 2008-10-28 US US12/259,650 patent/US8005016B2/en not_active Expired - Fee Related
-
2009
- 2009-10-26 EP EP09822924A patent/EP2342864A4/en not_active Withdrawn
- 2009-10-26 CA CA2742775A patent/CA2742775A1/en not_active Abandoned
- 2009-10-26 BR BRPI0919634A patent/BRPI0919634A2/en not_active IP Right Cessation
- 2009-10-26 CN CN200980142982.5A patent/CN102197625B/en not_active Expired - Fee Related
- 2009-10-26 JP JP2011533493A patent/JP5385984B2/en not_active Expired - Fee Related
- 2009-10-26 WO PCT/CA2009/001506 patent/WO2010048698A1/en active Application Filing
- 2009-10-26 RU RU2011121621/08A patent/RU2517431C2/en not_active IP Right Cessation
- 2009-10-26 KR KR1020117009634A patent/KR20110079689A/en not_active Application Discontinuation
- 2009-10-26 CN CN201410057341.2A patent/CN103795628A/en active Pending
-
2011
- 2011-08-05 US US13/204,309 patent/US8605627B2/en not_active Expired - Fee Related
-
2013
- 2013-10-04 JP JP2013209161A patent/JP2014039314A/en active Pending
- 2013-12-06 US US14/099,717 patent/US20140105071A1/en not_active Abandoned
Patent Citations (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7457646B2 (en) * | 1991-05-13 | 2008-11-25 | Broadcom Corporation | Radio frequency local area network |
US7917145B2 (en) * | 1992-11-02 | 2011-03-29 | Broadcom Corporation | Radio frequency local area network |
US20020131363A1 (en) * | 1998-05-01 | 2002-09-19 | Maged E. Beshai | Multi-class network |
US6603769B1 (en) * | 1998-05-28 | 2003-08-05 | Cisco Technology, Inc. | Method and system for improving traffic operation in an internet environment |
US6262976B1 (en) * | 1998-09-17 | 2001-07-17 | Ordered Networks, Inc. | System and method for network flow optimization using traffic classes |
US20030086425A1 (en) * | 2001-10-15 | 2003-05-08 | Bearden Mark J. | Network traffic generation and monitoring systems and methods for their use in testing frameworks for determining suitability of a network for target applications |
US20040218622A1 (en) * | 2003-04-30 | 2004-11-04 | Krishnan Kumaran | Method of scheduling bursts of data for transmission in a communication network |
US20080316917A1 (en) * | 2005-10-11 | 2008-12-25 | Janos Farkas | Method of Generating Spanning Trees |
US20110026438A1 (en) * | 2005-10-11 | 2011-02-03 | Farkas Janos | Method of generating spanning trees |
US20080107027A1 (en) * | 2006-11-02 | 2008-05-08 | Nortel Networks Limited | Engineered paths in a link state protocol controlled Ethernet network |
US20080159290A1 (en) * | 2006-12-28 | 2008-07-03 | Futurewei Technologies, Inc. | Method of Preventing Transport Leaks in Hybrid Switching Networks |
US8005016B2 (en) * | 2008-10-28 | 2011-08-23 | Nortel Networks Limited | Provider link state bridging (PLSB) computation method |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20120039164A1 (en) * | 2008-11-17 | 2012-02-16 | Gabor Enyedi | System And Method Of Implementing Lightweight Not-Via IP Fast Reroutes In A Telecommunications Network |
US8780696B2 (en) * | 2008-11-17 | 2014-07-15 | Telefonaktiebolaget L M Ericsson (Publ) | System and method of implementing lightweight not-via IP fast reroutes in a telecommunications network |
US20150249568A1 (en) * | 2012-09-13 | 2015-09-03 | Nec Corporation | Control apparatus, control method, communication system, and program |
US9813288B2 (en) * | 2012-09-13 | 2017-11-07 | Nec Corporation | Control apparatus, control method, communication system, and program for issuing database operation command to operate database |
US9904721B1 (en) * | 2013-01-25 | 2018-02-27 | Gravic, Inc. | Source-side merging of distributed transactions prior to replication |
Also Published As
Publication number | Publication date |
---|---|
JP2012507214A (en) | 2012-03-22 |
RU2011121621A (en) | 2012-12-10 |
EP2342864A1 (en) | 2011-07-13 |
CN102197625A (en) | 2011-09-21 |
JP2014039314A (en) | 2014-02-27 |
CA2742775A1 (en) | 2010-05-06 |
BRPI0919634A2 (en) | 2015-12-01 |
US20140105071A1 (en) | 2014-04-17 |
CN103795628A (en) | 2014-05-14 |
US8605627B2 (en) | 2013-12-10 |
WO2010048698A1 (en) | 2010-05-06 |
CN102197625B (en) | 2014-04-02 |
US8005016B2 (en) | 2011-08-23 |
US20100103846A1 (en) | 2010-04-29 |
EP2342864A4 (en) | 2012-03-07 |
JP5385984B2 (en) | 2014-01-08 |
RU2517431C2 (en) | 2014-05-27 |
KR20110079689A (en) | 2011-07-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8605627B2 (en) | Provider link state bridging (PLSB) computation method | |
EP3200402B1 (en) | Segment routing information obtainment method and segment routing network establishment method | |
CN105049350B (en) | Utilize the method, apparatus and system of the Segment routing of the reciprocity engineering in outlet | |
US8325706B2 (en) | Hierarchical segmented label switched paths | |
US8199755B2 (en) | Method and apparatus establishing forwarding state using path state advertisements | |
EP1859561B1 (en) | Algorithm for backup pe selection | |
US8848705B2 (en) | System and method for finding point-to-multipoint label switched path crossing multiple domains | |
EP2866377B1 (en) | Method, device, and system for establishing bi-directional multicast distribution tree based on interior gateway protocol | |
US9270426B1 (en) | Constrained maximally redundant trees for point-to-multipoint LSPs | |
US20110134802A1 (en) | Determining A Routing Tree For Networks With Different Routing Protocols | |
Filsfils et al. | Segment routing use cases | |
US20110022728A1 (en) | Link state routing protocols for database synchronization in gmpls networks | |
US9712426B2 (en) | Multi-domain routing computation method and device, path computation element and routing network | |
US20130064074A1 (en) | Break before make forwarding information base (fib) population for multicast | |
CN112118181B (en) | Traffic scheduling method and device | |
WO2015192496A1 (en) | Method and device for processing mpls load sharing | |
CN116455811A (en) | Filtering topology for path computation in large-scale networks | |
CN114050993B (en) | Access side-based active selection method and device for safe trusted paths | |
CN109729006B (en) | Message processing method and device and computer readable storage medium | |
Bing et al. | Traffic optimization on the dynamic switching of ABR for OSPF networks |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: ROCKSTAR CONSORTIUM US LP, TEXAS Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ROCKSTAR BIDCO, LP;REEL/FRAME:030662/0785 Effective date: 20120509 |
|
AS | Assignment |
Owner name: RPX CLEARINGHOUSE LLC, CALIFORNIA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:ROCKSTAR CONSORTIUM US LP;ROCKSTAR CONSORTIUM LLC;BOCKSTAR TECHNOLOGIES LLC;AND OTHERS;REEL/FRAME:034924/0779 Effective date: 20150128 |
|
AS | Assignment |
Owner name: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT, IL Free format text: SECURITY AGREEMENT;ASSIGNORS:RPX CORPORATION;RPX CLEARINGHOUSE LLC;REEL/FRAME:038041/0001 Effective date: 20160226 |
|
REMI | Maintenance fee reminder mailed | ||
AS | Assignment |
Owner name: RPX CLEARINGHOUSE LLC, CALIFORNIA Free format text: RELEASE (REEL 038041 / FRAME 0001);ASSIGNOR:JPMORGAN CHASE BANK, N.A.;REEL/FRAME:044970/0030 Effective date: 20171222 Owner name: RPX CORPORATION, CALIFORNIA Free format text: RELEASE (REEL 038041 / FRAME 0001);ASSIGNOR:JPMORGAN CHASE BANK, N.A.;REEL/FRAME:044970/0030 Effective date: 20171222 |
|
LAPS | Lapse for failure to pay maintenance fees |
Free format text: PATENT EXPIRED FOR FAILURE TO PAY MAINTENANCE FEES (ORIGINAL EVENT CODE: EXP.) |
|
STCH | Information on status: patent discontinuation |
Free format text: PATENT EXPIRED DUE TO NONPAYMENT OF MAINTENANCE FEES UNDER 37 CFR 1.362 |
|
FP | Lapsed due to failure to pay maintenance fee |
Effective date: 20171210 |