Józsa et al., 2001 - Google Patents
Reroute sequence planning for label switched paths in multiprotocol label switching networksJózsa et al., 2001
- Document ID
- 11637574372327412316
- Author
- Józsa B
- Magyar G
- Publication year
- Publication venue
- Proceedings. Sixth IEEE Symposium on Computers and Communications
External Links
Snippet
This paper deals with the problem of reroute sequence planning for label switched paths (LSPs) in multiprotocol label switching (MPLS) networks. This problem arises when the path set is recalculated by a global optimization method for achieving a better resource utilization …
- 238000000034 method 0 abstract description 15
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/5601—Transfer mode dependent, e.g. ATM
- H04L2012/5619—Network Node Interface, e.g. tandem connections, transit switching
-
- 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
- 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/5003—Managing service level agreement [SLA] or interaction between SLA and quality of service [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/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/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/22—Alternate routing
-
- 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/22—Arrangements for maintenance or administration or management of packet switching networks using GUI [Graphical User Interface]
-
- 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/12—Arrangements for maintenance or administration or management of packet switching networks network topology discovery or management
-
- 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
- H04L41/00—Arrangements for maintenance or administration or management of packet switching networks
- H04L41/14—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning
- H04L41/145—Arrangements for maintenance or administration or management of packet switching networks involving network analysis or design, e.g. simulation, network model or planning involving simulating, designing, planning or modelling of a network
-
- 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
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Kuri et al. | Routing and wavelength assignment of scheduled lightpath demands | |
CN1799228B (en) | Data networks | |
US20100091656A1 (en) | Method and Apparatus for Communications Traffic Engineering | |
US20020097680A1 (en) | Apparatus and method for spare capacity allocation | |
Skorin-Kapov | Heuristic algorithms for the routing and wavelength assignment of scheduled lightpath demands in optical networks | |
US7433315B2 (en) | Method for fast network re-optimization | |
US20230308352A1 (en) | Optimization method and system for minimizing network energy consumption based on traffic grooming | |
Ho et al. | Reconfiguration of spare capacity for MPLS-based recovery in the Internet backbone networks | |
Koulougli et al. | Flexible ethernet traffic restoration in multi-layer multi-domain networks | |
Józsa et al. | On the solution of reroute sequence planning problem in MPLS networks | |
Bhatia et al. | Bandwidth guaranteed routing with fast restoration against link and node failures | |
Józsa et al. | Reroute sequence planning for label switched paths in multiprotocol label switching networks | |
US20050174934A1 (en) | Traffic-independent allocation of working and restoration capacity in networks | |
CN111865789B (en) | SR path constraint method based on segment routing | |
US6731608B2 (en) | Complex node representations in PNNI systems | |
J# x00F3; zsa et al. | An efficient algorithm for global path optimization in MPLS networks | |
Alicherry et al. | Preprovisioning networks to support fast restoration with minimum over-build | |
Eiger et al. | Network restoration under a single link or node failure using preconfigured virtual cycles | |
Karasan et al. | Robust path design algorithms for traffic engineering with restoration in MPLS networks | |
Cavendish et al. | Routing and wavelength assignment in WDM rings with heterogeneous wavelength conversion capabilities | |
Lau et al. | Preemption with rerouting to minimize service disruption in connection-oriented networks | |
CN102142972B (en) | Networking method and networking device of IP (internet protocol) network | |
Sridharan et al. | On improving partial information routing with segmented path protection | |
Joung et al. | Linear programming based heuristic algorithms for tunnel assignment and reconfiguration in MPLS networks | |
Hendling et al. | Interference minimizing bandwidth guaranteed on-line routing algorithm for traffic engineering |