Resilient Virtual Network Service Provision in Network Virtualization Environments
Authors:
- Yang ChenYCYang Chen
- Jianxin LiJLJianxin Li
- Tianyu WoTWTianyu Wo
- Chunming HuCHChunming Hu
- Wantao LiuWLWantao Liu
- 1 December 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15219097,p. 51-58
Abstract
Network Virtualization has recently emerged to provide scalable, customized and on-demand virtual network services over a shared substrate network. How to provide VN services with resiliency guarantees against network failures has become a critical issue, meanwhile the service resource usages should be minimized under the strict constraints such as link bandwidth capability and service resiliency guarantees etc. In this paper, we present a resource allocation algorithm to balance the tradeoff between service resource consumptions and service resiliency. By exploiting a heuristic VN mapping scheme and a restoration path selection scheme based on intelligent bandwidth sharing, the algorithm simultaneously makes cost-effective usage of network resources and protects VN services against network failures. We perform evaluations and find that the algorithm is near optimal in terms of network resource usage, especially the additional restoration bandwidth cost for resiliency protection.Keywords
This publication has 20 references indexed in Scilit:
- Rethinking virtual network embeddingACM SIGCOMM Computer Communication Review, 2008
- CIVIC: a Hypervisor based Virtual Computing Environment2007
- How to lease the internet in your spare timeACM SIGCOMM Computer Communication Review, 2007
- Failure-oriented path restoration algorithm for survivable networks2004
- Backup path allocation based on a correlated link failure probability model in overlay networks2003
- A solver for the network testbed mapping problemACM SIGCOMM Computer Communication Review, 2003
- How to model an internetwork2002
- Improved approximation algorithms for unsplittable flow problems2002
- Resilient overlay networks2001
- A quick method for finding shortest pairs of disjoint pathsNetworks, 1984