Algorithms for Assigning Substrate Network Resources to Virtual Network Components
Top Cited Papers
- 1 January 2006
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
Abstract
Recent proposals for network virtualization provide a promising way to overcome the Internet ossification. The key idea of network virtualization is to build a diversified Internet to support a variety of network services and architectures through a shared substrate. A major challenge in network virtualization is the assigning of substrate resources to virtual networks (VN) efficiently and on-demand. This paper focuses on two versions of the VN assignment problem: VN assignment without reconfigu- ration (VNA-I) and VN assignment with reconfiguration ( VNA- II). For the VNA-I problem, we develop a basic scheme as a building block for all other advanced algorithms. Subdividing heuristics and adaptive optimization strategies are then presented to further improve the performance. For the VNA-II problem, we develop a selective VN reconfiguration scheme that prioritizes the reconfiguration of the most critical VNs. Extensive simulation ex- periments demonstrate that the proposed algorithms can achieve good performance under a wide range of network conditions.Keywords
This publication has 10 references indexed in Scilit:
- A multi-commodity flow based approach to virtual network resource allocationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- How to model an internetworkPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Improved approximation algorithms for unsplittable flow problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Provisioning a virtual private networkPublished by Association for Computing Machinery (ACM) ,2001
- The cache location problemIEEE/ACM Transactions on Networking, 2000
- A taxonomy of rerouting in circuit-switched networksIEEE Communications Magazine, 1999
- Selection algorithms for replicated Web serversACM SIGMETRICS Performance Evaluation Review, 1998
- Online load balancing of temporary tasksLecture Notes in Computer Science, 1993
- On-line load balancingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- Provably good routing in graphs: regular arraysPublished by Association for Computing Machinery (ACM) ,1985