Algorithmic and Complexity Aspects of Path Computation in Multi-Layer Networks

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 to additional operational costs. However, some routers are...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE/ACM transactions on networking Jg. 26; H. 6; S. 2787 - 2800
Hauptverfasser:	Lamali, Mohamed Lamine, Fergani, Nasreddine, Cohen, Johanne
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.12.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) IEEE/ACM
Schlagworte:	Adaptation models Algorithms automata theory Bandwidth Complexity Complexity theory Computation Computational Complexity Computational modeling Computer Science Data Structures and Algorithms Encapsulation multi-layer networks Multilayers Networking and Internet Architecture Operating costs Optimization path computation Polynomials Protocol (computers) Protocols Quality of service Routers Software-defined networking Upper bounds Encapsulation Protocols Path computation Complexity theory automata theory multi-layer networks
ISSN:	1063-6692, 1558-2566
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!