On Topological Design of Service Overlay Networks

  • Arunabha Sen
  • Ling Zhou
  • Bin Hao
  • Bao Hong Shen
  • Samrat Ganguly
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3552)


The notion of service overlay network (SON) was proposed recently to alleviate difficulties encountered in providing end-to-end quality of service (QoS) guarantees in the current Internet architecture. The SONs are able to provide QoS guarantees by purchasing bandwidth from individual network domains and building a logical end-to-end data delivery infrastructure on top of existing Internet. In this paper, we consider a generalized framework for SON, which is categorized based on three different characteristics: a) single-homed/multi-homed end-system b) usage-based/leased cost model and c) capacitated/uncapacitated network. We focus on the algorithmic analysis of the topology design problem for the above generalized SON. We prove that for certain case, polynomial-time optimal algorithm exists, while for other cases, the topology design problem is NP-complete. For the NP-complete cases, we provide approximation algorithms and experimental results.


Cost Model Topology Design Steiner Tree Problem Access Link Transport Link 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anderson, D.G., Balakrishnan, H., Kaashoek, M.F., Morris, R.: Resilient Overlay Network. In: Proc. 18th ACM SOSP 2001, Banff (October 2001)Google Scholar
  2. 2.
    Keromytis, A., Mishra, V., Rubenstein, D.: Secure Overlay Networks. In: Proc. of SIGCOMM 2002, pp. 61–72 (2002)Google Scholar
  3. 3.
    Duan, Z., Zhang, Z.L., Hou, Y.T.: Service Overlay Networks: SLAs, QoS and Bandwidth Provisioning. In: Proc. 10th IEEE International Conference on Network Protocols, Paris, France (November 2002); Also in IEEE/ACM Trans. on Networking 11(6), 870-883 (2003)Google Scholar
  4. 4.
    Garey, M., Johnson, D.: Computers and Intractability: A guide to the theory of NP-COmpleteness. W.H. Freeman, New York (1979)zbMATHGoogle Scholar
  5. 5.
    Gu, X., Nahrstedt, K., Chang, R.H., Ward, C.: QoS-Assured Service Composition in Managed Service Overlay Networks. In: Proc. of 23rd IEEE International Conference on Distributed Computing Systems, Providence (May 2003)Google Scholar
  6. 6.
    Internap Network Services Corporation,
  7. 7.
    Subramanian, L., Stoica, I., Balakrishnan, H., Katz, R.H.: OverQoS: Offereing Internet QoS using Overlays. In: Proc. HotNET-I Workshop (October 2002)Google Scholar
  8. 8.
    Vieira, S.L., Liebeherr, J.: An algorithmic approach to topological design of Service Overlay Networks. In: Proc. of IWQoS 2004, Montreal, Canada (2004)Google Scholar
  9. 9.
    Walrand, J., Varaiya, P.: High Performance Communication Networks. Morgan Kaufman Publishers, San Francisco (2000)Google Scholar
  10. 10.
    Savage, S., Anderson, T., et al.: Detour: a case for informed internet routing and transport. IEEE Micro 19(1), 50–59 (1999)CrossRefGoogle Scholar
  11. 11.
    Stoica, I., Adkins, D., Zhuang, S., Shenker, S., Surana, S.: Internet Indirection Infrastructure. In: Proc. of ACM SIGCOMM (August 2002)Google Scholar
  12. 12.
    Akella, A., Pang, J., Shaikh, A., Maggs, B., Seshan, S.: A Comparison of Overlay Routing and Multihoming Route Control. In: Proc. of ACM SIGCOMM (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Arunabha Sen
    • 1
  • Ling Zhou
    • 1
  • Bin Hao
    • 1
  • Bao Hong Shen
    • 1
  • Samrat Ganguly
    • 2
  1. 1.Dept. of Computer ScienceArizona State UniversityTempeUSA
  2. 2.Dept. of Broadband & Mobile NetworksNEC LaboratoriesUSA

Personalised recommendations