• DocumentCode
    2017286
  • Title

    An Opportunistic Resource Sharing and Topology-Aware mapping framework for virtual networks

  • Author

    Zhang, Sheng ; Qian, Zhuzhong ; Wu, Jie ; Lu, Sanglu

  • Author_Institution
    State Key Lab. for Novel Software Technol., Nanjing Univ., Nanjing, China
  • fYear
    2012
  • fDate
    25-30 March 2012
  • Firstpage
    2408
  • Lastpage
    2416
  • Abstract
    Network virtualization provides a promising way to overcome Internet ossification. A major challenge is virtual network mapping, i.e., how to embed multiple virtual network requests with resource constraints into a substrate network, such that physical resources are utilized in an efficient and effective manner. Since this problem is known to be NP-complete, a variety of heuristic algorithms have been proposed. In this paper, we re-examine this problem and propose a virtual network mapping framework, ORS TA, which is based on Opportunistic Resource Sharing and Topology-Aware node ranking. Opportunistic resource sharing is taken into consideration at the entire network level for the first time and we develop an online approximation algorithm, FFA, for solving the corresponding time slot assignment problem. To measure the topology importance of a substrate node, a node ranking method, MCRank, based on Markov chain is presented. We also devise a simple and practical method to estimate the residual resource of a substrate node/link. Extensive simulation experiments demonstrate that the proposed framework enables the substrate network to achieve efficient physical resource utilization and to accept many more virtual network requests over time.
  • Keywords
    Internet; Markov processes; approximation theory; optimisation; resource allocation; virtual private networks; FFA; Internet; MCRank; Markov chain; NP-complete problem; ORS TA; heuristic algorithm; network virtualization; node ranking method; online approximation algorithm; opportunistic resource sharing; residual resource estimation; resource constraint; resource utilization; substrate node; time slot assignment problem; topology aware node ranking; topology-aware mapping framework; virtual network mapping; Algorithm design and analysis; Approximation algorithms; Approximation methods; Bandwidth; Indium phosphide; Resource management; Substrates; bin packing; markov chain; opportunistic resource sharing; topology-aware; virtual network mapping;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM, 2012 Proceedings IEEE
  • Conference_Location
    Orlando, FL
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4673-0773-4
  • Type

    conf

  • DOI
    10.1109/INFCOM.2012.6195630
  • Filename
    6195630