Hybrid Virtual Network Embedding with Time-oriented Scheduling Policy

LIAO Jianxin; QING Sude; WANG Jingyu; ZHU Xiaomin; WANG Jing

Article Contents

Article Navigation > Chinese Journal of Electronics > 2013 > 22(4): 789-794

LIAO Jianxin, QING Sude, WANG Jingyu, et al., “Hybrid Virtual Network Embedding with Time-oriented Scheduling Policy,” Chinese Journal of Electronics, vol. 22, no. 4, pp. 789-794, 2013,

Citation:

LIAO Jianxin, QING Sude, WANG Jingyu, et al., “Hybrid Virtual Network Embedding with Time-oriented Scheduling Policy,” Chinese Journal of Electronics, vol. 22, no. 4, pp. 789-794, 2013,

LIAO Jianxin, QING Sude, WANG Jingyu, et al., “Hybrid Virtual Network Embedding with Time-oriented Scheduling Policy,” Chinese Journal of Electronics, vol. 22, no. 4, pp. 789-794, 2013,

Citation:

LIAO Jianxin, QING Sude, WANG Jingyu, et al., “Hybrid Virtual Network Embedding with Time-oriented Scheduling Policy,” Chinese Journal of Electronics, vol. 22, no. 4, pp. 789-794, 2013,

PDF( 258 KB)

Hybrid Virtual Network Embedding with Time-oriented Scheduling Policy

1.
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China;
2.
Eastcom-BUPT Information Technology Company, Limited, Beijing 100191, China

Funds: This work is supported by the National Basic Research Program of China (973 Program) (No.2013CB329102), the National Natural Science Foundation of China (No.61271019, No.61101119, No.61121001, No.61072057, No.60902051), and the Program for Changjiang Scholars and Innovative Research Team in University (No.IRT1049).

Received Date: 2011-08-01
Rev Recd Date: 2013-01-01
Publish Date: 2013-09-25

Abstract

Abstract

Network virtualization provides a powerful tool to allow multiple networks, each customized to a specific purpose, to run on a shared substrate. However, a big challenge is how to map multiple virtual networks onto specific nodes and links in the shared substrate network, known as virtual network embedding problem. Previous works in virtual network embedding can be decomposed to two classes: two-stage virtual network embedding and onestage virtual network embedding. In this paper, by pruning the topology of virtual network using k-core decomposition, a hybrid virtual network embedding algorithm, with consideration of location constraints, is proposed to leverage the respective advantage of the two kinds of algorithm simultaneously in the mapping process. In addition, a time-oriented scheduling policy is introduced to improve the mapping performance. We conduct extensive simulations and the results show that the proposed algorithm has better performance in the long-term run.
- Network virtualization,
- Virtual network embedding,
- k-core decomposition,
- Earliest-deadline-first scheduling

FullText(HTML)

References(18)

References

N.M.M.K. Chowdhury, R. Boutaba, “Network virtualization:s tate of the art and research challenges”, IEEE CommunicationsM agazine, Vol.47, No.7, pp.20-26, 2009.

Y. Zhou, Y. Li, L. Su, D. Jin, L. Zeng, “Research of networki nnovation experimental environment based on network virtualization”,A cta Electronica Sinica, Vol.40, No.11, pp.2152-2157,2 012. (in Chinese)

S.D. Qing, J.X. Liao, X.M. Zhu, J.Y. Wang, Q. Qi, “Virtualn etwork embedding algorithms in the network virtualization environment”,J ournal of Software, Vol.23, No.11, pp.3045-3058,2 012. (in Chinese)

J.X. Liao, J.Y. Wang, B. Wu, W. Wu, “Toward a multiplanef ramework of NGSON: A required guideline to achieve pervasives ervices and efficient resource utilization”, IEEE CommunicationsM agazine, Vol.50, No.1, pp.90-97, 2012.

J. Lischka, H. Karl, “A virtual network mapping algorithmb ased on subgraph isomorphism detection”, Proc. of VISA,B arcelona, Spain, pp.81-88, 2009.

I. Houidi, W. Louati, D. Zeghlache, “A distributed virtual networkm apping algorithm”, Proc. of IEEE ICC, Beijing, China,p p.5634-5640, 2008.

J. Fan, M. Ammar, “Dynamic topology configuration in serviceo verlay networks: A study of reconfiguration policies”, Proc. ofI EEE INFOCOM, Barcelona, Spain, pp.1-16, 2006.

J. Lu, J. Turner, “Efficient mapping of virtual networks ontoa shared substrate”, Washington University, Technical ReportW UCSE-2006-35, 2006.

Y. Zhu, M. Ammar, “Algorithms for assigning substrate net work resources to virtual network components”, Proc. of IEEEI NFOCOM, Barcelona, Spain, pp.1-12, 2006.

M. Yu, Y. Yi, J. Rexford, M. Chiang, “Rethinking virtual networke mbedding: Substrate support for path splitting and migration”,A CM SIGCOMM Computer Communication Review,Vol.38, No.2, pp.17-29, 2008.

N.M.M.K. Chowdhury, M.R. Rahman, R. Boutaba, “Virtualn etwork embedding with coordinated node and link mapping”, Proc. of IEEE INFOCOM, Rio de Janeiro, Brazil, pp.783-791,2 009.

X. Cheng, S. Su, F. Yang et al., “Virtual network embeddingt hrough topology-aware node ranking”, ACM SIGCOMM Computer Communication Review, Vol.41, No.2, pp.38-47, 2011.

N. Butt, M. Chowdhury, R. Boutaba, “Topology-awareness and re-optimization mechanism for virtual network embedding”, Proc. of IFI PNetworking, Chennai, India, pp.27-39, 2010.

S.D. Qing, Q. Qi, J.Y.Wang, T. Xu, J.X. Liao, “Topology-awarev irtual network embedding through Bayesian network analysis”, Proc. of IEEE GLOBECOM, California, USA, pp.2645-2651,2 012.

S.D. Qing, J.X. Liao, J.Y. Wang, X.M. Zhu, Q. Qi, “Hybridv irtual network embedding with K-core decomposition andt ime-oriented priority”, Proc. of IEEE ICC, Ottawa, Canada,p p.2728-2732, 2012.

S.N. Dorogovtsev, A.V. Goltsev, J.F.F. Mendes. “K-core organization of complex networks”, Physical Review Letters, Vol.96,N o.4, pp.40-60, 2006.

C.L. Liu, J.W. Layland, “Scheduling algorithms for multiprogrammingi n a hard-real-time environment”, Journal of theA CM, Vol.20, No.1, pp.46-61, 1973.

J. Liao, J. Wang, T. Li, X. Zhu, “Introducing multipath selectionf or concurrent multipath transfer in the future internet”, Computer Networks, Vol.55, No.4, pp.1024-1035, 2011.

Relative Articles

Supplements(0)

Cited By

Proportional views