• DocumentCode
    54896
  • Title

    Pricing Utility-Based Virtual Networks

  • Author

    Ghazar, T. ; Samaan, Nancy

  • Author_Institution
    Sch. of Electr. Eng. & Comput. Sci., Univ. of Ottawa, Ottawa, ON, Canada
  • Volume
    10
  • Issue
    2
  • fYear
    2013
  • fDate
    Jun-13
  • Firstpage
    119
  • Lastpage
    132
  • Abstract
    This paper presents a new pricing mechanism for virtual network (VN) services to regulate the demand for their shared substrate network (SN) resources. The contributions of this article are two-fold; first, we introduce a new time-of-use pricing policy for the SN resources that reflects the effect of resource congestion introduced by VN users. The preferences of the VN users are first represented through corresponding demand-utility functions that quantify the sensitivity of the applications hosted by the VNs to resource consumption, time-of-use and prices during peak-demand periods. We then introduce a novel model of time-varying VNs, where users are allowed to up- or down-scale the requested resources to continuously maximize their utility while minimizing the cost of embedding the VNs onto the SN. The second contribution is a novel hierarchical embedding management approach tailored to efficiently map these dynamic VNs. The proposed VN embedding scheme recasts the VN embedding problem as a subgraph matching one, and introduces a simple heuristics-based matching procedure to find a good VN embedding from a number of candidate solutions obtained in parallel. In contrast to existing solutions, the proposed scheme does not impose any limitations on the size or topology of the VN requests. Instead, the search is customized according to the VN size and the associated utility. Experimental results demonstrate the performance achieved by the proposed work in terms of the increased profit, resource utilization and number of accepted requests.
  • Keywords
    computer network performance evaluation; cost reduction; graph theory; pricing; profitability; resource allocation; virtualisation; SN resource congestion; VN embedding problem; VN request size; VN request topology; VN user preferences; application sensitivity quantification; cost minimization; demand-utility functions; down-scale; dynamic VN mapping; heuristics-based subgraph matching procedure; hierarchical embedding management approach; peak-demand periods; pricing utility-based virtual networks; profit; resource consumption; shared substrate network resource utilization; time-of-use pricing policy; time-varying VN services; up-scale; utility maximization; Embedded systems; Pricing; Resource management; Substrates; Telecommunication traffic; Virtual private networks; Virtualization; Virtualization; congestion pricing; subgraph matching; time-of-use pricing; virtual network embedding;
  • fLanguage
    English
  • Journal_Title
    Network and Service Management, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1932-4537
  • Type

    jour

  • DOI
    10.1109/TNSM.2013.043013.120304
  • Filename
    6514998