[go: up one dir, main page]

Luss et al., 2005 - Google Patents

Graceful reassignment of excessively long communications paths in networks

Luss et al., 2005

Document ID
1242260178009295191
Author
Luss H
Wong R
Publication year
Publication venue
European Journal of Operational Research

External Links

Snippet

Modern broadband telecommunications networks transport diverse classes of traffic through flexible end-to-end communications paths. For instance, Internet Protocol (IP) networks with Multi-Protocol Label Switching (MPLS) carry traffic through label switched paths. These …
Continue reading at www.sciencedirect.com (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
    • H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
    • H04L41/50—Network service management, i.e. ensuring proper service fulfillment according to an agreement or contract between two parties, e.g. between an IT-provider and a customer
    • H04L41/5041—Service implementation
    • 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
    • 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/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
    • 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
    • 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
    • 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
    • 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
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/70—Admission control or resource allocation
    • H04L47/78—Resource allocation architecture
    • H04L47/783—Distributed allocation of resources, e.g. bandwidth brokers
    • 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
    • H04L47/00—Traffic regulation in packet switching networks
    • H04L47/10—Flow control or congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/10—Network-specific arrangements or communication protocols supporting networked applications in which an application is distributed across nodes in the network

Similar Documents

Publication Publication Date Title
Guo et al. Link‐disjoint paths for reliable QoS routing
EP1609275B1 (en) Data networking
US7397761B2 (en) Routing restorable service-level-guaranteed connections using maximum 2-route flows
EP1087576A2 (en) Constraint-based route selection using biased cost
US20020097680A1 (en) Apparatus and method for spare capacity allocation
WO2010063321A1 (en) Generating network topology parameters and monitoring a communications network domain
US20130028074A1 (en) Method and apparatus for protecting a communication network against failure
US20040083277A1 (en) Method for fast cost-effective internet network topology design
CN102047630A (en) Method and apparatus for calculating mpls traffic engineering paths
Gumaste et al. Optimized IP-over-WDM core networks using ZR+ and flexible muxponders for 400 Gb/s and beyond<? TeX\vspace*{-18pt}?>
Patel et al. Routing and scheduling for variable bandwidth advance reservation
Jaumard et al. Efficient real-time scalable make-before-break network re-routing
Kashyap et al. Routing and traffic engineering in hybrid RF/FSO networks
Li et al. Dynamic routing with inaccurate link state information in integrated IP-over-WDM networks
El-Alfy et al. A Pareto-based hybrid multiobjective evolutionary approach for constrained multipath traffic engineering optimization in MPLS/GMPLS networks
Fortz et al. Efficient techniques and tools for intra‐domain traffic engineering
Tran et al. A design framework towards the profitable operation of service overlay networks
JP2007336021A (en) Leash topology design method and leash topology design device
Gomes et al. Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost
Lin et al. Scheduling algorithms for time-constrained big-file transfers in the Internet of Vehicles
Zou et al. Novel p-cycle selection algorithms for elastic optical networks
US11750955B2 (en) Routing method for dynamic WDM optical networks with wavelength continuity constraints
Giuliari et al. GMA: A pareto optimal distributed resource-allocation algorithm
Luss et al. Graceful reassignment of excessively long communications paths in networks
Joung et al. Linear programming based heuristic algorithms for tunnel assignment and reconfiguration in MPLS networks