FELL: A flexible virtual network embedding algorithm with guaranteed load balancing

IEEE International Conference on Communications

Volumn , Issue , 2011, Pages

  Zhang, Sheng ^a   Qian, Zhuzhong ^a   Guo, Song ^b   Lu, Sanglu ^a  

^a NANJING UNIVERSITY   (China)

^b UNIVERSITY OF AIZU   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AVAILABLE BANDWIDTH; CHANGING PARAMETER; COST CRITERIA; DESIGN ISSUES; EMBEDDING ALGORITHMS; EMBEDDING PROCESS; HEURISTIC APPROACH; NETWORK VIRTUALIZATION; NP-HARDNESS; RESOURCE UTILIZATIONS; RUNNING TIME; SPLITTABLE FLOWS; SUBSTRATE NETWORKS; VIRTUAL NETWORKS;

ALGORITHMS; BANDWIDTH; DESIGN; HEURISTIC METHODS; PROFITABILITY; SIMULATED ANNEALING;

PARALLEL ARCHITECTURES;

EID: 80052144076     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icc.2011.5962960     Document Type: Conference Paper

References (26)

1. J. Turner and D. Taylor, "Diversifying the internet," in IEEE GLOBECOM 2005, vol. 2, 2-2 2005, pp. 6 pp. -760.
2. N. M. M. K. Chowdhury and R. Boutaba, "A survey of network virtualization," Computer Networks, vol. 54, no. 5, pp. 862-876, 2010.
3. N. Feamster, L.-X. Gao, and J. Rexford, "How to lease the internet in your spare time," SIGCOMM Comput. Commun. Rev., vol. 37, no. 1, pp. 61-64, 2007.
4. J. Lu and J. Turner, "Efficient mapping of virtual networks onto a shared substrate," Washington University, Tech. Rep. WUCSE-2006-35, 2006.
5. 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.
6. PlanetLab, "http://www.planet-lab.org/."
7. VINI, "http://www.vini-veritas.net/."
8. D. G. Andersen, "Theoretical approaches to node assignment," Dec. 2002, unpublished Manuscript.
9. R. Ricci, C. Alfeld, and J. Lepreau, "A solver for the network testbed mapping problem," SIGCOMM Comput. Commun. Rev., vol. 33, no. 2, pp. 65-81, 2003.
10. J. Fan and M. H. Ammar, "Dynamic topology configuration in service overlay networks: A study of reconfiguration policies," in IEEE INFOCOM 2006, april 2006, pp. 1-12.
11. Y. Zhu and M. Ammar, "Algorithms for assigning substrate network resources to virtual network components," in IEEE INFOCOM 2006, april 2006, pp. 1-12.
12. M. Yu, Y. Yi, J. Rexford, and M. Chiang, "Rethinking virtual network embedding: substrate support for path splitting and migration," SIGCOMM Comput. Commun. Rev., vol. 38, no. 2, pp. 17-29, 2008.
13. J. Lischka and H. Karl, "A virtual network mapping algorithm based on subgraph isomorphism detection," in ACM VISA 2009. New York, NY, USA: ACM, 2009, pp. 81-88.
14. 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.
15. 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.
16. I. Houidi, W. Louati, and D. Zeghlache, "A distributed virtual network mapping algorithm," in IEEE ICC 2008, 19-23 2008, pp. 5634-5640.
17. S. Kirkpatrick, "Optimization by simmulated annealing: quantitative studies," Journal of Statistical Physics, vol. 34(5/6), pp. 975-986, 1984.
18. J.-C. Chen and S.-H. Chan, "Multipath routing for video unicast over bandwidth-limited networks," in IEEE GLOBECOM 2001, vol. 3, 2001, pp. 1963-1967 vol.3.
19. X. Chen, M. Chamania, A. Jukan, A. Drummond, and N. da Fonseca, "Qos-constrained multi-path routing for high-end network applications,"in IEEE INFOCOM Workshops 2009, 19-25 2009, pp. 1-6.
20. T. Anjali, A. Fortin, G. Calinescu, S. Kapoor, N. Kirubanandan, and S. Tongngam, "Multipath network flows: Bounded buffers and jitter," in IEEE INFOCOM 2010, 14-19 2010, pp. 1-7.
21. W. Zhang, J. Tang, C. Wang, and S. de Soysa, "Reliable adaptive multipath provisioning with bandwidth and differential delay constraints," in IEEE INFOCOM 2010, 14-19 2010, pp. 1-9.
22. I. H. Osman, "Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem," Ann. Oper. Res., vol. 41, no. 1-4, pp. 421-451, 1993.
23. A. Anagnostopoulos, L. Michel, P. V. Hentenryck, and Y. Vergados, "A simulated annealing approach to the travelling tournament problem," in IJCAI, 2003, pp. 1357-1358.
24. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. The MIT Press, September 2001.
25. R. Draves, J. Padhye, and B. Zill, "Routing in multi-radio, multi-hop wireless mesh networks," in ACM MOBICOM 2004. New York, NY, USA: ACM, 2004, pp. 114-128.
26. E. Zegura, K. Calvert, and S. Bhattacharjee, "How to model an internetwork,"in IEEE INFOCOM 1996, vol. 2, 24-28 1996, pp. 594-602 vol.2.