Service overlay networks: SLAs, QoS, and bandwidth provisioning

We advocate the notion of service overlay network (SON) as an effective means to address some of the issues, in particular, end-to-end quality of service (QoS), plaguing the current Internet, and to facilitate the creation and deployment of value-added Internet services such as VoIP, Video-on-Demand, and other emerging QoS-sensitive services. The SON purchases bandwidth with certain QoS guarantees from the individual network domains via bilateral service level agreement (SLA) to build a logical end-to-end service delivery infrastructure on top of the existing data transport networks. Via a service contract, users directly pay the SON for using the value-added services provided by the SON.In this paper, we study the bandwidth provisioning problem for an SON which buys bandwidth from the underlying network domains to provide end-to-end value-added QoS sensitive services such as VoIP and Video-on-Demand. A key problem in the SON deployment is the problem of bandwidth provisioning, which is critical to cost recovery in deploying and operating the value-added services over the SON. The paper is devoted to the study of this problem. We formulate the bandwidth provisioning problem mathematically, taking various factors such as SLA, service QoS, traffic demand distributions, and bandwidth costs. Analytical models and approximate solutions are developed for both static and dynamic bandwidth provisioning. Numerical studies are also performed to illustrate the properties of the proposed solutions and demonstrate the effect of traffic demand distributions and bandwidth costs on SON bandwidth provisioning.

[1]  Albert G. Greenberg,et al.  A flexible model for resource management in virtual private networks , 1999, SIGCOMM '99.

[2]  Yiwei Thomas Hou,et al.  Fundamental trade-offs in aggregate packet scheduling , 2005, IEEE Transactions on Parallel and Distributed Systems.

[3]  Sally Floyd,et al.  Wide-area traffic: the failure of Poisson modeling , 1994 .

[4]  Sally Floyd,et al.  Wide area traffic: the failure of Poisson modeling , 1995, TNET.

[5]  Azer Bestavros,et al.  Self-similarity in World Wide Web traffic: evidence and possible causes , 1997, TNET.

[6]  Steven McCanne,et al.  A proxy architecture for reliable multicast in heterogeneous environments , 1998, MULTIMEDIA '98.

[7]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[8]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1995, CCRV.

[9]  Jean-Yves Le Boudec,et al.  Delay Bounds in a Network with Aggregate Scheduling , 2000, QofIS.

[10]  Mark Crovella,et al.  Self-Similarity in World Wide Web Traffic: Evidence and Causes , 1996, SIGMETRICS.

[11]  Yiwei Thomas Hou,et al.  Service overlay networks: SLAs, QoS and bandwidth provisioning , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[12]  Armand M. Makowski,et al.  M|G|/spl infin/ input processes: a versatile class of models for network traffic , 1997, Proceedings of INFOCOM '97.

[13]  Amin Vahdat,et al.  Detour: informed Internet routing and transport , 1999, IEEE Micro.

[14]  Yiwei Thomas Hou,et al.  Bandwidth provisioning for service overlay networks , 2002, SPIE ITCom.

[15]  F. Kelly.  Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

[16]  Peter B. Danzig,et al.  A measurement-based admission control algorithm for integrated services packet networks , 1995, SIGCOMM '95.

[17]  Peter B. Danzig,et al.  A measurement-based admission control algorithm for integrated service packet networks , 1997, TNET.

[18]  Andre Girard,et al.  Routing and Dimensioning in Circuit-Switched Networks , 1990 .

[19]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[20]  Yiwei Thomas Hou,et al.  On Scalable Design of Bandwidth Brokers , 2001 .