Improving centralized path calculation based on graph compression

Shortest-path calculation on weighted graphs are an essential operation in computer networks. The performance of such algorithms has become a critical challenge in emerging software-defined networks (SDN), since SDN controllers need to centralizedly perform a shortest-path query for every flow, usua...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	China communications 2018-06, Vol.15 (6), p.120-124
Hauptverfasser:	Li, Zhenglian, Ji, Lixin, Huang, Ruiyang, Liu, Shuxin
Format:	Artikel
Sprache:	eng
Schlagworte:	Electronic mail Genetic algorithms graph representation Heuristic algorithms Network topology path compression Routing Security shortest path Switching systems
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!