Virtual network embedding with coordinated node and link mapping

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 783-791

  Mosharaf, N M ^a   Chowdhury, Kabir ^a   Rahman, Muntasir Raihan ^a   Boutaba, Raouf ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ACCEPTANCE RATIO; EMBEDDING ALGORITHMS; EMBEDDING PROBLEMS; INTEGER CONSTRAINTS; LINEAR PROGRAMS; MIXED-INTEGER PROGRAMS; NETWORK VIRTUALIZATION; NODE MAPPING; NP-HARD; RANDOMIZED ROUNDING; SHARED INFRASTRUCTURE; SIMULATION EXPERIMENTS; SUBSTRATE NETWORKS; TWO PHASIS; VIRTUAL LINK; VIRTUAL NETWORKS; VIRTUAL NODE;

COMPUTATIONAL COMPLEXITY; DISTRIBUTED COMPUTER SYSTEMS; HETEROGENEOUS NETWORKS; HEURISTIC ALGORITHMS; INTEGER PROGRAMMING; MAPPING; SUBSTRATES;

COMPUTER SIMULATION;

EID: 70349682522     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5061987     Document Type: Conference Paper

References (20)

1. T. Anderson, L. Peterson, S. Shenker, and J. Turner, "Overcoming the Internet impasse through virtualization," Computer, vol. 38, no. 4, pp. 34-41, 2005.
2. J. Turner and D. Taylor, "Diversifying the Internet," in IEEE GLOBECOM, vol. 2, 2005.
3. A. Bavier, N. Feamster, M. Huang, L. Peterson, and J. Rexford, "In VINI veritas: Realistic and controlled network experimentation," in Proceedings of SIGCOMM, 2006, pp. 3-14.
4. N. Feamster, L. Gao, and J. Rexford, "How to lease the Internet in your spare time," ACM SIGCOMM Computer Communication Review, vol. 37, no. 1, pp. 61-64, 2007.
5. D. Andersen, "Theoretical approaches to node assignment," Unpublished Manuscript, http://www.cs.cmu.edu/~dga/papers/andersen-assign.ps, 2002.
6. J. Fan and M. Ammar, "Dynamic topology configuration in service overlay networks - a study of reconfiguration policies," in Proceedings of IEEE INFOCOM, 2006.
7. J. Lu and J. Turner, "Efficient mapping of virtual networks onto a shared substrate," Washington University, Tech. Rep. WUCSE-2006-35, 2006.
8. Y. Zhu and M. Ammar, "Algorithms for assigning substrate network resources to virtual network components," in Proceedings of IEEE INFOCOM, 2006.
9. 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.
10. A. Schrijver, Theory of linear and integer programming. NewYork, NY, USA: John Wiley & Sons, Inc., 1986.
11. W. Szeto, Y. Iraqi, and R. Boutaba, "A multi-commodity flow based approach to virtual network resource allocation," in Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM'03), 2003, pp. 3004-3008.
12. 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.
13. 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.
14. I. Houidi, W. Louati, and D. Zeghlache, "A distributed virtual network mapping algorithm," in Proceedings of IEEE ICC, 2008, pp. 5634-5640.
15. A. Kumar, R. Rastogi, A. Silberschatz, and B. Yener, "Algorithms for provisioning virtual private networks in the hose model," IEEE/ACM Transactions on Networking, vol. 10, no. 4, pp. 565-578, 2002.
16. P. Raghavan and C. D. Tompson, "Randomized rounding: a technique for provably good algorithms and algorithmic proofs," Combinatorica, vol. 7, no. 4, pp. 365-374, 1987.
17. "ViNE-Yard," http://www.mosharaf.com/ViNE-Yard.tar.gz.
18. E. Zegura, K. Calvert, and S. Bhattacharjee, "How to model an Internetwork," in Proceedings of IEEE INFOCOM, 1996, pp. 594-602.
19. "GNU Linear Programming Kit," http://www.gnu.org/software/glpk/ .
20. M. Mitzenmacher, A. W. Richa, and R. Sitaraman, "The power of two random choices: A survey of techniques and results," in Handbook of Randomized Computing. Kluwer Academic Press, 2001, pp. 255-312.