2011Unpublished venueRequires access

Virtual network mapping algorithm for large-scale network environment

Shun-li Zhang, Xuesong Qiu, Luoming Meng

Open publisher page 2 citations

Abstract

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.

About this research paper

What this paper is about

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.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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.

Key concepts: Network virtualization, Computer science, Virtual network, Network management station, Distributed computing, Traverse, Network simulation, Network topology

Related papers

Back to paper searchBrowse research topicsOriginal source
Virtual network mapping algorithm for large-scale network environment — Research Paper | ScholarLens