Resilient virtual network service provision in Network Virtualization environments

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

Volumn , Issue , 2010, Pages 51-58

  Chen, Yang ^a   Li, Jianxin ^a   Wo, Tianyu ^a   Hu, Chunming ^a   Liu, Wantao ^a  

^a BEIHANG UNIVERSITY   (China)

Author keywords

Network Virtualization; Resiliency; Resource allocation; Virtual network service; Virutal network mapping

Indexed keywords

AS-LINKS; CRITICAL ISSUES; INTELLIGENT BANDWIDTH; MAPPING SCHEME; NETWORK FAILURE; NETWORK RESOURCE; NETWORK VIRTUALIZATION; RESILIENCY; RESOURCE ALLOCATION ALGORITHMS; RESTORATION PATHS; SERVICE RESOURCES; STRICT CONSTRAINT; SUBSTRATE NETWORKS; VIRTUAL NETWORK SERVICES; VIRUTAL NETWORK MAPPING;

ALGORITHMS; BANDWIDTH; MAPPING; RESOURCE ALLOCATION; RESTORATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 79951745570     PISSN: 15219097     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPADS.2010.26     Document Type: Conference Paper

References (23)

1. T. Anderson, L. Peterson, S. Shenker, and J. Turner, "Overcoming the Internet impasse through virtualization," IEEE Computer Magazine, 38(4):34-41, 2005. (Pubitemid 40608424)
2. G. Iannaccone, C. Chuah, R. Mortier, S. Bhattacharyya, and C. Dint, "Analysis of link failures in an IP hackhone," in Proceedings of ACM SIGCOMM Internet Mensurenient Workshop 2002. Marseille, France, Nov 2002.
3. A. Markopulou, G. Iannaccone, S. Bhattacharyya, C. Chuah, and C. Diot, "Characterization of failures In an IP backbone," in Proceeding of INFOCOM, March 2004.
4. N. Feamster, L. Gao, and J. Rexford, "How to lease the Internet in your spare time," ACM Computer Communication Review, 37(1):61- 64, 2007.
5. M. Kodialam and T. V. Lakshman," Dynamic Routing for Restorable Bandwidth-guaranteed Tunnels Using Aggregated Network Resource Usage Information," In Proc. of INFOCOM 2000, Tel-Aviv, Israel, March 2000.
6. Lau, W.; Jha, S.;, "Failure-oriented path restoration algorithm for survivable networks," Network Operations and Management Symposium, 2004. NOMS 2004. IEEE/IFIP, vol.1, no., pp.205-218 Vol.1, 23-23 April 2004.
7. E. Zegura, K. Calvert, and S. Bhattacharjee, "How to model an Internetwork," in Proceedings of IEEE INFOCOM, 1996, pp. 594-602.
8. M. Yu, Y. Yi, J. Rexford, and M. Chiang, "Rethinking virtual network embedding: Substrate support for path splitting and migration," ACM SIGCOMM Computer Communication Review, vol. 38, no. 2, pp. 17-29, April 2008.
9. N. Chowdhury, M. Rahman, and R. Boutaba, Virtual network embedding with coordinated node and link mapping," in IEEE INFOCOM, April 2009, pp. 783-791.
10. J. Lischka and H. Karl, A virtual network mapping algorithm based on subgraph isomorphism detection," in Proceedings of ACM SIGCOMM VISA, 2009.
11. Y. Zhu and M. Ammar, "Algorithms for assigning substrate network resources to virtual network components," in Proceedings of IEEE INFOCOM, 2006.
12. Cui Weidong, Ion Stoica, Randy H. Katz, "Backup Path Allocation Based On A Correlated Link Failure Probability Model In Overlay Networks," Proc. of 10th IEEE Intl. Conf. on Network Protocols, pp. 236-245, 2002.
13. J. Turner and D. Taylor, "Diversifying the Internet," in IEEE GLOBECOM, vol. 2, 2005.
14. D. Andersen, H. Balakrishnan, F. Kaashoek, and R. Morris, "Resilient overlay networks," In Proc. of SOSP 2001, October 2001.
15. M. Rahman, Issam Aib, and R. Boutaba, Survivable Virtual Network Embedding, With Issam Aib, Raouf Boutaba, to appear in IFIP/TC6 NETWORKING, 12 pages, Chennai, India, May 2010.
16. A. Gupta, J. M. Kleinberg, A. Kumar, R. Rastogi, and B. Yener, "Provisioning a virtual private network: A network design problem for multicommodity flow," in Proceedings of ACM STOC, 2001, pp. 389-398. (Pubitemid 32865755)
17. R. Ricci, C. Alfeld, and J. Lepreau, "A solver for the network testbed mapping problem," ACM SIGCOMM Computer Communication Review, vol. 33, no. 2, pp. 65-81, April 2003.
18. K. Lee and E. Modiano, Cross-layer survivability in wdm-based networks," in INFOCOM 2009, IEEE, April 2009, pp. 1017-1025.
19. J. W. Suurballe and R. E. Tarjan, "A quick method for finding shortest pairs of disjoint paths," Networks, vol. 14, pp. 325-336, 1984. (Pubitemid 14589465)
20. D. Andersen, "Theoretical approaches to node assignment," Unpublished, http://www.cs.cmu.edu/̃dga/papers/andersen-assign.ps 2002.
21. S. G. Kolliopoulos and C. Stein, "Improved approximation algorithms for unsplittable flow problems," In Proc. IEEE Symposium on Foundations of Computer Science, 1997.
22. Yang Chen, Tianyu Wo, Jianxin Li, "An Efficient Resource Management System for On-line Virtual Cluster Provision," 2009 IEEE International Conference on Clound Computing, Bangalore, India, Spe. 21-25, 2009, 71-79.
23. J. Huai, et al. "CIVIC: a Hypervisor based Virtual Computing Environment," In International Conference on Parallel Processing Workshops 2007, 10-14 Sept. 2007 Page(s):51-51.