Virtual network mapping algorithm for large-scale network environment

A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, existing algorithms are almost concentrated on the randomly small-scale network topology,...

Full description

Saved in:
Bibliographic Details
Published in2011 6th International ICST Conference on Communications and Networking in China (CHINACOM) pp. 765 - 770
Main Authors Shun-li Zhang, Xue-song Qiu, Luo-ming Meng
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2011
Subjects
Clustering algorithms
Communities
complex network
Complex networks
network coordinate system
network virtualization
Partitioning algorithms
Resource management
simulated annealing algorithm
Substrates
Tin
virtual network mapping
Online AccessGet full text

Cover

More Information
Summary:A major challenge of network virtualization is the virtual network resource allocation problem that deals with efficient mapping of virtual nodes and virtual links onto the substrate network resources. However, existing algorithms are almost concentrated on the randomly small-scale network topology, which is not suitable for practical large-scale network environments, because more time is spent on traversing SN and VN, resulting in VN requests congestion. To address this problem, this paper proposes virtual network mapping algorithm for large-scale network based on small-world characteristic of complex network and network coordinate system. We compare our algorithm with algorithm D-ViNE. Experimental results show that our algorithm improves the overall performance.
ISBN:9781457701009
1457701006
DOI:10.1109/ChinaCom.2011.6158256