Algorithms for assigning substrate network resources to virtual network components

Proceedings - IEEE INFOCOM

Volumn , Issue , 2006, Pages

  Zhu, Yong ^a   Ammar, Mostafa ^a  

^a GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NETWORK RESOURCES; VIRTUAL NETWORK COMPONENTS;

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER SIMULATION; INTERNET PROTOCOLS; OPTIMIZATION; PROBLEM SOLVING;

COMPUTER NETWORKS;

EID: 39049102574     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFOCOM.2006.322     Document Type: Conference Paper

References (19)

1. L. Peterson, S. Shenker, and J. Turner, "Overcoming the Internet impasse through virtualization," in Proc. ACM Workshop on Hot Topics in Networks (HotNets), 2004.
2. D. Taylor and J. Turner, "Towards a diversified internet," November 2004.
3. A. Gupta, J. Kleinberg, A. Kumar, R. Rastogi, and B. Yener, "Provisioning a virtual private network: a network design problem for multicommodity flow," in Proc. ACM symposium on Theory of computing (STOC), 2001, pp. 389-398.
4. A. Haque and P.-H. Ho, "Design of survivable optical virtual private networks (O-VPNs)," in Proc. the 1st IEEE International Workshop on Provisioning and Transport for Hybrid Networks, 2004.
5. W. Szeto, Y. Iraqi, and R. Boutaba, "A multi-commodity flow based approach to virtual network resource allocation," in Proc. GLOBECOM: IEEE Global Telecommunications Conference, 2003.
6. Q. Fang, J. Cobb, and E. Leiss, "A pre-selection routing scheme for virtual circuit networks," in Proc. IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS), 2000.
7. Y. Azar, A. Z. Broder, and A. R. Karlin, "On-line load balancing," in Proc. IEEE Symposium Foundations of Computer Science, 1992, pp. 218-225.
8. J. Aspnes, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts, "On-line load balancing with applications to machine scheduling and virtual circuit routing," in Proc. ACM symposium on Theory of computing, 1993, pp. 623-631.
9. Y. Azar, B. Kalyanasundaram, S. A. Plotkin, K. Pruhs, and O. Waarts, "Online load balancing of temporary tasks," in Proc. Workshop on Algorithms and Data Structures, 1993, pp. 119-130.
10. D. Bertsekas and R. Gallager, Data Networks, 2nd ed. Prentice-Hall, 1992.
11. M. Sayal, Y. Breitbart, P. Scheuermann, and R. Vingralek, "Selection algorithms for replicated web servers," SIGMETRICS Perform. Eval. Rev., vol. 26, no. 3, pp. 44-50, 1998.
12. P. Krishnan, D. Raz, and Y. Shavitt, "The cache location problem," IEEE/ACM Trans. Networking, vol. 8, no. 5, pp. 568-582, 2000.
13. S. Shi and J. S. Turner, "Placing servers in overlay networks," in Proc. Symposium on Performance Evaluation of Computer and Telecommuni cation Systems (SPECTS), 2002.
14. P. Raghavan and C. D. Thompson, "Provably good routing in graphs: regular arrays," in Proc. ACM symposium on Theory of computing, 1985, pp. 79-87.
15. J. M. Kleinberg, "Approximation algorithms for disjoint paths problems," Ph.D. dissertation, Massachusetts Institute of Technology, 1996.
16. S. G. Kolliopoulos and C. Stein, "Improved approximation algorithms for unsplittable flow problems," in Proc. IEEE Symposium on Foundations of Computer Science (FOCS), 1997, p. 426.
17. Q. Ma and P. Steenkiste, "On path selection for traffic with bandwidth guarantees," in Proc. IEEE ICNP, 1997, pp. 191-202.
18. E. Wong, A. K. M. Chan, and T.-S. Yum, "A taxonomy of rerouting in circuit-switched networks," IEEE Communications Magazine, vol. 37, no. 11, pp. 568-582, 1999.
19. E. W. Zegura, K. Calvert, and B. Bhattacharjee, "How to model an internetwork," in Proc. IEEE Infocom, 1996.