Models and Algorithms for the Design of Service Overlay Networks

Service overlay networks (SONs) can provide end-to-end quality of service guarantees in the Internet without requiring significant changes to the underlying network infrastructure. A SON is an application-layer network operated by a third-party Internet service provider (ISP) that owns a set of overlay nodes, residing in the underlying ISP domains, interconnected by overlay links. The deployment of a SON can be a capital-intensive investment, and hence its planning requires careful decisions, including the overlay nodes' placement, the capacity provisioning of overlay links as well as of access links that connect the end-users to the SON infrastructure. In this paper, we propose two novel optimization models for the planning of SONs. The first model minimizes the SON installation cost while providing full coverage to all network's users. The second model maximizes the SON operator's profit by further choosing which users to serve, based on the expected gain, and taking into consideration budget constraints. We also introduce two efficient heuristics to get near-optimal solutions for largescale instances in a reasonable computation time. We provide numerical results of the proposed models and heuristics on a set of realistic-size instances, and discuss the effect of different parameters on the characteristics of the planned networks. We show that in the considered network scenarios the proposed heuristics perform close to the optimum with a short computing time.

[1]  David Watson,et al.  Topology aware overlay networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[2]  Lili Qiu,et al.  Overlay Node Placement: Analysis, Algorithms and Impact on Applications , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[3]  R. Boorstyn,et al.  Large-Scale Network Topological Optimization , 1977, IEEE Trans. Commun..

[4]  Eric C. Rosen,et al.  Multiprotocol Label Switching Architecture , 2001, RFC.

[5]  Joseph D. Touch,et al.  A global X-bone for network experiments , 2005, First International Conference on Testbeds and Research Infrastructures for the DEvelopment of NeTworks and COMmunities.

[6]  Sonia Fahmy,et al.  Characterizing Overlay Multicast Networks and Their Costs , 2007, IEEE/ACM Transactions on Networking.

[7]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[8]  Filip De Turck,et al.  On the Construction of QoS Enabled Overlay Networks , 2004, QofIS.

[9]  David Watson,et al.  Enhancing end-to-end availability and performance via topology-aware overlay networks , 2008, Comput. Networks.

[10]  Jonathan S. Turner,et al.  Placing Servers in Overlay Networks , 2002 .

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

[12]  Bu-Sung Lee,et al.  A survey of application level multicast techniques , 2004, Comput. Commun..

[13]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[14]  Randy H. Katz,et al.  OverQoS: offering Internet QoS using overlays , 2003, CCRV.

[15]  Ibrahim Matta,et al.  On the origin of power laws in Internet topologies , 2000, CCRV.

[16]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

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

[18]  Parviz Kermani,et al.  MENTOR: an algorithm for mesh network topological optimization and routing , 1991, IEEE Trans. Commun..

[19]  Mark Handley,et al.  Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[20]  Brian W. Kernighan,et al.  AMPL: A Modeling Language for Mathematical Programming , 1993 .

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

[22]  Ellen W. Zegura,et al.  How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[23]  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..

[24]  Ratul Mahajan,et al.  Inferring link weights using end-to-end measurements , 2002, IMW '02.

[25]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

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

[27]  Jonathan S. Turner,et al.  Multicast routing and bandwidth dimensioning in overlay networks , 2002, IEEE J. Sel. Areas Commun..

[28]  Mostafa H. Ammar,et al.  Dynamic Topology Configuration in Service Overlay Networks: A Study of Reconfiguration Policies , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[29]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[30]  Dario Pompili,et al.  Multicast algorithms in service overlay networks , 2008, Comput. Commun..