[go: up one dir, main page]

Ott et al., 2001 - Google Patents

Algorithms for flow allocation for multi protocol label switching

Ott et al., 2001

View DOC
Document ID
18369113591450314408
Author
Ott T
Bogovic T
Carpenter T
Krishnan K
Shallcross D
Publication year
Publication venue
MPLS International Conference (October 2000)

External Links

Snippet

Multi Protocol Label Switching (MPLS)[1] is a flexible routing mechanism for traffic flows that is based on the assignment of flows to complete end-to-end paths within an Autonomous Domain. The flexibility comes from the freedom to choose the criterion by which traffic flows …
Continue reading at teunisott.com (DOC) (other versions)

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • H04L12/5695—Admission control; Resource allocation
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L12/00—Data switching networks
    • H04L12/54—Store-and-forward switching systems
    • H04L12/56—Packet switching systems
    • H04L12/5601—Transfer mode dependent, e.g. ATM
    • 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/121—Minimizing delay
    • 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/22—Alternate 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/12—Shortest path evaluation
    • H04L45/128—Shortest path evaluation for finding disjoint paths
    • H04L45/1283—Shortest path evaluation for finding disjoint paths with disjoint links
    • 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/30—Special provisions for routing multiclass traffic
    • H04L45/302—Route determination based on requested QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control
    • H04L47/12—Congestion avoidance or recovery
    • 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
    • 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/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/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/24—Multipath
    • H04L45/245—Link aggregation, e.g. trunking
    • 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/14—Routing performance; Theoretical aspects
    • 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/30—Special provisions for routing multiclass traffic
    • H04L45/306—Route determination based on the nature of the carried application
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/70—Admission control or resource allocation
    • H04L47/82—Miscellaneous aspects
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing packet switching networks
    • H04L43/08—Monitoring based on specific metrics
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q11/00—Selecting arrangements for multiplex systems
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04Q—SELECTING
    • H04Q3/00—Selecting arrangements
    • H04Q3/64—Distributing or queueing

Similar Documents

Publication Publication Date Title
Nace et al. Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial
Boutaba et al. DORA: Efficient routing for MPLS traffic engineering
Gelenbe Sensible decisions based on QoS
US20040228323A1 (en) Route precomputation method and apparatus for bandwidth guaranteed traffic
Gopalan et al. Load balancing routing with bandwidth-delay guarantees
Mishra et al. S-OSPF: A traffic engineering solution for OSPF based best effort networks
Ott et al. Algorithms for flow allocation for multi protocol label switching
US7656886B2 (en) Non-blocking internet backbone network
Yannuzzi et al. Toward a new route control model for multidomain optical networks
Banner et al. Designing low-capacity backup networks for fast restoration
Cho et al. Multi-path constraint-based routing algorithms for MPLS traffic engineering
Li et al. ERMAO: An enhanced intradomain traffic engineering approach in LISP-capable networks
Kumar et al. Routing guaranteed bandwidth virtual paths with simultaneous maximization of additional flows
Lee et al. Hybrid multipath routing algorithms for load balancing in MPLS based IP network
Beker et al. Off-line MPLS layout design and reconfiguration: Reducing complexity under dynamic traffic conditions
Mohan et al. QoS routing in GMPLS-capable integrated IP/WDM networks with router cost constraints
Karasan et al. Robust path design algorithms for traffic engineering with restoration in MPLS networks
Szviatovszki et al. On the effectiveness of restoration path computation methods
Lu et al. Optimal LSP capacity and flow assignment using traffic engineering in MPLS networks
Yang et al. Traffic engineering in the peer-to-peer SDN
Hendling et al. A new bandwidth guaranteed routing approach for online calculation of LSPs for MPLS traffic engineering
Suryasaputra et al. Verification of MPLS traffic engineering techniques
Farkas Ip traffic engineering using omp technique
Huerta et al. Model for flows allocation and cost minimization in MPLS networks
Hong et al. QoS routing schemes for supporting load balancing