• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Design of Multilayer Survivable Optical Networks

Borne, Sylvie; Gabrel, Virginie; Mahjoub, Ali Ridha; Taktak, Raouia (2010), Design of Multilayer Survivable Optical Networks, ISCO International Symposium on Combinatorial Optimization, 2010-03, Hammamet, Tunisie

Type
Communication / Conférence
Date
2010
Conference title
ISCO International Symposium on Combinatorial Optimization
Conference date
2010-03
Conference city
Hammamet
Conference country
Tunisie
Metadata
Show full item record
Author(s)
Borne, Sylvie
Gabrel, Virginie
Mahjoub, Ali Ridha
Taktak, Raouia
Abstract (EN)
With the explosive growth of traffic data, telecommunication networks have evolved toward a multilayer architecture with high-speed routers interconnected by intelligent optical core networks. This architecture must be sufficiently survivable so that network services can be restored in the event of a catastrophic failure. In this paper, we consider the following survivable IPover- optical network design problem. Given a set of traffic demands and two node-disjoint paths routing each demand in the IP layer, the problem is to find for each demand two node-disjoint paths in the optical layer going through the optical switches corresponding to the routers visited in the paths of the IP layer and respecting the same order. We give two integer programming formulations for the problem. The first one uses the cut constraints and the second is a path-based formulation. We discuss the pricing problem for the latter and present some preliminary computational results. We also discuss the polyhedron associated with the cut formulation.
Subjects / Keywords
Survivability; IP-over-optical network

Related items

Showing items related by title and author.

  • Thumbnail
    Multilayer Survivable Optical Network Design 
    Taktak, Raouia; Mahjoub, Ali Ridha; Gabrel, Virginie; Borne, Sylvie (2011) Communication / Conférence
  • Thumbnail
    Design of Multilayer Survivable Optical Networks 
    Gabrel, Virginie; Mahjoub, Ali Ridha; Taktak, Raouia (2010) Communication / Conférence
  • Thumbnail
    Design of Survivable IP-over-Optical Networks 
    Borne, Sylvie; Gourdin, Eric; Liau, Bernard; Mahjoub, Ali Ridha (2003) Communication / Conférence
  • Thumbnail
    The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut 
    Mahjoub, Meriem; Diarrassouba, Ibrahima; Mahjoub, Ali Ridha; Taktak, Raouia (2017) Article accepté pour publication ou publié
  • Thumbnail
    The Multiple Steiner TSP with order constraints: complexity and optimization algorithms 
    Gabrel, Virginie; Mahjoub, Ali Ridha; Taktak, Raouia; Uchoa, Eduardo (2020) Article accepté pour publication ou publié
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo