| dc.contributor.author | Borne, Sylvie | |
| dc.contributor.author | Gourdin, Eric | |
| dc.contributor.author | Liau, Bernard | |
| dc.contributor.author | Lime, Didier | |
| dc.date.accessioned | 2009-10-30T14:17:40Z | |
| dc.date.available | 2009-10-30T14:17:40Z | |
| dc.date.issued | 2006 | |
| dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/2372 | |
| dc.language.iso | en | en |
| dc.subject | IP-over-optical network | en |
| dc.subject | Survivability | en |
| dc.subject | Integer programming | en |
| dc.subject | Branch-and-Cut algorithm | en |
| dc.subject.ddc | 003 | en |
| dc.title | Design of Survivable IP-over-Optical Networks | en |
| dc.type | Article accepté pour publication ou publié | |
| dc.contributor.editoruniversityother | France Telecom;France | |
| dc.contributor.editoruniversityother | Université Blaise Pascal - Clermont Ferrand II;France | |
| dc.description.abstracten | 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. | en |
| dc.relation.isversionofjnlname | Annals of Operations Research | |
| dc.relation.isversionofjnlvol | 146 | en |
| dc.relation.isversionofjnlissue | 1 | en |
| dc.relation.isversionofjnldate | 2006-09 | |
| dc.relation.isversionofjnlpages | 41-73 | en |
| dc.relation.isversionofdoi | http://dx.doi.org/10.1007/s10479-006-0047-2 | en |
| dc.description.sponsorshipprivate | oui | en |
| dc.relation.isversionofjnlpublisher | Springer Netherlands | en |
| dc.subject.ddclabel | Recherche opérationnelle | en |
