ViNEYard: Virtual network embedding algorithms with coordinated node and link mapping

IEEE/ACM Transactions on Networking

Volumn 20, Issue 1, 2012, Pages 206-219

  Chowdhury, Mosharaf ^a   Rahman, Muntasir Raihan ^b   Boutaba, Raouf ^c,d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b University of Illinois at Urbana Champaign   (United States)

^c UNIVERSITY OF WATERLOO   (Canada)

^d Pohang University of Science and Technology (POSTECH)   (South Korea)

Author keywords

Heuristics; Network virtualization; Online algorithms; Optimization; Resource allocation; Virtual network embedding

Indexed keywords

ACCEPTANCE RATIO; EMBEDDING ALGORITHMS; EMBEDDING PROBLEMS; HEURISTICS; INTEGER CONSTRAINTS; LINEAR PROGRAMS; LOOK-AHEAD; MIXED-INTEGER PROGRAMS; NETWORK VIRTUALIZATION; NODE MAPPING; NP-HARD; ON-LINE ALGORITHMS; RANDOMIZED ROUNDING; SHARED INFRASTRUCTURE; SIMULATION EXPERIMENTS; SUBSTRATE NETWORKS; VIRTUAL LINK; VIRTUAL NETWORKS; VIRTUAL NODE; WINDOW-BASED;

DISTRIBUTED COMPUTER SYSTEMS; ECONOMICS; INTEGER PROGRAMMING; MAPPING; OPTIMIZATION; RESOURCE ALLOCATION; VIRTUAL REALITY;

HEURISTIC ALGORITHMS;

EID: 84857355987     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2011.2159308     Document Type: Article

References (39)

1. N. M. M. K. Chowdhury, M. R. Rahman, and R. Boutaba, "Virtual network embedding with coordinated node and link mapping," in Proc. IEEE INFOCOM, Apr. 2009, pp. 783-791.
2. T. Anderson, L. Peterson, S. Shenker, and J. Turner, "Overcoming the internet impasse through virtualization," Computer, vol. 38, no. 4, pp. 34-41, 2005. (Pubitemid 40608424)
3. J. Turner and D. Taylor, "Diversifying the internet," in Proc. IEEE GLOBECOM, 2005, vol. 2, pp. 755-760. (Pubitemid 46171236)
4. N. Feamster, L.Gao, and J. Rexford, "Howto lease the internet in your spare time," Comput. Commun. Rev., vol. 37, no. 1, pp. 61-64, 2007.
5. N. M. M. K. Chowdhury and R. Boutaba, "A survey of network virtualization," Comput. Netw., vol. 54, no. 5, pp. 862-876, 2010.
6. "GENI:Global environment for network innovations," Online.Available: http://www.geni.net/
7. A. Bavier, N. Feamster, M. Huang, L. Peterson, and J. Rexford, "In VINI veritas: Realistic and controlled network experimentation," in Proc. ACM SIGCOMM, 2006, pp. 3-14. (Pubitemid 44623711)
8. D. Andersen, "Theoretical approaches to node assignment," 2002 Online. Available: http://www.cs.cmu.edu/-dga/papers/andersenassign. ps
9. J. Kleinberg, "Approximation algorithms for disjoint paths problems," Ph.D. dissertation, MIT, Cambridge, MA, 1996.
10. S. Kolliopoulos and C. Stein, "Improved approximation algorithms for unsplittable flow problems," in Proc. IEEE FOCS, 1997, pp. 426-435.
11. J. Fan and M. Ammar, "Dynamic topology configuration in service overlay networks-A study of reconfiguration policies," in Proc. IEEE INFOCOM, 2006, pp. 1-12.
12. J. Lu and J. Turner, "Efficient mapping of virtual networks onto a shared substrate," Washington University, Seattle, WA, Tech. Rep. WUCSE-2006-35, 2006.
13. Y. Zhu and M. Ammar, "Algorithms for assigning substrate network resources to virtual network components," in Proc. IEEE INFOCOM, 2006, pp. 1-12.
14. M. Yu, Y. Yi, J. Rexford, and M. Chiang, "Rethinking virtual network embedding: Substrate support for path splitting and migration," Comput. Commun. Rev., vol. 38, no. 2, pp. 17-29, Apr. 2008.
15. A. Schrijver, Theory of Linear and Integer Programming. NewYork: Wiley, 1986.
16. W. Szeto, Y. Iraqi, and R. Boutaba, "A multi-commodity flow based approach to virtual network resource allocation," in Proc. IEEE GLOBECOM, 2003, pp. 3004-3008.
17. D. Eppstein, "Finding the shortest paths," SIAM J. Comput., vol. 28, no. 2, pp. 652-673, 1998.
18. N. Karmarkar, "A new polynomial-time algorithm for linear programming," in Proc. ACM STOC, 1984, pp. 302-311.
19. "GNU linear programming kit," Free Software Foundation, Boston, MA, 2008 Online. Available: http://www.gnu.org/software/glpk/
20. E. Zegura, K. Calvert, and S. Bhattacharjee, "How to model an internetwork," in Proc. IEEE INFOCOM, 1996, pp. 594-602.
21. R. Jain, The Art of Computer Systems Performance Analysis. New York: Wiley, 1991.
22. 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. Norwell, MA: Kluwer, 2001, pp. 255-312.
23. S. Albers, "On the influence of lookahead in competitive paging algorithms," Algorithmica, vol. 18, no. 3, pp. 283-305, 1997.
24. E. F.Grove, "Online bin packing with lookahead," in Proc. ACM-SIAM SODA, 1995, pp. 430-436.
25. J.-Y. Le Boudec and P. Thiran, Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Berlin, Germany: Springer-Verlag, 2001.
26. A. Gupta, J. M. Kleinberg, A. Kumar, R. Rastogi, and B. Yener, "Provisioning a virtual private network: A network design problem formulticommodity flow," in Proc. ACM STOC, 2001, pp. 389-398. (Pubitemid 32865755)
27. N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. K. Ramakrishnan, and J. E. van der Merwe, "Resource management with hoses: Point-to-cloud services for virtual private networks," IEEE/ACM Trans. Netw., vol. 10, no. 5, pp. 679-692, Oct. 2002. (Pubitemid 35312145)
28. S. Raghunath, K. K. Ramakrishnan, S. Kalyanaraman, and C. Chase, "Measurement based characterization and provisioning of IP VPNs," in Proc. ACM IMC, 2004, pp. 342-355. (Pubitemid 40372062)
29. R. Ricci, C. Alfeld, and J. Lepreau, "A solver for the network testbed mapping problem," Comput. Commun. Rev., vol. 33, no. 2, pp. 65-81, Apr. 2003.
30. M. Hibler, R. Ricci, L. Stoller, J. Duerig, S. Guruprasad, T. Stack, K. Webb, and J. Lepreau, "Large-scale virtualization in the Emulab network testbed," in Proc. USENIX ATC, 2008, pp. 113-128.
31. J. Lischka and H. Karl, "A virtual network mapping algorithm based on subgraph isomorphism detection," in Proc. ACM VISA, 2009, pp. 81-88.
32. I. Houidi,W. Louati, and D. Zeghlache, "A distributed virtual network mapping algorithm," in Proc. IEEE ICC, 2008, pp. 5634-5640.
33. M. R. Rahman, I. Aib, and R. Boutaba, "Survivable virtual network embedding," in Proc. IFIP Netw., 2010, pp. 40-52.
34. W.-L. Yeow, C. Westphal, and U. Kozat, "Designing and embedding reliable virtual infrastructures," in Proc. ACM VISA, 2010, pp. 33-40.
35. N. F. Butt, M. Chowdhury, and R. Boutaba, "Topology-awareness and reoptimization mechanism for virtual network embedding," in Proc. IFIP Netw., 2010, pp. 27-39.
36. A. Kumar, R. Rastogi, A. Silberschatz, and B. Yener, "Algorithms for provisioning virtual private networks in the hose model," IEEE/ACM Trans. Netw., vol. 10, no. 4, pp. 565-578, Aug. 2002. (Pubitemid 35000398)
37. 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.
38. S. Albers, "A competitive analysis of the list update problem with lookahead," Theor. Comput. Sci., vol. 197, no. 1-2, pp. 95-109, 1998. (Pubitemid 128459966)
39. M. Chowdhury, F. Samuel, and R. Boutaba, "PolyViNE: Policy-based virtual network embedding across multiple domains," in Proc. ACM VISA, 2010, pp. 49-56.