Abstract
Network virtualization is a technology which allows multiple heterogeneous virtual networks (VNs) to coexist on one substrate network (SN) at the same time and makes the internet more flexible and manageable. The main challenge for network virtualization is how to map a VN to a SN efficiently, which is known as the virtual network embedding (VNE) problem. VNE problem is proved as an NP-Hard problem, previous works have presented several heuristic algorithms to solve VNE problem. In this thesis, we present a virtual network embedding algorithm which is focus on minimizing the average path length of the virtual links. Unlike the two-stage algorithm, our algorithm adopts node mapping and link mapping in the same time. Our algorithm maps the largest adjacent bandwidth virtual node to SN then map the virtual links to the substrate shortest paths which has the maximum bottleneck bandwidth. Simulation results show that our algorithm has better mapping successful rate and shorter average path length of the virtual links than others.