Service overlay networks: SLAs, QoS and bandwidth provisioning

Proceedings - International Conference on Network Protocols, ICNP

Volumn , Issue , 2008, Pages 334-343

  Duan, Zhenhai ^a   Zhang, Zhi Li ^a   Hou, Yiwei Thomas ^b  

^a University of Minnesota   (United States)

^b State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEPRECIATION; INTERNET TELEPHONY; NETWORK PROTOCOLS; OVERLAY NETWORKS; QUALITY OF SERVICE;

APPROXIMATE SOLUTION; BANDWIDTH PROVISIONING; DYNAMIC BANDWIDTH; END-TO-END SERVICE; INDIVIDUAL NETWORK; SERVICE LEVEL AGREEMENTS; SERVICE OVERLAY NETWORKS; VALUE ADDED SERVICE;

BANDWIDTH;

EID: 84904886875     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2002.1181420     Document Type: Conference Paper

References (17)

1. D. G. Andersen, H. Balakrishnan, M. Kaashoek, and R. Morris. Resilient overlay networks. In Proc. 18th ACM SOSP, Banff, Canada, October 2001.
2. A. Charny and J.-Y. Le Boudec. Delay bounds in a network with aggregate scheduling. In Proceedings of QoFIS, Berlin, Germany, October 2000.
3. Y. Chawathe, S. Fink, S. McCanne, and E. Brewer. A proxy architecture for reliable multicast in heterogeneous environments. In Proceedings of ACM Multimedia, Bristol, U.K., September 1998.
4. Virtela Communications. http://www.virtele.com.
5. Internap Network Services Corporation. http://www.internap.com.
6. D. Cox and V. Isham. Point Processes. Chapman and Hall, 1980.
7. Z. Duan, Z.-L. Zhang, and Y. T. Hou. Bandwidth provisioning for service overlay networks. In Proceedings of SPIE ITCOM (Scalability and Traffic Control in IP Networks) 2002, Boston, MA, July 29-August 1 2002.
8. Z. Duan, Z.-L. Zhang, and Y. T. Hou. Service overlay networks: SLAs, QoS and bandwidth provisioning. Technical report, Computer Science Department, University of Minnesota, February 2002.
9. N. Duffield, P. Goyal, A. Greenberg, P.Mishra, K. Ramakrishnan, and J.Merwe. A flexible model for resource management in virtual private networks. In Proc. ACM SIGCOMM, Cambridge, Massachusetts, September 1999.
10. A. Girard. Routing and Dimentioning in Circuit-Switched Networks. Addison-Wesley, 1990.
11. F. P. Kelly. Routing in circuit-switched networks: Optimization, shadow prices and decentralization. Advances in Applied Probability, 20:112-144, 1988.
12. M. Parulekar and A. M. Markowski. M/G/1input processes: A versatile class of models for network traffic. In Proc. IEEE INFOCOM, pages 419-426, Kobe, Japan, April 1997.
13. V. Paxson and S. Floyd. Wide area traffic: The failure of poisson modeling. In Proc. ACM SIGCOMM, pages 257-268, August 1994.
14. S. Savage, T. Anderson, and et al. Detour: a case for informed internet routing and transport. IEEE Micro, 19(1):50-59, January 1999.
15. Auckland Data Trace. http://pma.nlanr.net/traces/long/auck2.html.
16. Z.-L. Zhang, Z. Duan, and Y. T. Hou. Fundamental trade-offs in aggregate packet scheduling. In Proceedings of IEEE International Conference on Network Protocols (ICNP), Riverside, CA, November 2001.
17. Z.-L. Zhang, Z. Duan, and Y. T. Hou. On scalable design of bandwidth brokers. IEICE Transaction on Communications, E84-B(8), August 2001.