Hop-Limit Path Mapping Algorithm for Virtual Network Embedding

Virtual network (VN) mapping which deals with the allocation of network resources from the shared physical substrate to individual VNs is one of the key challenges for the application of realizing network virtualization. While a variety of state-of-the-art algorithms have attempted to address this i...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Wireless personal communications Jg. 95; H. 3; S. 2033 - 2048
Hauptverfasser: Zhang, Min, Tang, Xijie
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.08.2017
Springer Nature B.V
Schlagworte:
Algorithms
Approximation
Communications Engineering
Computer Communication Networks
Engineering
Mapping
Mathematical analysis
Mathematical programming
Networks
Signal,Image and Speech Processing
Virtual networks
Network virtualization
Virtual link mapping
Virtual network
Virtual network embedding
ISSN:0929-6212, 1572-834X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Virtual network (VN) mapping which deals with the allocation of network resources from the shared physical substrate to individual VNs is one of the key challenges for the application of realizing network virtualization. While a variety of state-of-the-art algorithms have attempted to address this issue from different aspects, the challenge still remains for mapping virtual link with hop count constraint. This paper presents a fast approximation path mapping algorithm to address this issue by formulating such virtual link mapping problem as a path-flow mathematical programming model, which aims to minimize the maximum link load factor. Through the use of the primal–dual method, a fully polynomial time approximation algorithm is proposed to solve this model. The experimental results show that the proposed algorithm can effectively solve the problem of path mapping with hop limit.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0929-6212
1572-834X
DOI:10.1007/s11277-016-3933-1