WO2012032426A1 - Automated traffic engineering for multi-protocol label switching (mpls) with link utilization as feedback into the tie-breaking mechanism - Google Patents
Automated traffic engineering for multi-protocol label switching (mpls) with link utilization as feedback into the tie-breaking mechanism Download PDFInfo
- Publication number
- WO2012032426A1 WO2012032426A1 PCT/IB2011/053493 IB2011053493W WO2012032426A1 WO 2012032426 A1 WO2012032426 A1 WO 2012032426A1 IB 2011053493 W IB2011053493 W IB 2011053493W WO 2012032426 A1 WO2012032426 A1 WO 2012032426A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- path
- network
- mpls
- shortest
- paths
- Prior art date
Links
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/24—Multipath
-
- 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]
-
- 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/125—Shortest path evaluation based on throughput or bandwidth
Definitions
- the embodiments of the invention relate to a method and apparatus for improving load distribution in a network. Specifically, the embodiments of the invention relate to a method for load spreading in Multi-Protocol Label Switching (MPLS) networks with multiple equal cost paths between nodes in the network.
- MPLS Multi-Protocol Label Switching
- Load distribution or load spreading is a method by which bandwidth is more effectively utilized and overall performance is improved in a network.
- Most automated load distribution and load spreading techniques deployed today operate with only a very local view, these load distribution and load spreading techniques only consider the number of paths or the next hops to a given destination and do not consider the overall distribution of traffic in the network.
- Equal cost multi-path is a common strategy for load spreading of unicast traffic in routed networks that is utilized where the decision as to how to forward a packet to a given destination can resolve to any of multiple "equal cost" paths, which tied for being the shortest path when running database calculations.
- ECMP can be used in conjunction with most unicast routing protocols and nodes equipped with the required supporting data plane hardware, since it relies on a per hop decision that is local to a single router and assumes promiscuous receipt and a complete forwarding table at every intermediate node.
- the load is divided pseudo-evenly across the set of equal cost next hops. This process is implemented independently at each hop of the network where more than one path to a given destination exists.
- each packet is inspected for a source of entropy such as an Internet Protocol (IP) header and a hash of header information modulo of the number of paths is used to select the next hop for the particular packet.
- IP Internet Protocol
- this method will on average distribute the load evenly in regular topologies (i.e., symmetric topologies) and does offer some improvement in less regular topologies.
- MPLS Multiprotocol label switching
- MPLS uses per hop labels that are assigned to a stream of traffic to forward the traffic across the network using label lookup and translation (referred to as "swapping").
- Each node of the network supports MPLS by reviewing incoming traffic received over the network and forwarding that traffic based on its label, the label is typically translated or "swapped" at each hop.
- MPLS networks can improve the distribution of routed traffic in the network using per hop ECMP to distribute or spread a load across equal cost paths.
- a label switch path LSP
- the forwarding path for a given destination in the network is calculated using a shortest path first (SPF) algorithm at each node in the network, mapped to the local label bindings in the node, and the resultant connectivity appears as a multi-point to multi-point mesh.
- SPF shortest path first
- Individual nodes when presented with traffic destined for multiple equal costs paths utilize payload information as part of the path selection mechanism in order to maximize the evenness of flow distribution across the set of paths.
- the establishment of the multi-point to multi-point LSP is automated.
- LDP label distribution protocol
- LS label switch router
- a method implemented in a node of a multi-protocol label switching (MPLS) network for improved load distribution wherein the node is one of a plurality of nodes in the MPLS network each of which implement a common algorithm tie-breaking process to produce minimum cost shortest path trees, the node includes a topology database to store a topology of the MPLS network, wherein the topology of the MPLS network includes a plurality of nodes and links between the nodes
- the method comprising the steps of: determining a first set of one or more shortest paths between each MPLS node pair in the MPLS network by executing a shortest path search algorithm on the topology of the MPLS network stored in the topology database; selecting at least a first shortest path from the first set of shortest paths for each MPLS node pair, by applying the common algorithm tie-breaking process; calculating a link utilization value for each link of the MPLS network based on the count of shortest paths selected that transit each link; determining a second set of one or more shortest paths between each
- a network element for improved load distribution in a multi-protocol label switching (MPLS) network that includes the network element, wherein the network element is one of a plurality of nodes in the MPLS network, wherein a topology of the MPLS network includes a plurality of nodes and links between the nodes, the network element comprising: a topology database to store link information for each link in the MPLS network; a label information database to store label information for each port of the network element, wherein the label information database indicates where to forward each forwarding equivalency class (FEC) incoming to the network element; a control processor coupled to the topology database and the label information database, the network processor configured to process data traffic, wherein the network processor comprises: an MPLS management module configured to forward data traffic over label switch paths (LSPs); a label distribution protocol (LDP) module configured to establish LSPs in the MPLS network; a shortest path search module configured to determine at least one shortest path between each MPLS node pair in the MPLS network by executing a shortest
- Figure 1 is a diagram of an example of a network topology.
- FIG 2 is a diagram of one embodiment of a network element implementing automatic traffic engineering for a multi-protocol label switching network (MPLS).
- MPLS multi-protocol label switching network
- FIG. 3 is a flowchart of one embodiment of a load distribution process including automated traffic engineering that incorporates the use of link utilization as feedback into a tie-breaking mechanism.
- Figure 4 is a flowchart of one embodiment of a process for generating a label mapping message as part of the label distribution protocol.
- Figure 5 is a diagram of an example of a multi-point to multi-point network topology.
- Figure 6 is a diagram of another example of a multi-point to multi-point network topology.
- Figure 7 is a diagram of one embodiment of a mapping of a set of pseudo wires to the underlying packet switch network to support operations, administration and maintenance (OAM) in the MPLS network.
- OAM operations, administration and maintenance
- the embodiments include a basic tie-breaking process with specific properties including the properties that the process will always resolve to a single path, is independent of the order or direction of computation, and has a locality property such that a tie for any portion of the considered path can be resolved without having to consider the entire path.
- the techniques shown in the figures can be implemented using code and data stored and executed on one or more electronic devices (e.g., an end station, a network element, etc.). Such electronic devices store and communicate (internally and/or with other electronic devices over a network) code and data using non-transitory machine- readable or computer-readable media, such as non-transitory machine-readable or computer-readable storage media (e.g., magnetic disks; optical disks; random access memory; read only memory; flash memory devices; and phase-change memory).
- non-transitory machine-readable or computer-readable media e.g., magnetic disks; optical disks; random access memory; read only memory; flash memory devices; and phase-change memory.
- such electronic devices typically include a set of one or more processors coupled to one or more other components, such as one or more storage devices, user input/output devices (e.g., a keyboard, a touch screen, and/or a display), and network connections.
- the coupling of the set of processors and other components is typically through one or more busses and bridges (also termed as bus controllers).
- the storage devices represent one or more non-transitory machine-readable or computer-readable storage media and non-transitory machine-readable or computer-readable communication media.
- the storage device of a given electronic device typically stores code and/or data for execution on the set of one or more processors of that electronic device.
- one or more parts of an embodiment of the invention may be implemented using different combinations of software, firmware, and/or hardware.
- a network element e.g., a router, switch, bridge, etc.
- a network element is a piece of networking equipment, including hardware and software, that communicatively interconnects other equipment on the network (e.g., other network elements, end stations, etc.).
- Some network elements are "multiple services network elements" that provide support for multiple networking functions (e.g., routing, bridging, switching, Layer 2 aggregation, session border control, multicasting, and/or subscriber management), and/or provide support for multiple application services (e.g., data, voice, and video).
- Subscriber end stations e.g., servers, workstations, laptops, palm tops, mobile phones, smart phones, multimedia phones, Voice Over Internet Protocol (VOIP) phones, portable media players, GPS units, gaming systems, set-top boxes (STBs), etc. access content/services provided over the Internet and/or content/services provided on virtual private networks (VPNs) overlaid on the Internet.
- VOIP Voice Over Internet Protocol
- STBs set-top boxes
- the content and/or services are typically provided by one or more end stations (e.g., server end stations) belonging to a service or content provider or end stations participating in a peer to peer service, and may include public web pages (free content, store fronts, search services, etc.), private web pages (e.g., username/password accessed web pages providing email services, etc.), corporate networks over VPNs, IPTV, etc.
- end stations e.g., server end stations
- subscriber end stations are coupled (e.g., through customer premise equipment coupled to an access network (wired or wirelessly) to edge network elements, which are coupled (e.g., through one or more core network elements to other edge network elements) to other end stations (e.g., server end stations).
- the embodiments of the present invention provide a system, network and method for avoiding the disadvantages of the prior art including: poor performance in asymmetrical topologies, lack of support for operations, administration and management (OAM) protocols, high resource requirements for per packet inspection, high levels of dilation to achieve reasonable network utilization, multiple metric set generation and maintenance, and significant resources required to make small changes in state.
- OAM operations, administration and management
- the embodiments of the invention overcome these disadvantages by enabling dynamic traffic engineering while minimizing a number of traversals of the topology database for a network.
- the load distribution method incorporates dynamic traffic engineering and utilizes the instantiation of multiple sets of equal cost paths in the forwarding plane, which can be aggregated into sets of equal cost trees, whereby the cumulative number of shortest paths transiting each link in a path resulting from all previous iterations of the path generation process factor into tie-breaking for the generation of the next set of paths.
- the set of shortest paths between any two node pairs is pruned by ranking the lexicographically sorted list of link utilization values for each link in each path being considered. If the ranked list has a unique lowest utilized path, then that path is selected. If the ranked list does not have a unique lowest utilized path, then the basic tie-breaking process is applied to the subset of shortest paths that tied for the lowest link utilization.
- a model of the network load is computed in each iteration of path generation taking into account the tie-breaking of previous iterations in order to even out the loading of links in the network.
- the improved algorithm inherently favors the selection of less loaded links in each iteration after the first iteration.
- the load distribution process utilizes a tie-breaking process with distinct properties such that for a path between any two points it will resolve to a single symmetric path regardless of the direction of computing, order of computing or examination of any subset of the path, a property described as "any portion of the shortest path is also the shortest path.” Or stated another way, where a tie occurs along any portion of the shortest path, those nodes will resolve the tie for the subset of the path with the same choice, the result being a minimum cost shortest path tree. This is referred to herein as the "common algorithm tie-breaking" process.
- an initial pass of the topology database utilizing the common algorithm tie-breaking process results in the generation of the first set of trees. This is because no load on any link has been recorded, hence all equal cost paths will be tied for utilization where the definition of equal cost is lowest metric and lowest number of hops.
- the initial step requires the determination of the shortest path between each of the MPLS node pairs in the network and where more than one shortest path between any two MPLS nodes is found the common algorithm tie-breaking process is utilized for tie-breaking in order to generate a unique path selection between each of the MPLS node pairs in the network and to generate one or more sets of equal cost forwarding trees, termed an "ECT set.”
- the load distribution process can rank the equal cost paths and determine low and high ranked paths, or 'bookend' paths, where both paths exhibit a set of requisite properties. This load distribution process can thereby select more than one path from a single "all pairs" pass of the database.
- the load distribution process also computes the number of shortest paths that traverse each link on the basis of paths actually selected by previous tie breaking procedures. This value is referred to as the "link utilization" value, which can be used to in subsequent computation.
- the link utilization values can be the count of MPLS node pairs whose shortest path transits the link. In other embodiments, more sophisticated possibilities exist to be used in place of link utilization considering additional information in the topology database.
- the set of shortest paths between any two MPLS nodes is first ranked by generating path utilization values that can include the lexicographically sorted link utilization values for each of the paths or simply the sum of the utilization of each link in the path and then ranking the resulting paths based on the path utilization values.
- path utilization values can include the lexicographically sorted link utilization values for each of the paths or simply the sum of the utilization of each link in the path and then ranking the resulting paths based on the path utilization values.
- Two or more ranking schemes can be also utilized, because when selecting more than one path when generating a set of equal cost paths or trees it is advantageous to minimize the number of times the same path is selected. Using multiple link rankings that demonstrate diversity can minimize the number of iterations needed to select multiple paths. When the ranking process generates a single lowest utilized path, it can be selected without further processing.
- the lowest utilized path is selected as both the lowest and highest ranking path.
- the common algorithm tie-breaking process is applied to the set of lowest utilized paths to make the selection.
- more than one ranking may be selected from this step.
- more than one load ranking mechanism e.g. sum and lexicographic sort of loads as ranking
- the link utilization value assigned to each link in a path is the cumulative measure or indication of shortest paths that transit the link selected during all the previous passes through the topology database.
- Figure 1 is a diagram of one embodiment of an example network topology.
- the example network topology includes six nodes with corresponding node identifiers 1-6. No path pairs have been determined for the network topology.
- An exemplary common algorithm tie-breaking process is utilized that ranks the paths lexicographically using the node identifiers. Examining the set of paths of equal cost between node 1 and node 4 will generate the following ranked set of path identifiers (note the path identifiers have been lexicographically sorted such that the node identifiers do not appear as a transit list):
- This initial application of the tie-breaking process will select 1-2-3-4 and 1-4-5- 6 as the low and high ranked paths between these nodes. For simplicity in this example, only node pair 1 and 4 are considered in determining the path count for the network rather than the shortest path trees from all six nodes. In this example, the links in the selected links paths are each then assigned a path pair count of 1. For the next pass through the topology database the load distribution process would yield the following lexicographic sort of link loading associated with each of the path IDs. Load 0,1,1 for path 1-2-4-6
- the secondary tiebreaker of the lexicographically sorted path IDs is employed.
- the low path (1-2-4-6) is selected.
- 1-3-4-5 can be selected as the high ranking path ID of the set of lowest loaded paths.
- two paths are selected. These paths can be the same or have significant overlap. For example, if the path 1-3-4-5 did not exist in the ranked list above, then the path 1-2-4-6 would qualify as both the low and high ranked paths of lowest cost.
- an initial input to the low path selection can be from on the ranking based on the lexicographic sort of loads and the primary input to the high path selection can be from the ranking based on the sum of loads.
- the number of paths selected per iteration of the process and the cumulative number of paths a network is configured to utilize can be a function of an a priori forwarding state versus a required computational power analysis. Selecting both the lowest and highest ranked paths of lowest cost will minimize the amount of computing power required for a given improvement in standard deviation of link utilization, but will require more forwarding state as a consequence, because two sets of equal cost trees are generated per iteration. Selecting a single path permutation from each iteration will require more computing power, but will reduce the amount of forwarding database state required for a given reduction in standard deviation of utilization, because the number of times that two paths must be selected from a single lowest utilization candidate is minimized.
- the overall number of paths generated is determined based on a combination of both network element state and computational power considerations balanced against network efficiency.
- the utilization of multiple schemes for ranking path load permits more paths to be selected from a given pass of the database as it reduces the probability of the same path being selected more than once for a given number of path selections.
- two methods of ranking path load were described that would produce consistent results applied across a network.
- additional or substitute methods of ranking could be utilized.
- other mechanisms of ranking load that also have a locality property (any portion of the lowest loaded path is also the lowest loaded path when combined with the common algorithm tie-breaking process) and combinations of such rankings can be utilized.
- link utilization is represented by the count of shortest paths that transited a link. It is possible to utilize numerous variations for representing link utilization of with greater detail and increased accuracy.
- label information and topology database there is sufficient information such that each node in the network can determine the number of service instances that use a particular shortest path. A link utilization value can be determined based on this utilization to weight the corresponding link appropriately.
- additional bandwidth profiling information per service is available for use in load distribution calculations.
- only the minimum link metrics of the set of links in a path is utilized as representative of the maximum load that could be offered between that pair of nodes. In other embodiments, similar metrics or more detailed metrics can be utilized.
- all but the final pass of the topology database involves an
- any perturbation of the traffic matrix caused by a failure tends to be isolated and local in nature.
- the load distribution process will tend to steer data traffic back into the original distribution once a constriction in the network has been bypassed.
- the method also works with the emerging MPLS-TP technology base, such that operation, administration and management (OAM) protocols can be utilized unmodified and preserves the architecture and service guarantees of the MPLS network.
- OAM operation, administration and management
- the load balancing process and system also enables an administrator to "pre- bias" a link with a load factor which will have the effect of shifting some load away from the particular link.
- This permits subtler gradations for manipulating routing behavior than simple metric modification, much simpler administration than multi- topology routing, and obviates the need for link virtualization (such as MPLS "forwarding adjacencies" as per RFC 4206) to artificially drive up the mesh density, which is done in prior load balancing systems.
- link virtualization such as MPLS "forwarding adjacencies" as per RFC 4206
- FIG. 2 is a diagram of one embodiment of a network element implementing the load distribution method incorporating link utilization as feedback into the tie- breaking mechanism.
- the network element 200 can include a label information database 215, a topology database 217, an ingress module 203, an egress module 205 and a control processor 207.
- the ingress module 203 can handle the processing of data packets being received by the network element 200 at the physical link and data link level.
- the egress module 205 handles the processing of data packets being transmitted by the network element 200 at the physical link and data link level.
- the control processor 207 handles the routing, forwarding and higher level processing of the data traffic.
- the control processor 207 can execute or include a shortest path search module 209, load distribution module 215, label distribution protocol (LDP) module 213, MPLS management module 217 and sorting module 211.
- LDP label distribution protocol
- the label information database 215 includes a table with label forwarding entries that define the manner in which data packets are to be forwarded. Label forwarding entries relate labels and underlying FECs and virtual topologies to network interfaces of the network element 200. This information can be utilized by the control processor 207 to determine how a data packet is to be handled, i.e., which network interface the data packet should be forward unto.
- the load distribution method and system creates label forwarding entries through the label distribution protocol (LDP) that implement the load distribution as described herein below.
- LDP label distribution protocol
- the topology database 217 stores a network model or similar representation of the topology of the network with which the network element 200 is connected.
- the nodes in the network are each label switch routers (LS ) and the links between the LSRs can utilize a number of underlying protocols and technologies.
- the nodes can be identified with unique node identifiers such as nodal loopback addresses and the links with node-identifier pairs.
- this network model representation is provided by way of example and that other representations of the network topology can be utilized with the load distribution method and system.
- a shortest path search module 209 is a component of the control processor 207 or a module executed by the control processor 207.
- the shortest path search module 209 traverses the topology database to determine the shortest path between any two nodes in the network topology. If there are multiple paths having an equal distance or cost in the network between two nodes and these multiple paths are all the shortest paths then these multiple equal cost paths can be provided to the sorting module 211 and load distribution module 215 to determine which to utilize.
- the shortest path search module 209 can determine the shortest paths between all nodes in the network topology, referred to herein as an "all pairs" computation.
- the shortest path search module 209 provides a set of shortest paths for each node pair and the load distribution module 215 selects a subset of the shortest paths and updates the label information database to include a entry that implements the subset of each of the shortest paths that traverse the network element 200.
- the shortest path search module 209 calculates the link utilization value for each link in the network topology resulting from the first pass through the topology database.
- the link utilization value is a count of the number of selected shortest paths that traverse a given link.
- a separate link utilization value is calculated and recorded for each link.
- These link utilization values are utilized to generate a path utilization value that in turn is used to bias the rankings of the paths for subsequent passes through the topology database where the initial tiebreaker is either the ranked list of lexicographically sorted link utilization values or the sum of link utilization values (i.e, in the form of the path utilization value), and where this results in a tie, the common algorithm tie-breaking process is used as a subsequent tie breaker.
- the sorting module 211 is a component of the control processor 207 or a module executed by the control processor 207.
- the sorting module 211 assists the load distribution module 215 by performing an initial ranking of the loaded set of equal cost trees based on the path utilization values in the second pass and in subsequent passes.
- the sorting module 211 For each node pair with multiple equal cost paths, the sorting module 211 generates a ranking of each of these equal cost paths based on path utilization values and the load distribution module 215 selects at least one path from this ranking. In other embodiments, highest ranked and lowest ranked paths can be selected to divide the load between the corresponding node pairs.
- the load distribution module 215 is a component of the control processor 207 or a module executed by the control processor 207.
- This process can be repeated through any number of passes or iterations where the link utilization values are updated to be a cumulative indication of the set of shortest paths that transits it.
- the path utilization values are also updated in line with the changes to the link utilization values.
- the standard deviation in the variance in the paths typically diminishes with each iteration, but as the number of path sets goes up, the overall impact of each additional set is proportionately diminished, indicating that the use of more than two or three passes or iterations is not worth either the computational effort to produce or the forwarding state to instantiate.
- the number of passes or iterations is designated by an administrator and is configured network wide.
- the MPLS management module 217 is a component of the control processor
- the MPLS management module 217 inspects incoming packets and determines the associated labels and performs look-ups for the packets in the label information database 219 to determine a network interface to forward the packet through.
- the MPLS management module 217 also performs any necessary label swapping, label addition or label removal to affect the proper traversal of the LSP for each data packet.
- the LDP module 213 is a component of the control processor 207 or a module executed by the control processor 207.
- the LDP module 213 generates the messages needed to establish the forwarding equivalence class (FEC) and virtual topology to label bindings in the network used to create those LSPs utilized to distribute the load of the network.
- the LDP module 213 generates label mapping messages that include FEC type-length-value (TLV) fields, label TLV fields, as well as a virtual topology TLV field.
- the topology TLV field includes a topology index indicating which iteration of the load distribution process that the label and FEC is associated with.
- the LDP module 213 also performs the other traditional functions to implement label distribution.
- Figure 3 is a flowchart of one embodiment of a process for load distribution supporting automated traffic engineering for multi-protocol label switching based upon the use of link utilization as feedback into the tie-breaking mechanism for equal cost paths.
- the process can be run at the initiation of a network element such as an link switch router, upon notification of a change in topology to the network connected to that router, at defined intervals or at similar events or times.
- a topology database is maintained at each network element in a network as a separate process from the load distribution process and is assumed to be a current representation of the true topology of the network.
- the load distribution process begins by determining a set of shortest path between a network element or MPLS node (e.g. an LS ) in the network and another network element or MPLS node in the network (Block 301).
- the set of shortest paths can be conceived as individual paths or as a set of trees with each network element as a root of its respective tree.
- a check is made to determine whether there are multiple shortest paths, that is, there is a tie for shortest path between the MPLS nodes (Block 303). If the MPLS node pair has a single shortest path between them, the label information database is updated to reflect the shortest path (Block 306). In one embodiment, the label information database is updated to reflect each of the paths that traverse the network element that maintains it. Each network element in the network performs this same calculation.
- the load distribution process is deterministic and thus each network element will produce the same result. Further processing of those MPLS node pairs with a single shortest path is unnecessary unless there is a change in topology.
- the common algorithm tie-breaking process is used to permit a unique shortest path or set of shortest paths to be selected (Block 305). In one embodiment, it is possible to select the first and last ranked paths. After the paths are selected they are stored in the label information database or utilized to update the label information database, such that all the MPLS node pairs have at least one path between them selected.
- the link utilization value for each link is calculated either as a consequence of or after the update of the forwarding database for all MPLS node pairs has completed (Block 310).
- the link utilization value is a count of the number of the paths that traverse each corresponding link in a topology of the network.
- a link utilization value is calculated for each link in the network.
- the link utilization value provides an indication of the level of usage and potential bottlenecks in the network that should be avoided if additional paths are to be formed.
- tie-breaking is initially performed by generating path utilization values either as the lexicographically sorted list where the path utilization values include the link utilization values or the sum of the link utilization values.
- the all nodes process begins again by selecting an MPLS node pair and determining a set of shortest paths between the MPLS node pair (Block 311). This process includes path utilization values based on the link utilization values that correspond to each path (Block 313).
- the path utilization values can represent the overall load of each path, such as a sum of the link utilization values or can be a lexicographically sorted arrangement of the link utilization values highlighting the most or least loaded links in each path or similar arrangements and representations.
- the shortest paths are ranked by their path utilization value (Block 315). A check is made to determine whether there is more than one shortest path for a given MPLS node pair having equal path utilization values (Block 317).
- a uniquely lowest loaded path exists it can be selected without further processing for all path rankings (e..g lowest and highest).
- the common algorithm tie-breaking process is then used to perform path selection in this subset of lowest loaded set of shortest paths (Block 321).
- the ranking takes into account the link utilization value such that those paths with the lowest or the least used links, are the most likely to be selected, which takes into account the overall load of the network and not just a next hop in the network as a result, the routing throughout the network is more balanced.
- the label information database is then updated to reflect the selected paths (Block 318).
- Figure 4 is a flowchart of one embodiment of a process for generating a label mapping message as part of the label distribution protocol.
- the process is initiated in response to a change in topology or a change to a label information database for the network.
- the process is periodically initiated to maintain the state of the MPLS network. The process is initiated by each node generating a label mapping message to be sent to one of its peers (Block 401).
- the label mapping message includes a number of type-length-value (TLV) fields.
- TLV type-length-value
- a separate label mapping message is generated for each forwarding equivalency class (FEC) and each topology path or tree in the topology of the network as represented in the label information base of the host node.
- FEC forwarding equivalency class
- the corresponding field equivalency class is defined in an FEC TLV field of the label mapping message (Block 403).
- the label TLV field of each of the label mapping messages is also defined according to the label assigned to an LSP for each of the interfaces in the path (Block 405).
- a topology index is also defined in the label mapping message (Block 407).
- the topology index indicates the iteration of the selection process of the LSP defined by the label mapping message. For example, if the label mapping message corresponds to the first selected tree or path, then the topology index of zero or one may be selected and inserted into the label mapping message. Similarly, if a second path or tree corresponds to the message then a one or two may be specified as the value.
- the label mapping message can be sent to each of the label distribution protocol peers (Block 409).
- the topology index is included in an existing TLV of a label mapping message.
- a topology TLV is defined for the label mapping message.
- FIG. 5 is a diagram of one embodiment of a multi-point to multi-point network including a set of label switch routers (LSRs) 1-18.
- the diagram shows a set of paths or trees defined by the first iteration of the above defined process for the given example.
- the diagram assumes that ingress into this network can be distributed over nodes 1-4 and likewise 13-18, in other words these LSRs are at the edge of the network but have the same external interfaces.
- the process would generate a set of lexicographically sorted unique paths for all node pairs from 1- 13 to 4-18 (e.g., 1-5, 5-9, 9-13 and 4-8, 8-12, 12-18) from this set of unique paths the example assumes that a low and high path from the ranking of these unique path identifiers is selected, which correspond to trees 501 and 503.
- Figure 6 shows paths or trees selected in the second iteration of the load distribution method set forth herein above.
- the load distribution method finds two paths where the lexicographic ordering of the link load associated with each path produces a tie between two paths, and the exemplar lexographic ordering of node IDs as a path identifier is invoked to authoritatively resolve the tie.
- the lowest ranked tree 605 and the highest rank 607 from the second iteration further distributes the traffic between the nodes 1-4 and the nodes 13-18 and supplements the lowest ranked tree 601 and highest ranked tree 603 from the first iteration illustrated in Figure 5.
- the second iteration selects equal cost paths that have the least utilized links thereby increasing the utilization of bandwidth and the diversity of the topology of the selected "all pairs" paths.
- Figure 7 is a diagram of one embodiment of a mapping of a set of pseudo wires to the underlying packet switch network to support operations administration and maintenance (OAM) in the MPLS network.
- Performance monitoring can be maintained and compatibility maintained with the traffic engineering system by overlying a full mesh of peer to peer LSPs between the end points equivalent to a set of pseudo wires.
- the packet switch network scales order (N) and fault management can scale accordingly, but the overlay has peer to peer properties required for performance monitoring.
- the FECs of the pseudo wires are modified to bind the pseudo wire FEC to a PSN virtual topology index. As the PSN topology is logically peer to peer between the pseudo endpoints, the pseudo wire label provides a means of source disambiguation for OAM counters.
Abstract
Description
Claims
Priority Applications (6)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201180043490.8A CN103081416B (en) | 2010-09-08 | 2011-08-04 | Traffic engineered as the automatization of the multiprotocol label switching (MPLS) of the feedback broken to draw in mechanism using link utilization |
JP2013527707A JP5985483B2 (en) | 2010-09-08 | 2011-08-04 | Automated traffic engineering for multiprotocol label switching (MPLS) using links as feedback to tie-breaking mechanisms |
KR1020137008858A KR20130109132A (en) | 2010-09-08 | 2011-08-04 | Automated traffic engineering for multi-protocol label switching(mpls) with link utilization as feedback into the tie-breaking mechanism |
AU2011300438A AU2011300438B2 (en) | 2010-09-08 | 2011-08-04 | Automated traffic engineering for multi-protocol label switching (MPLS) with link utilization as feedback into the tie-breaking mechanism |
BR112013003488-2A BR112013003488A2 (en) | 2010-09-08 | 2011-08-04 | automated traffic engineering for multi-protocol label switching (mpls) using link as feedback in a decision mechanism |
EP11754926.1A EP2614618B1 (en) | 2010-09-08 | 2011-08-04 | Automated traffic engineering for multi-protocol label switching (mpls) with link utilization as feedback into the tie-breaking mechanism |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US12/877,830 | 2010-09-08 | ||
US12/877,830 US8553562B2 (en) | 2010-09-08 | 2010-09-08 | Automated traffic engineering for multi-protocol label switching (MPLS) with link utilization as feedback into the tie-breaking mechanism |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2012032426A1 true WO2012032426A1 (en) | 2012-03-15 |
Family
ID=44588129
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/IB2011/053493 WO2012032426A1 (en) | 2010-09-08 | 2011-08-04 | Automated traffic engineering for multi-protocol label switching (mpls) with link utilization as feedback into the tie-breaking mechanism |
Country Status (8)
Country | Link |
---|---|
US (1) | US8553562B2 (en) |
EP (1) | EP2614618B1 (en) |
JP (1) | JP5985483B2 (en) |
KR (1) | KR20130109132A (en) |
AU (1) | AU2011300438B2 (en) |
BR (1) | BR112013003488A2 (en) |
TW (1) | TWI521924B (en) |
WO (1) | WO2012032426A1 (en) |
Cited By (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102857424A (en) * | 2012-08-30 | 2013-01-02 | 杭州华三通信技术有限公司 | Method and equipment for establishing LSP (label switched path) in MPLS (multi-protocol label switching) network |
WO2013173900A1 (en) * | 2012-05-22 | 2013-11-28 | Rockstar Bidco Lp | Tie-breaking in shortest path determination |
US8699329B2 (en) | 2007-12-26 | 2014-04-15 | Rockstar Consortium Us Lp | Tie-breaking in shortest path determination |
US8761022B2 (en) | 2007-12-26 | 2014-06-24 | Rockstar Consortium Us Lp | Tie-breaking in shortest path determination |
JP2014230100A (en) * | 2013-05-22 | 2014-12-08 | 富士通株式会社 | Packet transfer device and packet transfer method |
Families Citing this family (159)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US9456054B2 (en) | 2008-05-16 | 2016-09-27 | Palo Alto Research Center Incorporated | Controlling the spread of interests and content in a content centric network |
US8923293B2 (en) | 2009-10-21 | 2014-12-30 | Palo Alto Research Center Incorporated | Adaptive multi-interface use for content networking |
US9280546B2 (en) | 2012-10-31 | 2016-03-08 | Palo Alto Research Center Incorporated | System and method for accessing digital content using a location-independent name |
US9400800B2 (en) | 2012-11-19 | 2016-07-26 | Palo Alto Research Center Incorporated | Data transport by named content synchronization |
US10430839B2 (en) | 2012-12-12 | 2019-10-01 | Cisco Technology, Inc. | Distributed advertisement insertion in content-centric networks |
US9584387B1 (en) * | 2013-03-15 | 2017-02-28 | Google Inc. | Systems and methods of sending a packet in a packet-switched network through a pre-determined path to monitor network health |
US9978025B2 (en) | 2013-03-20 | 2018-05-22 | Cisco Technology, Inc. | Ordered-element naming for name-based packet forwarding |
US9935791B2 (en) | 2013-05-20 | 2018-04-03 | Cisco Technology, Inc. | Method and system for name resolution across heterogeneous architectures |
US9185120B2 (en) | 2013-05-23 | 2015-11-10 | Palo Alto Research Center Incorporated | Method and system for mitigating interest flooding attacks in content-centric networks |
US9160651B2 (en) | 2013-07-24 | 2015-10-13 | Telefonaktiebolaget L M Ericsson (Publ) | Metric biasing for bandwidth aware tie breaking |
WO2015011648A1 (en) * | 2013-07-24 | 2015-01-29 | Telefonaktiebolaget L M Ericsson (Publ) | Automated traffic engineering based upon the use of bandwidth and unequal cost path utilization |
US9444722B2 (en) | 2013-08-01 | 2016-09-13 | Palo Alto Research Center Incorporated | Method and apparatus for configuring routing paths in a custodian-based routing architecture |
US20150109934A1 (en) * | 2013-10-23 | 2015-04-23 | Paramasiviah HARSHAVARDHA | Internet protocol routing mehtod and associated architectures |
US9407549B2 (en) | 2013-10-29 | 2016-08-02 | Palo Alto Research Center Incorporated | System and method for hash-based forwarding of packets with hierarchically structured variable-length identifiers |
US9282050B2 (en) | 2013-10-30 | 2016-03-08 | Palo Alto Research Center Incorporated | System and method for minimum path MTU discovery in content centric networks |
US9450858B2 (en) | 2013-10-30 | 2016-09-20 | Cisco Technology, Inc. | Standby bandwidth aware path computation |
US9276840B2 (en) | 2013-10-30 | 2016-03-01 | Palo Alto Research Center Incorporated | Interest messages with a payload for a named data network |
US9401864B2 (en) | 2013-10-31 | 2016-07-26 | Palo Alto Research Center Incorporated | Express header for packets with hierarchically structured variable-length identifiers |
US9634938B2 (en) | 2013-11-05 | 2017-04-25 | International Business Machines Corporation | Adaptive scheduling of data flows in data center networks for efficient resource utilization |
US9311377B2 (en) | 2013-11-13 | 2016-04-12 | Palo Alto Research Center Incorporated | Method and apparatus for performing server handoff in a name-based content distribution system |
US10101801B2 (en) | 2013-11-13 | 2018-10-16 | Cisco Technology, Inc. | Method and apparatus for prefetching content in a data stream |
US10129365B2 (en) | 2013-11-13 | 2018-11-13 | Cisco Technology, Inc. | Method and apparatus for pre-fetching remote content based on static and dynamic recommendations |
US10089655B2 (en) | 2013-11-27 | 2018-10-02 | Cisco Technology, Inc. | Method and apparatus for scalable data broadcasting |
US9503358B2 (en) * | 2013-12-05 | 2016-11-22 | Palo Alto Research Center Incorporated | Distance-based routing in an information-centric network |
US9479437B1 (en) * | 2013-12-20 | 2016-10-25 | Google Inc. | Efficient updates of weighted cost multipath (WCMP) groups |
US9397957B2 (en) * | 2013-12-23 | 2016-07-19 | Google Inc. | Traffic engineering for large scale data center networks |
US9166887B2 (en) | 2013-12-26 | 2015-10-20 | Telefonaktiebolaget L M Ericsson (Publ) | Multicast convergence |
US9379979B2 (en) | 2014-01-14 | 2016-06-28 | Palo Alto Research Center Incorporated | Method and apparatus for establishing a virtual interface for a set of mutual-listener devices |
US10098051B2 (en) | 2014-01-22 | 2018-10-09 | Cisco Technology, Inc. | Gateways and routing in software-defined manets |
US10172068B2 (en) | 2014-01-22 | 2019-01-01 | Cisco Technology, Inc. | Service-oriented routing in software-defined MANETs |
US9374304B2 (en) | 2014-01-24 | 2016-06-21 | Palo Alto Research Center Incorporated | End-to end route tracing over a named-data network |
US9531679B2 (en) | 2014-02-06 | 2016-12-27 | Palo Alto Research Center Incorporated | Content-based transport security for distributed producers |
US9954678B2 (en) | 2014-02-06 | 2018-04-24 | Cisco Technology, Inc. | Content-based transport security |
CN103825818B (en) * | 2014-02-14 | 2018-07-31 | 新华三技术有限公司 | A kind of more topological network retransmission methods and device |
US9678998B2 (en) | 2014-02-28 | 2017-06-13 | Cisco Technology, Inc. | Content name resolution for information centric networking |
US10089651B2 (en) | 2014-03-03 | 2018-10-02 | Cisco Technology, Inc. | Method and apparatus for streaming advertisements in a scalable data broadcasting system |
US9836540B2 (en) | 2014-03-04 | 2017-12-05 | Cisco Technology, Inc. | System and method for direct storage access in a content-centric network |
US9391896B2 (en) | 2014-03-10 | 2016-07-12 | Palo Alto Research Center Incorporated | System and method for packet forwarding using a conjunctive normal form strategy in a content-centric network |
US9473405B2 (en) | 2014-03-10 | 2016-10-18 | Palo Alto Research Center Incorporated | Concurrent hashes and sub-hashes on data streams |
US9626413B2 (en) | 2014-03-10 | 2017-04-18 | Cisco Systems, Inc. | System and method for ranking content popularity in a content-centric network |
US9407432B2 (en) | 2014-03-19 | 2016-08-02 | Palo Alto Research Center Incorporated | System and method for efficient and secure distribution of digital content |
US9916601B2 (en) | 2014-03-21 | 2018-03-13 | Cisco Technology, Inc. | Marketplace for presenting advertisements in a scalable data broadcasting system |
US9363179B2 (en) | 2014-03-26 | 2016-06-07 | Palo Alto Research Center Incorporated | Multi-publisher routing protocol for named data networks |
US9363086B2 (en) | 2014-03-31 | 2016-06-07 | Palo Alto Research Center Incorporated | Aggregate signing of data in content centric networking |
US9716622B2 (en) | 2014-04-01 | 2017-07-25 | Cisco Technology, Inc. | System and method for dynamic name configuration in content-centric networks |
US9390289B2 (en) | 2014-04-07 | 2016-07-12 | Palo Alto Research Center Incorporated | Secure collection synchronization using matched network names |
US10075521B2 (en) | 2014-04-07 | 2018-09-11 | Cisco Technology, Inc. | Collection synchronization using equality matched network names |
US9473576B2 (en) | 2014-04-07 | 2016-10-18 | Palo Alto Research Center Incorporated | Service discovery using collection synchronization with exact names |
US9451032B2 (en) | 2014-04-10 | 2016-09-20 | Palo Alto Research Center Incorporated | System and method for simple service discovery in content-centric networks |
US8942727B1 (en) | 2014-04-11 | 2015-01-27 | ACR Development, Inc. | User Location Tracking |
US9413707B2 (en) | 2014-04-11 | 2016-08-09 | ACR Development, Inc. | Automated user task management |
US9413668B2 (en) * | 2014-04-23 | 2016-08-09 | Dell Products L.P. | Systems and methods for load-balancing in a data center |
US9203885B2 (en) | 2014-04-28 | 2015-12-01 | Palo Alto Research Center Incorporated | Method and apparatus for exchanging bidirectional streams over a content centric network |
US9992281B2 (en) | 2014-05-01 | 2018-06-05 | Cisco Technology, Inc. | Accountable content stores for information centric networks |
US9609014B2 (en) | 2014-05-22 | 2017-03-28 | Cisco Systems, Inc. | Method and apparatus for preventing insertion of malicious content at a named data network router |
US9455835B2 (en) | 2014-05-23 | 2016-09-27 | Palo Alto Research Center Incorporated | System and method for circular link resolution with hash-based names in content-centric networks |
US9276751B2 (en) | 2014-05-28 | 2016-03-01 | Palo Alto Research Center Incorporated | System and method for circular link resolution with computable hash-based names in content-centric networks |
US9537719B2 (en) | 2014-06-19 | 2017-01-03 | Palo Alto Research Center Incorporated | Method and apparatus for deploying a minimal-cost CCN topology |
US9467377B2 (en) | 2014-06-19 | 2016-10-11 | Palo Alto Research Center Incorporated | Associating consumer states with interests in a content-centric network |
US9516144B2 (en) | 2014-06-19 | 2016-12-06 | Palo Alto Research Center Incorporated | Cut-through forwarding of CCNx message fragments with IP encapsulation |
US9426113B2 (en) | 2014-06-30 | 2016-08-23 | Palo Alto Research Center Incorporated | System and method for managing devices over a content centric network |
US9699198B2 (en) | 2014-07-07 | 2017-07-04 | Cisco Technology, Inc. | System and method for parallel secure content bootstrapping in content-centric networks |
US9959156B2 (en) | 2014-07-17 | 2018-05-01 | Cisco Technology, Inc. | Interest return control message |
US9621354B2 (en) | 2014-07-17 | 2017-04-11 | Cisco Systems, Inc. | Reconstructable content objects |
US9590887B2 (en) | 2014-07-18 | 2017-03-07 | Cisco Systems, Inc. | Method and system for keeping interest alive in a content centric network |
US9729616B2 (en) | 2014-07-18 | 2017-08-08 | Cisco Technology, Inc. | Reputation-based strategy for forwarding and responding to interests over a content centric network |
US9535968B2 (en) | 2014-07-21 | 2017-01-03 | Palo Alto Research Center Incorporated | System for distributing nameless objects using self-certifying names |
US9882964B2 (en) | 2014-08-08 | 2018-01-30 | Cisco Technology, Inc. | Explicit strategy feedback in name-based forwarding |
US9729662B2 (en) | 2014-08-11 | 2017-08-08 | Cisco Technology, Inc. | Probabilistic lazy-forwarding technique without validation in a content centric network |
US9503365B2 (en) | 2014-08-11 | 2016-11-22 | Palo Alto Research Center Incorporated | Reputation-based instruction processing over an information centric network |
US9391777B2 (en) | 2014-08-15 | 2016-07-12 | Palo Alto Research Center Incorporated | System and method for performing key resolution over a content centric network |
US9467492B2 (en) | 2014-08-19 | 2016-10-11 | Palo Alto Research Center Incorporated | System and method for reconstructable all-in-one content stream |
US9800637B2 (en) | 2014-08-19 | 2017-10-24 | Cisco Technology, Inc. | System and method for all-in-one content stream in content-centric networks |
US9497282B2 (en) | 2014-08-27 | 2016-11-15 | Palo Alto Research Center Incorporated | Network coding for content-centric network |
US10204013B2 (en) | 2014-09-03 | 2019-02-12 | Cisco Technology, Inc. | System and method for maintaining a distributed and fault-tolerant state over an information centric network |
US9553812B2 (en) | 2014-09-09 | 2017-01-24 | Palo Alto Research Center Incorporated | Interest keep alives at intermediate routers in a CCN |
US10069933B2 (en) | 2014-10-23 | 2018-09-04 | Cisco Technology, Inc. | System and method for creating virtual interfaces based on network characteristics |
US9590948B2 (en) | 2014-12-15 | 2017-03-07 | Cisco Systems, Inc. | CCN routing using hardware-assisted hash tables |
US9536059B2 (en) | 2014-12-15 | 2017-01-03 | Palo Alto Research Center Incorporated | Method and system for verifying renamed content using manifests in a content centric network |
US10237189B2 (en) | 2014-12-16 | 2019-03-19 | Cisco Technology, Inc. | System and method for distance-based interest forwarding |
US9846881B2 (en) | 2014-12-19 | 2017-12-19 | Palo Alto Research Center Incorporated | Frugal user engagement help systems |
US10003520B2 (en) | 2014-12-22 | 2018-06-19 | Cisco Technology, Inc. | System and method for efficient name-based content routing using link-state information in information-centric networks |
US9473475B2 (en) | 2014-12-22 | 2016-10-18 | Palo Alto Research Center Incorporated | Low-cost authenticated signing delegation in content centric networking |
US9660825B2 (en) | 2014-12-24 | 2017-05-23 | Cisco Technology, Inc. | System and method for multi-source multicasting in content-centric networks |
US9916457B2 (en) | 2015-01-12 | 2018-03-13 | Cisco Technology, Inc. | Decoupled name security binding for CCN objects |
US9954795B2 (en) | 2015-01-12 | 2018-04-24 | Cisco Technology, Inc. | Resource allocation using CCN manifests |
US9602596B2 (en) | 2015-01-12 | 2017-03-21 | Cisco Systems, Inc. | Peer-to-peer sharing in a content centric network |
US9832291B2 (en) | 2015-01-12 | 2017-11-28 | Cisco Technology, Inc. | Auto-configurable transport stack |
US9946743B2 (en) | 2015-01-12 | 2018-04-17 | Cisco Technology, Inc. | Order encoded manifests in a content centric network |
US9462006B2 (en) | 2015-01-21 | 2016-10-04 | Palo Alto Research Center Incorporated | Network-layer application-specific trust model |
US9552493B2 (en) | 2015-02-03 | 2017-01-24 | Palo Alto Research Center Incorporated | Access control framework for information centric networking |
US10333840B2 (en) | 2015-02-06 | 2019-06-25 | Cisco Technology, Inc. | System and method for on-demand content exchange with adaptive naming in information-centric networks |
US10075401B2 (en) | 2015-03-18 | 2018-09-11 | Cisco Technology, Inc. | Pending interest table behavior |
US10116605B2 (en) | 2015-06-22 | 2018-10-30 | Cisco Technology, Inc. | Transport stack name scheme and identity management |
US10075402B2 (en) | 2015-06-24 | 2018-09-11 | Cisco Technology, Inc. | Flexible command and control in content centric networks |
US10701038B2 (en) | 2015-07-27 | 2020-06-30 | Cisco Technology, Inc. | Content negotiation in a content centric network |
US9986034B2 (en) | 2015-08-03 | 2018-05-29 | Cisco Technology, Inc. | Transferring state in content centric network stacks |
US10610144B2 (en) | 2015-08-19 | 2020-04-07 | Palo Alto Research Center Incorporated | Interactive remote patient monitoring and condition management intervention system |
US10530692B2 (en) * | 2015-09-04 | 2020-01-07 | Arista Networks, Inc. | Software FIB ARP FEC encoding |
US9832123B2 (en) | 2015-09-11 | 2017-11-28 | Cisco Technology, Inc. | Network named fragments in a content centric network |
US10355999B2 (en) | 2015-09-23 | 2019-07-16 | Cisco Technology, Inc. | Flow control with network named fragments |
US10313227B2 (en) | 2015-09-24 | 2019-06-04 | Cisco Technology, Inc. | System and method for eliminating undetected interest looping in information-centric networks |
US9977809B2 (en) | 2015-09-24 | 2018-05-22 | Cisco Technology, Inc. | Information and data framework in a content centric network |
US10454820B2 (en) | 2015-09-29 | 2019-10-22 | Cisco Technology, Inc. | System and method for stateless information-centric networking |
US10263965B2 (en) | 2015-10-16 | 2019-04-16 | Cisco Technology, Inc. | Encrypted CCNx |
US9794238B2 (en) | 2015-10-29 | 2017-10-17 | Cisco Technology, Inc. | System for key exchange in a content centric network |
US10009446B2 (en) | 2015-11-02 | 2018-06-26 | Cisco Technology, Inc. | Header compression for CCN messages using dictionary learning |
US9807205B2 (en) | 2015-11-02 | 2017-10-31 | Cisco Technology, Inc. | Header compression for CCN messages using dictionary |
US10021222B2 (en) | 2015-11-04 | 2018-07-10 | Cisco Technology, Inc. | Bit-aligned header compression for CCN messages using dictionary |
US10097521B2 (en) | 2015-11-20 | 2018-10-09 | Cisco Technology, Inc. | Transparent encryption in a content centric network |
US9912776B2 (en) | 2015-12-02 | 2018-03-06 | Cisco Technology, Inc. | Explicit content deletion commands in a content centric network |
US10097346B2 (en) | 2015-12-09 | 2018-10-09 | Cisco Technology, Inc. | Key catalogs in a content centric network |
US10078062B2 (en) | 2015-12-15 | 2018-09-18 | Palo Alto Research Center Incorporated | Device health estimation by combining contextual information with sensor data |
CN105516328A (en) * | 2015-12-18 | 2016-04-20 | 浪潮(北京)电子信息产业有限公司 | Dynamic load balancing method and system, and devices used for distributed storage system |
US10257271B2 (en) | 2016-01-11 | 2019-04-09 | Cisco Technology, Inc. | Chandra-Toueg consensus in a content centric network |
US9949301B2 (en) | 2016-01-20 | 2018-04-17 | Palo Alto Research Center Incorporated | Methods for fast, secure and privacy-friendly internet connection discovery in wireless networks |
US10305864B2 (en) | 2016-01-25 | 2019-05-28 | Cisco Technology, Inc. | Method and system for interest encryption in a content centric network |
CN105721307A (en) * | 2016-02-19 | 2016-06-29 | 华为技术有限公司 | Multipath message forwarding method and device |
US10043016B2 (en) | 2016-02-29 | 2018-08-07 | Cisco Technology, Inc. | Method and system for name encryption agreement in a content centric network |
US10003507B2 (en) | 2016-03-04 | 2018-06-19 | Cisco Technology, Inc. | Transport session state protocol |
US10051071B2 (en) | 2016-03-04 | 2018-08-14 | Cisco Technology, Inc. | Method and system for collecting historical network information in a content centric network |
US10742596B2 (en) | 2016-03-04 | 2020-08-11 | Cisco Technology, Inc. | Method and system for reducing a collision probability of hash-based names using a publisher identifier |
US10038633B2 (en) | 2016-03-04 | 2018-07-31 | Cisco Technology, Inc. | Protocol to query for historical network information in a content centric network |
US9832116B2 (en) | 2016-03-14 | 2017-11-28 | Cisco Technology, Inc. | Adjusting entries in a forwarding information base in a content centric network |
US10212196B2 (en) | 2016-03-16 | 2019-02-19 | Cisco Technology, Inc. | Interface discovery and authentication in a name-based network |
US10067948B2 (en) | 2016-03-18 | 2018-09-04 | Cisco Technology, Inc. | Data deduping in content centric networking manifests |
US11436656B2 (en) | 2016-03-18 | 2022-09-06 | Palo Alto Research Center Incorporated | System and method for a real-time egocentric collaborative filter on large datasets |
US10091330B2 (en) | 2016-03-23 | 2018-10-02 | Cisco Technology, Inc. | Interest scheduling by an information and data framework in a content centric network |
US10033639B2 (en) | 2016-03-25 | 2018-07-24 | Cisco Technology, Inc. | System and method for routing packets in a content centric network using anonymous datagrams |
US10320760B2 (en) | 2016-04-01 | 2019-06-11 | Cisco Technology, Inc. | Method and system for mutating and caching content in a content centric network |
US9930146B2 (en) | 2016-04-04 | 2018-03-27 | Cisco Technology, Inc. | System and method for compressing content centric networking messages |
US10425503B2 (en) | 2016-04-07 | 2019-09-24 | Cisco Technology, Inc. | Shared pending interest table in a content centric network |
US10027578B2 (en) | 2016-04-11 | 2018-07-17 | Cisco Technology, Inc. | Method and system for routable prefix queries in a content centric network |
US10404450B2 (en) | 2016-05-02 | 2019-09-03 | Cisco Technology, Inc. | Schematized access control in a content centric network |
US10320675B2 (en) | 2016-05-04 | 2019-06-11 | Cisco Technology, Inc. | System and method for routing packets in a stateless content centric network |
US10547589B2 (en) | 2016-05-09 | 2020-01-28 | Cisco Technology, Inc. | System for implementing a small computer systems interface protocol over a content centric network |
US10084764B2 (en) | 2016-05-13 | 2018-09-25 | Cisco Technology, Inc. | System for a secure encryption proxy in a content centric network |
US10063414B2 (en) | 2016-05-13 | 2018-08-28 | Cisco Technology, Inc. | Updating a transport stack in a content centric network |
US10103989B2 (en) | 2016-06-13 | 2018-10-16 | Cisco Technology, Inc. | Content object return messages in a content centric network |
US10305865B2 (en) | 2016-06-21 | 2019-05-28 | Cisco Technology, Inc. | Permutation-based content encryption with manifests in a content centric network |
US10148572B2 (en) | 2016-06-27 | 2018-12-04 | Cisco Technology, Inc. | Method and system for interest groups in a content centric network |
US10009266B2 (en) | 2016-07-05 | 2018-06-26 | Cisco Technology, Inc. | Method and system for reference counted pending interest tables in a content centric network |
US9992097B2 (en) | 2016-07-11 | 2018-06-05 | Cisco Technology, Inc. | System and method for piggybacking routing information in interests in a content centric network |
US10122624B2 (en) | 2016-07-25 | 2018-11-06 | Cisco Technology, Inc. | System and method for ephemeral entries in a forwarding information base in a content centric network |
US10027571B2 (en) * | 2016-07-28 | 2018-07-17 | Hewlett Packard Enterprise Development Lp | Load balancing |
US10069729B2 (en) | 2016-08-08 | 2018-09-04 | Cisco Technology, Inc. | System and method for throttling traffic based on a forwarding information base in a content centric network |
US10956412B2 (en) | 2016-08-09 | 2021-03-23 | Cisco Technology, Inc. | Method and system for conjunctive normal form attribute matching in a content centric network |
US10033642B2 (en) | 2016-09-19 | 2018-07-24 | Cisco Technology, Inc. | System and method for making optimal routing decisions based on device-specific parameters in a content centric network |
US10212248B2 (en) | 2016-10-03 | 2019-02-19 | Cisco Technology, Inc. | Cache management on high availability routers in a content centric network |
US10447805B2 (en) | 2016-10-10 | 2019-10-15 | Cisco Technology, Inc. | Distributed consensus in a content centric network |
US10135948B2 (en) | 2016-10-31 | 2018-11-20 | Cisco Technology, Inc. | System and method for process migration in a content centric network |
US10243851B2 (en) | 2016-11-21 | 2019-03-26 | Cisco Technology, Inc. | System and method for forwarder connection information in a content centric network |
EP3726438A1 (en) | 2017-10-23 | 2020-10-21 | Siemens Aktiengesellschaft | Method and control system for controlling and/or monitoring devices |
US10469372B2 (en) | 2018-01-09 | 2019-11-05 | Cisco Technology, Inc. | Segment-routing multiprotocol label switching end-to-end dataplane continuity |
EP3925175A1 (en) * | 2019-02-12 | 2021-12-22 | Hirschmann Automation and Control GmbH | Method for routing in time-sensitive networks |
US11290393B2 (en) * | 2019-09-05 | 2022-03-29 | Infinera Corporation | Dynamically switching queueing schemes for network switches |
US11310154B2 (en) * | 2019-09-25 | 2022-04-19 | Cisco Technology, Inc. | Enabling multicast-label-distribution-protocol (mLDP) on non-mLDP devices |
US11632323B2 (en) * | 2021-08-18 | 2023-04-18 | Microsoft Technology Licensing, Llc | Routing information exchange between separate networks to improve end-to-end network performance for users |
WO2023191903A1 (en) * | 2022-03-31 | 2023-10-05 | Futurewei Technologies, Inc. | Techniques for saving router power consumption |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090285208A1 (en) * | 2008-05-15 | 2009-11-19 | Wenhu Lu | Method and Apparatus for Performing a Constraint Shortest Path First Computation |
US20090285101A1 (en) * | 2008-05-15 | 2009-11-19 | Wenhu Lu | Method and Apparatus for Dynamically Runtime Adjustable Path Computation |
Family Cites Families (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4150159B2 (en) * | 2000-03-01 | 2008-09-17 | 富士通株式会社 | Transmission path control device, transmission path control method, and medium recording transmission path control program |
US7889681B2 (en) | 2005-03-03 | 2011-02-15 | Cisco Technology, Inc. | Methods and devices for improving the multiple spanning tree protocol |
US20070002770A1 (en) | 2005-06-30 | 2007-01-04 | Lucent Technologies Inc. | Mechanism to load balance traffic in an ethernet network |
EP2033377B1 (en) | 2006-06-27 | 2011-08-03 | Telefonaktiebolaget LM Ericsson (publ) | Forced medium access control (MAC) learning in bridged ethernet networks |
US20080159277A1 (en) | 2006-12-15 | 2008-07-03 | Brocade Communications Systems, Inc. | Ethernet over fibre channel |
WO2008111173A1 (en) | 2007-03-13 | 2008-09-18 | Fujitsu Limited | Communication path control method, communication apparatus and communication system |
JP4757826B2 (en) * | 2007-03-27 | 2011-08-24 | Kddi株式会社 | Communication path control device, program, and recording medium |
US7898965B2 (en) | 2007-10-12 | 2011-03-01 | Nortel Networks Limited | IP network and performance monitoring using ethernet OAM |
JP5004869B2 (en) * | 2008-05-22 | 2012-08-22 | 三菱電機株式会社 | Network route selection method and communication system |
US20100157821A1 (en) | 2008-12-18 | 2010-06-24 | Morris Robert P | Methods, Systems, And Computer Program Products For Sending Data Units Based On A Measure Of Energy |
US20110194404A1 (en) | 2010-02-11 | 2011-08-11 | Nokia Siemens Networks Ethernet Solutions Ltd. | System and method for fast protection of dual-homed virtual private lan service (vpls) spokes |
-
2010
- 2010-09-08 US US12/877,830 patent/US8553562B2/en active Active
-
2011
- 2011-08-04 JP JP2013527707A patent/JP5985483B2/en not_active Expired - Fee Related
- 2011-08-04 EP EP11754926.1A patent/EP2614618B1/en not_active Not-in-force
- 2011-08-04 WO PCT/IB2011/053493 patent/WO2012032426A1/en active Application Filing
- 2011-08-04 AU AU2011300438A patent/AU2011300438B2/en not_active Ceased
- 2011-08-04 KR KR1020137008858A patent/KR20130109132A/en not_active Application Discontinuation
- 2011-08-04 BR BR112013003488-2A patent/BR112013003488A2/en not_active Application Discontinuation
- 2011-08-17 TW TW100129455A patent/TWI521924B/en not_active IP Right Cessation
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20090285208A1 (en) * | 2008-05-15 | 2009-11-19 | Wenhu Lu | Method and Apparatus for Performing a Constraint Shortest Path First Computation |
US20090285101A1 (en) * | 2008-05-15 | 2009-11-19 | Wenhu Lu | Method and Apparatus for Dynamically Runtime Adjustable Path Computation |
Non-Patent Citations (1)
Title |
---|
"MPLS TE Technology Overview", 14 May 2006 (2006-05-14), pages 57 - 77, XP055003004, Retrieved from the Internet <URL:http://ptgmedia.pearsoncmg.com/images/1587052334/samplechapter/1587052334content.pdf> [retrieved on 20110718] * |
Cited By (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US8699329B2 (en) | 2007-12-26 | 2014-04-15 | Rockstar Consortium Us Lp | Tie-breaking in shortest path determination |
US8761022B2 (en) | 2007-12-26 | 2014-06-24 | Rockstar Consortium Us Lp | Tie-breaking in shortest path determination |
WO2013173900A1 (en) * | 2012-05-22 | 2013-11-28 | Rockstar Bidco Lp | Tie-breaking in shortest path determination |
CN102857424A (en) * | 2012-08-30 | 2013-01-02 | 杭州华三通信技术有限公司 | Method and equipment for establishing LSP (label switched path) in MPLS (multi-protocol label switching) network |
CN102857424B (en) * | 2012-08-30 | 2015-04-15 | 杭州华三通信技术有限公司 | Method and equipment for establishing LSP (label switched path) in MPLS (multi-protocol label switching) network |
JP2014230100A (en) * | 2013-05-22 | 2014-12-08 | 富士通株式会社 | Packet transfer device and packet transfer method |
Also Published As
Publication number | Publication date |
---|---|
AU2011300438B2 (en) | 2015-05-07 |
TW201215063A (en) | 2012-04-01 |
AU2011300438A1 (en) | 2013-04-11 |
CN103081416A (en) | 2013-05-01 |
US20120057466A1 (en) | 2012-03-08 |
EP2614618A1 (en) | 2013-07-17 |
JP2013539646A (en) | 2013-10-24 |
BR112013003488A2 (en) | 2020-08-04 |
TWI521924B (en) | 2016-02-11 |
US8553562B2 (en) | 2013-10-08 |
JP5985483B2 (en) | 2016-09-06 |
EP2614618B1 (en) | 2018-12-12 |
KR20130109132A (en) | 2013-10-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
AU2011300438B2 (en) | Automated traffic engineering for multi-protocol label switching (MPLS) with link utilization as feedback into the tie-breaking mechanism | |
US8553584B2 (en) | Automated traffic engineering for 802.1AQ based upon the use of link utilization as feedback into the tie breaking mechanism | |
AU2011290494B2 (en) | Automated traffic engineering for fat tree networks | |
US20200336417A1 (en) | Apparatus, system, and method for packet switching | |
US9160651B2 (en) | Metric biasing for bandwidth aware tie breaking | |
US9166887B2 (en) | Multicast convergence | |
US20150032871A1 (en) | Automated traffic engineering based upon the use of bandwidth and unequal cost path utilization | |
US9647959B2 (en) | Method, device, and system for creating bidirectional multicast distribution tree based on interior gateway protocol | |
US20150016242A1 (en) | Method and Apparatus for Optimized LFA Computations by Pruning Neighbor Shortest Path Trees | |
EP3399703A1 (en) | Method for implementing load balancing, apparatus, and network system | |
Castoldi et al. | Segment routing in multi-layer networks | |
US11936559B2 (en) | Fast receive re-convergence of multi-pod multi-destination traffic in response to local disruptions | |
WO2015011648A1 (en) | Automated traffic engineering based upon the use of bandwidth and unequal cost path utilization |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
WWE | Wipo information: entry into national phase |
Ref document number: 201180043490.8 Country of ref document: CN |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 11754926 Country of ref document: EP Kind code of ref document: A1 |
|
ENP | Entry into the national phase |
Ref document number: 2013527707 Country of ref document: JP Kind code of ref document: A |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2011754926 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 20137008858 Country of ref document: KR Kind code of ref document: A |
|
ENP | Entry into the national phase |
Ref document number: 2011300438 Country of ref document: AU Date of ref document: 20110804 Kind code of ref document: A |
|
REG | Reference to national code |
Ref country code: BR Ref legal event code: B01A Ref document number: 112013003488 Country of ref document: BR |
|
ENP | Entry into the national phase |
Ref document number: 112013003488 Country of ref document: BR Kind code of ref document: A2 Effective date: 20130214 |