Path computation in multi-layer networks: Complexity and algorithms

Abstract : Carrier-grade networks comprise several layers where different protocols coexist. Nowadays, most of these networks have different control planes to manage routing on different layers, leading to a suboptimal use of the network resources and additional operational costs. However, some routers are able to encapsulate, decapsulate and convert protocols and act as a liaison between these layers. A unified control plane would be useful to optimize the use of the network resources and automate the routing configurations. Software-Defined Networking (SDN) based architectures, such as OpenFlow, offer a chance to design such a control plane. One of the most important problems to deal with in this design is the path computation process. Classical path computation algorithms cannot resolve the problem as they do not take into account encapsulations and conversions of protocols. In this paper, we propose algorithms to solve this problem and study several cases: Path computation without bandwidth constraint, under bandwidth constraint and under other Quality of Service constraints. We study the complexity and the scalability of our algorithms and evaluate their performances on real topologies. The results show that they outperform the previous ones proposed in the literature.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [26 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01252609
Contributor : Mohamed Lamine Lamali <>
Submitted on : Thursday, January 21, 2016 - 1:29:02 PM
Last modification on : Tuesday, April 24, 2018 - 1:38:37 PM
Document(s) archivé(s) le : Friday, November 11, 2016 - 2:31:50 PM

Files

extended.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01252609, version 2
  • ARXIV : 1601.01786

Citation

Mohamed Lamine Lamali, Nasreddine Fergani, Johanne Cohen, Hélia Pouyllau. Path computation in multi-layer networks: Complexity and algorithms. IEEE INFOCOM 2016, Apr 2016, San Francisco, United States. ⟨hal-01252609v2⟩

Share

Metrics

Record views

944

Files downloads

82