• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Design of Survivable IP-over-Optical Networks

Thumbnail
Date
2006
Dewey
Recherche opérationnelle
Sujet
IP-over-optical network; Survivability; Integer programming; Branch-and-Cut algorithm
Journal issue
Annals of Operations Research
Volume
146
Number
1
Publication date
09-2006
Article pages
41-73
Publisher
Springer Netherlands
DOI
http://dx.doi.org/10.1007/s10479-006-0047-2
URI
https://basepub.dauphine.fr/handle/123456789/2372
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Borne, Sylvie
Gourdin, Eric
Liau, Bernard
Lime, Didier
Type
Article accepté pour publication ou publié
Abstract (EN)
In the past years, telecommunications networks have seen an important evolution with the advances in optical technologies and the explosive growth of the Internet. Several optical systems allow a very large transport capacity, and data traffic has dramatically increased. Telecommunications networks are now moving towards a model of high-speed routers interconnected by intelligent optical core networks. Moreover, there is a general consensus that the control plan of the optical networks should utilize IP-based protocols for dynamic provisioning and restoration of lightpaths. The interaction of the IP routers with the optical core networks permits to achieve end-to-end connections, and the lightpaths of the optical networks define the topology of the IP network. This new infrastructure has to be sufficiently survivable, so that network services can be restored in the event of a catastrophic failure. In this paper we consider a multilayer survivable network design problem that may be of practical interest for IP-over-optical neworks. We give an integer programming formulation for this problem and discuss the associated polytope. We describe some valid inequalities and study when these are facet defining. We discuss separation algorithms for these inequalities and introduce some reduction operations. We develop a Branch-and-Cut algorithm based on these results and present extensive computational results.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.