dc.contributor.author | Borne, Sylvie | |
dc.contributor.author | Gabrel, Virginie | |
dc.contributor.author | Mahjoub, Ali Ridha | |
dc.contributor.author | Taktak, Raouia | |
dc.date.accessioned | 2010-04-28T10:06:34Z | |
dc.date.available | 2010-04-28T10:06:34Z | |
dc.date.issued | 2010 | |
dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/4024 | |
dc.language.iso | en | en |
dc.subject | Survivability | en |
dc.subject | IP-over-optical network | en |
dc.subject.ddc | 004 | en |
dc.title | Design of Multilayer Survivable Optical Networks | en |
dc.type | Communication / Conférence | |
dc.description.abstracten | 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. | en |
dc.description.sponsorshipprivate | oui | en |
dc.subject.ddclabel | Informatique générale | en |
dc.relation.conftitle | ISCO International Symposium on Combinatorial Optimization | en |
dc.relation.confdate | 2010-03 | |
dc.relation.confcity | Hammamet | en |
dc.relation.confcountry | Tunisie | en |