Name
Abstract | ||
|---|---|---|
Embedding a sequence of virtual networks (VNs) into a given physical network substrate to accommodate as many VN requests as possible is known to be NP-hard. This paper presents a new approach to studying this problem. In particular, we devise a topology-aware measure on node resources based on random walks and use it to rank a node's resources and topological attributes. We then devise a greedy algorithm that matches nodes in the VN to nodes in the substrate network according to node ranks. In most situations there exist multiple embedding solutions, and so we want to find the best embedding that increases the possibility of accepting future VN requests and optimizes the revenue for the provider of the substrate network. We present an integer linear programming formulation for this optimization problem when path splitting is not allowed. We then devise a fast-convergent discrete Particle Swarm Optimization algorithm to approximate this problem. Extensive simulation results show that our algorithms produce near optimal solutions and significantly outperform existing algorithms in terms of the ratio of the long-term average revenue over the VN request acceptance. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.comnet.2012.01.022 | Computer Networks |
Keywords | DocType | Volume |
Network virtualization,Virtual network embedding,Topology awareness,Random walk,Meta-heuristic,Particle swarm optimization | Journal | 56 |
Issue | ISSN | Citations |
6 | 1389-1286 | 67 |
PageRank | References | Authors |
2.19 | 20 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xiang Cheng | 1 | 410 | 28.18 |
| Sen Su | 2 | 666 | 65.68 |
| Zhongbao Zhang | 3 | 404 | 27.60 |
| Kai Shuang | 4 | 330 | 28.68 |
| Fangchun Yang | 5 | 1082 | 90.49 |
| Yan Luo | 6 | 451 | 20.29 |
| J. Wang | 7 | 1436 | 105.75 |