Opportunistic bandwidth sharing for virtual network mapping

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2011, Pages

  Zhang, Sheng ^a   Qian, Zhuzhong ^a   Tang, Bin ^a   Wu, Jie ^b   Lu, Sanglu ^a  

^a NANJING UNIVERSITY   (China)

^b Temple University   (United States)

Author keywords

Chernoff bound; NP complete; opportunistic bandwidth sharing; virtual network embedding

Indexed keywords

BANDWIDTH RESOURCE; BANDWIDTH SHARING; CHERNOFF BOUNDS; EXTENSIVE SIMULATIONS; NETWORK TRAFFIC; NETWORK VIRTUALIZATION; NP COMPLETE; NP-COMPLETENESS; OPPORTUNISTIC BANDWIDTH SHARING; OPTIMIZATION PROBLEMS; PERFORMANCE GUARANTEES; TIME SLOTS; VIRTUAL LINK; VIRTUAL NETWORKS;

BANDWIDTH; COMMUNICATION; COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC ALGORITHMS;

TELECOMMUNICATION SYSTEMS;

EID: 84863181639     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2011.6133670     Document Type: Conference Paper

References (20)

1. J. Turner and D. Taylor, "Diversifying the Internet," in IEEE GLOBECOM 2005, vol. 2, 2-2 2005, pp. 6 pp. -760.
2. T. Anderson, L. Peterson, S. Shenker, and J. Turner, "Overcoming the Internet impasse through virtualization," Computer, vol. 38, no. 4, pp. 34-41, april 2005. (Pubitemid 40608424)
3. N. Feamster, L.-X. Gao, and J. Rexford, "How to lease the Internet in your spare time," ACM SIGCOMM Comput. Commun. Rev., vol. 37, no. 1, 2007.
4. N. Chowdhury and R. Boutaba, "A survey of network virtualization,"Computer Networks, vol. 54, no. 5, pp. 862-876, 2010.
5. D. G. Andersen, "Theoretical approaches to node assignment," Dec. 2002, unpublished Manuscript.
6. R. Ricci, C. Alfeld, and J. Lepreau, "A solver for the network testbed mapping problem," ACM SIGCOMM Comput. Commun. Rev., vol. 33, no. 2, 2003.
7. Y. Zhu and M. Ammar, "Algorithms for assigning substrate network resources to virtual network components," in IEEE INFOCOM 2006, april 2006, pp. 1-12.
8. N. Chowdhury, M. Rahman, and R. Boutaba, "Virtual network embedding with coordinated node and link mapping," in IEEE INFOCOM 2009, 19-25 2009, pp. 783-791.
9. J. Lu and J. Turner, "Efficient mapping of virtual networks onto a shared substrate," Washington University, Tech. Rep. WUCSE-2006-35, 2006.
10. M. Yu, Y. Yi, J. Rexford, and M. Chiang, "Rethinking virtual network embedding: substrate support for path splitting and migration," ACM SIGCOMM Comput. Commun. Rev., vol. 38, no. 2, 2008.
11. J. Lischka and H. Karl, "A virtual network mapping algorithm based on subgraph isomorphism detection," in ACM VISA 2009. NewYork,NY, USA: ACM, 2009, pp. 81-88.
12. Auckland Data Trace. http://pma.nlanr.net/traces/long/auck2.html.
13. Q. Zhao and B. Sadler, "A survey of dynamic spectrum access," IEEE Signal Processing Magazine, vol. 24, no. 3, pp. 79-89, May 2007.
14. L. Massoulie and J. Roberts, "Bandwidth sharing: objectives and algorithms,"IEEE/ACM TON, vol. 10, no. 3, pp. 320-328, 2002.
15. V. V. Vazirani, Approximation Algorithms. Berlin: Springer, 2003.
16. H. Chernoff, "A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations," Annals of Mathematical Statistics, vol. 23, no. 4, pp. 493-507, 1952.
17. P. C. Gilmore and R. E. Gomory, "A linear programming approach to the cutting-stock problem," Operations Research, vol. 9, 1961.
18. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. The MIT Press, September 2001.
19. Suppl. Materials to Opportunistic Bandwidth Sharing for Virtual Network Mapping. http://cs.nju.edu.cn/dislab/~sheng/resource/suppl.pdf.
20. C. Marquezan, J. Nobre, L. Granville, G. Nunzi, D. Dudkowski, and M. Brunner, "Distributed reallocation scheme for virtual network resources,"in IEEE ICC 2009, 14-18 2009, pp. 1-5.