• DocumentCode
    2135628
  • Title

    Study on Topology Design for Large Scale Service Overlay Networks

  • Author

    Zhang Dong ; Wu Chunming ; Xiong Wei ; Jiang Ming

  • Author_Institution
    Comput. Sci. Coll., Zhejiang Univ., Hangzhou, China
  • fYear
    2009
  • fDate
    24-26 Sept. 2009
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    Service Overlay Network (SON) is a kind of overlay networks which provides end-to-end QoS guarantees in the Internet. Without requiring significant changes to the underlying network infrastructure, SON deploys the nodes in the Internet and purchases the bandwidth from ISPs to support QoS application service for users. The deployment of a SON can be a capital-intensive investment, including the overlay nodes´ placement and purchasing the bandwidth from ISPs. Topology design with minimizing the SON installation cost and satisfying users´ requirement is important for SON study. The problem for SON topology design is NP-hard. The algorithms of earlier researches on SON topology design are too poor efficiency to apply to the large scale network. In this paper we propose a linear programming model based on multi-commodity flow to solve the problem for large scale SON construction. We validate the effectiveness of our algorithm through simulation.
  • Keywords
    Internet; bandwidth allocation; linear programming; quality of service; telecommunication network topology; Internet; NP-hard problem; QoS guarantee; SON topology design; bandwidth purchase; capital-intensive investment; linear programming model; multicommodity flow; service overlay network; Algorithm design and analysis; Bandwidth; Computer science; Costs; Educational institutions; IP networks; Large-scale systems; Network topology; Quality of service; Web and internet services;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications, Networking and Mobile Computing, 2009. WiCom '09. 5th International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-3692-7
  • Electronic_ISBN
    978-1-4244-3693-4
  • Type

    conf

  • DOI
    10.1109/WICOM.2009.5303357
  • Filename
    5303357