Optimal design of Service Overlay Networks with economic and performance constraints

In the last years, Service Overlay Networks (SONs) have emerged as a promising means to address some of the issues (e.g. end-to-end QoS) affecting the current Internet and to favor the development and deployment of new value-added Internet services. The deployment of an SON is a capital-intensive investment, since bandwidth with certain QoS guarantees must be purchased from the individual network domains through bilateral Service Level Agreements. Thus, minimizing the economic cost of the logical end-to-end service delivery infrastructure is one of the key objectives for the SON provider. When a SON is aimed at end-to-end QoS provisioning, its topology must be designed so as to also satisfy the specific requirements of QoS-sensitive applications. This paper deals with the problem of planning the SON topology in order to take into account both cost and QoS constraints. More specifically, the paper proposes a set of new algorithms for the design of an optimized SON topology, which minimizes the economic cost while simultaneously meeting bandwidth and delay constraints. A performance comparison among such algorithms is finally carried out. Copyright © 2009 John Wiley & Sons, Ltd. In the last years, Service Overlay Networks (SONs) have emerged as a promising means to provide end-to-end QoS in the Internet. However, the deployment of a SON is a capital-intensive investment. Thus, minimizing the economic cost is one of the key objectives for the SON provider. This paper proposes a set of new algorithms for the design of an optimized SON topology, which minimizes the economic cost, while simultaneously meeting bandwidth and delay constraints. Copyright © 2009 John Wiley & Sons, Ltd.

[1]  Adrian Popescu,et al.  Implementation of Application Layer Multicast in OverSim , 2007 .

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

[3]  A. Capone,et al.  Optimal design of service overlay networks , 2008, 2008 4th International Telecommunication Networking Workshop on QoS in Multiservice IP Networks.

[4]  Ryoichi Kawahara,et al.  On the Quality of Triangle Inequality Violation Aware Routing Overlay Architecture , 2009, IEEE INFOCOM 2009.

[5]  Stefano Giordano,et al.  Multi-constrained path computation algorithms for Traffic Engineering over Wireless Mesh Networks , 2009, 2009 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks & Workshops.

[6]  Prasant Mohapatra,et al.  On investigating overlay service topologies , 2007, Comput. Networks.

[7]  Hung Tuan Tran,et al.  A design framework towards the profitable operation of service overlay networks , 2007, Comput. Networks.

[8]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[9]  Prasant Mohapatra,et al.  The impact of topology on overlay routing service , 2004, IEEE INFOCOM 2004.

[10]  Diomidis Spinellis,et al.  A survey of peer-to-peer content distribution technologies , 2004, CSUR.

[11]  Antonio Capone,et al.  Routing and resource optimization in service overlay networks , 2009, Comput. Networks.

[12]  Jörg Liebeherr,et al.  Topology design for service overlay networks with bandwidth guarantees , 2004, Twelfth IEEE International Workshop on Quality of Service, 2004. IWQOS 2004..

[13]  Prasant Mohapatra,et al.  QRON: QoS-aware routing in overlay networks , 2004, IEEE Journal on Selected Areas in Communications.

[14]  Marta M. B. Pascoal,et al.  Deviation Algorithms for Ranking Shortest Paths , 1999, Int. J. Found. Comput. Sci..

[15]  Yiwei Thomas Hou,et al.  Service overlay networks: SLAs, QoS, and bandwidth provisioning , 2003, TNET.

[16]  Eranda Çela,et al.  The quadratic assignment problem : theory and algorithms , 1999 .