• A simple traffic independent s...

Result: A simple traffic independent scheme for enabling restoration oblivious routing of resilient connections

Title:
A simple traffic independent scheme for enabling restoration oblivious routing of resilient connections
Authors:
KODIALAM, Murali, LAKSHMAN, T. V, SENGUPTA, Sudipta
Source:
IEEE INFOCOM 2004 (the conference on computer communications). :2329-2340
Publisher Information:
Piscataway, New Jersey: IEEE, 2004.
Publication Year:
2004
Physical Description:
print, 11 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Telecommunications et theorie de l'information, Telecommunications and information theory, Télécommunications, Telecommunications, Systèmes, réseaux et services de télécommunications, Systems, networks and services of telecommunications, Télétrafic, Teletraffic, Commutation et signalisation, Switching and signalling, Réseaux téléinformatiques. Rnis, Teleprocessing networks. Isdn, Méthodes d'accès et protocoles, modèle osi, Access methods and protocols, osi model, Télécommunications optiques, Optical telecommunications, Télécommunications par fibres optiques, Optical fiber communications, Algorithme rapide, Fast algorithm, Algoritmo rápido, Approximation polynomiale, Polynomial approximation, Aproximación polinomial, Communication fibre optique, Optical fiber communication, Complexité calcul, Computational complexity, Complejidad computación, Défaillance, Failures, Fallo, Estimation a priori, A priori estimation, Estimación a priori, Evaluation performance, Performance evaluation, Evaluación prestación, Implémentation, Implementation, Implementación, Méthode combinatoire, Combinatorial method, Método combinatorio, Méthode itérative, Iterative method, Método iterativo, Méthode partition, Partition method, Método partición, Noeud structure, Nodes, Nudo estructura, Plus court chemin, Shortest path, Camino más corto, Protocole MPLS, MPLS protocol, Protocolo MPLS, Protocole routage, Routing protocols, Protocole transmission, Transmission protocol, Protocolo transmisión, Routage réseau, Network routing, Réseau fibre optique, Optical fiber network, Red fibra óptica, Signalisation, Signalling, Señalización, Temps polynomial, Polynomial time, Tiempo polinomial, Télétrafic, Teletraffic, Teletráfico
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Bell Laboratories. Lucent Technologies 101 Crawfords Corner Road, Holmdel. NJ 07733, United States
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=19152661
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Telecommunications and information theory
Accession Number:
edscal.19152661
Database:
PASCAL Archive

Further Information

Fast restoration is an important feature of both MPLS and optical networks. The main mechanism for achieving fast restoration is by locally routing around failures using pre-setup detour paths. Signaling and routing protocol extensions to implement this local bypass ability are currently being standardized. To make use of this ability, dynamic schemes that jointly route primary paths and all link detours for links used by the primary paths have been previously proposed. These schemes also permit sharing of reserved restoration capacity for achieving efficiency. However, this joint computation places a significantly larger computational load on the network elements than that imposed by the shortest path computation variants typically used for unprotected network connection routing. In this paper, we propose a new scheme that is operationally much simpler, shares capacity used for restoration, and permits the network to route the primary paths in a manner that is oblivious to restoration needs. Restoration of all carried traffic is guaranteed by a new link capacity partitioning scheme that maximizes the working capacity of the network without requiring any knowledge of the traffic that will he imposed on the network. Being traffic independent for a priori link capacity partitioning and being oblivious to restoration needs for on-line network routing makes this scheme operationally simple and desirable in the sense of placing no additional routing load on the constrained computing resources at the network nodes. To compute the link capacity partitions, we develop a fast combinatorial algorithm that uses only iterative shortest path computations, and is a fully polynomial time approximation scheme (FP-TAS), i.e., it achieves a (1 ) )-factor approximation for any ∈ > 0 and runs in time polynomial in the input size and 1/2 The approximation scheme also allows link detour paths to be hop constrained if needed so as to hound restoration latency in optical networks.