• DocumentCode
    2493937
  • Title

    Topology Design of Service Overlay Network with a Generalized Cost Model

  • Author

    Zhou, Ling ; Sen, Arunabha

  • Author_Institution
    Arizona State Univ. Tempe, Tempe
  • fYear
    2007
  • fDate
    26-30 Nov. 2007
  • Firstpage
    75
  • Lastpage
    80
  • Abstract
    Service Overlay Network (SON) was proposed to alleviate the difficulties encountered in providing end-to-end Quality of Service (QoS) guarantees. SON is 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 the existing Internet. We focus on SON topology design problems under a generalized cost model. Earlier research in this topic considered two distinct cost models - fixed (leased) cost model and variable (usage-based) cost model. However in most applications, the costs of both nodes and links have a fixed component as well as a variable component that often depends on usage. Our generalized cost model takes this fact into account and our topology design algorithm uses this cost model to And the optimal topology. Since the SON topology design problem is NP-complete, we provide approximation algorithm with guaranteed performance bound. We validate the effectiveness of our algorithm through extensive simulation.
  • Keywords
    Internet; computational complexity; quality of service; telecommunication network topology; Internet; NP-complete; approximation algorithm; end-to-end data delivery infrastructure; end-to-end quality of service; service overlay network topology design; Algorithm design and analysis; Bandwidth; Computer science; Cost function; Data processing; Design engineering; IP networks; Network servers; Network topology; Quality of service;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
  • Conference_Location
    Washington, DC
  • Print_ISBN
    978-1-4244-1042-2
  • Electronic_ISBN
    978-1-4244-1043-9
  • Type

    conf

  • DOI
    10.1109/GLOCOM.2007.22
  • Filename
    4410932