Robust Dynamical Virtual Network Provisioning

ZHANG Min; WU Chunming; HANG Yue; YANG Qiang; WANG Bin; JIANG Ming

Article Contents

Article Navigation > Chinese Journal of Electronics > 2013 > 22(1): 151-154

ZHANG Min, WU Chunming, HANG Yue, et al., “Robust Dynamical Virtual Network Provisioning,” Chinese Journal of Electronics, vol. 22, no. 1, pp. 151-154, 2013,

Citation:

ZHANG Min, WU Chunming, HANG Yue, et al., “Robust Dynamical Virtual Network Provisioning,” Chinese Journal of Electronics, vol. 22, no. 1, pp. 151-154, 2013,

ZHANG Min, WU Chunming, HANG Yue, et al., “Robust Dynamical Virtual Network Provisioning,” Chinese Journal of Electronics, vol. 22, no. 1, pp. 151-154, 2013,

Citation:

ZHANG Min, WU Chunming, HANG Yue, et al., “Robust Dynamical Virtual Network Provisioning,” Chinese Journal of Electronics, vol. 22, no. 1, pp. 151-154, 2013,

PDF( 203 KB)

Robust Dynamical Virtual Network Provisioning

1.
College of Computer Science and Technology, Zhejiang University, Hangzhou 310027, China;
2.
College of Computer Science, Hangzhou Dianzi University, Hangzhou 310037, China;
3.
Department 66377, Beijing 100041, China;
4.
College of Electrical Engineering, Zhejiang University, Hangzhou 310027, China

Funds: This work is supported in part by the National Basic Research Program of China (973 Program) (No.2012CB315903), the National Natural Science Foundation of China (No.61070157, No.61103200), the Zhejiang Provincial Natural Science Foundation of China (No.Y1111192).

Received Date: 2011-12-01
Rev Recd Date: 2012-03-01
Publish Date: 2013-01-05

Abstract

Abstract

Multiple virtual networks (VNs) sharing an underlying substrate network is considered a promising tool to diversify and reshape the future inter-networking paradigm. In this paper, based on the robust optimization theory, a robust dynamic approach is presented, which periodically identifies bandwidth allocation to VNs to work reasonable well for a range of traffic patterns over a period of time, rather than certain traffic pattern instance. This problem is formulated as a robust optimization problem using path-flow model aiming to compute the minimumcost bandwidth allocation, and a distributed algorithm is proposed by using the primal decomposition method. The numerical result obtained from simulation experiments demonstrates the strength and the effectiveness of the proposed algorithm.
- Network virtualization,
- Virtual network provisioning,
- Bandwidth allocation,
- Robust optimization

FullText(HTML)

References(15)

References

G. Eason, B. Noble and I.N. Sneddon, “Network virtualization:A view from the bottom”, Proc. of the 1st ACM Workshopon Virtualized Infrastructure Systems and Architectures, NewYork, NY, USA, pp.73-80, 2009.

Y. Zhu, M. Ammar, “Algorithms for assigning substrate networkresources to virtual network components”, Proc. of IEEEINFOCOM, Barcelona, Catalonia, Spain, pp.1-12, 2006.

M. Yu, Y. Yi, J. Rexford et al., “Rethinking virtual network embedding:substrate support for path splitting and migration”,ACM SIGCOMM Computer Communication Review, Vol.38,No.2, pp.17-29, 2008.

N.M. Mosharaf, K. Chowdhury et al., “Virtual network embeddingwith coordinated node and link mapping”, Proc. of IEEEINFOCOM, Rio de Janeiro, Brazil, pp.783-791, 2009.

J. Lischka, H. Karl, “A virtual network mapping algorithmbased on subgraph isomorphism detection”, Proc. of ACM SIGCOMM,Barcelona, Spain, pp.81-88, 2009.

Cheng Xiang et al., “Virtual network embedding based onparticle swarm optimization”, Acta Electronica Sinica, Vol.39,No.10, pp.2240-2244, 2011. (in Chinese)

Jiang Ming et al., “Research on network virtualization andvirtual network mapping algorithm”, Acta Electronica Sinica,Vol.39, No.6, pp.1315-1320, 2011. (in Chinese)

J. He et al., “Davinci: Dynamically adaptive virtual networksfor a customized internet”, Proceedings of the ACM CoNEXT,Madrid, Spain, pp.1-12, 2008.

N.G. Duffield et al., “A flexible model for resource managementin virtual private networks”, ACM SIGCOMM Computer CommunicationReview, Vol.29, No.4, pp.95-108, 1999.

T. Erlebach, M. Ruegg, “Optimal bandwidth reservation inhose-model VPNs with multip-path routing”, Proceedings ofIEEE INFOCOM, Hong Kong, pp.2275-2282, 2004.

A. Altin et al., “OSPF routing with optimal oblivious performanceratio under polyhedral demand uncertainty”, Optim.Engrg., Vol.11, pp.395-422, 2010.

V. Tabatabaee et al., “Robust routing with unknown traffic matrices”,Proc. of IEEE INFOCOM, Anchorage, Alaska, USA,pp.2436-2440, 2007.

G. Box, G. Jenkins, G. Reinsel, Time Series Analysis, Forecastingand Control, third ed., Prentice-Hall, 1994.

N. Spring, R. Mahajan, D. Wetherall, T. Anderson, “MeasuringISP topologies with rocketfuel”, IEEE/ACM Transcationon Networking, Vol.12, No.1, pp.2-16, 2004.

WITS: Waikato Internet Traffic Storage, Available athttp://wand.net.nz/wits/

Relative Articles

Supplements(0)

Cited By

Proportional views