IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v29y2019i2ne2066.html
   My bibliography  Save this article

Resource availability–aware adaptive provisioning of virtual data center networks

Author

Listed:
  • Malayam Parambath Gilesh
  • S D Madhu Kumar
  • Lillykutty Jacob

Abstract

Optimal provisioning of virtual networks with varying topologies on their physical counterpart is a major challenge in cloud data centers. Embedding the virtual network on the shared physical infrastructure poses a multitude of challenges to the infrastructure provider. This paper proposes a hybrid approach which adapts to the availability and fragmentation level of residual resources for near‐optimal mapping of multiple virtual data center networks on a substrate data center network. The proposed technique uses coordinated static and dynamic embedding phases, adaptively, to maximize the density of embedding which increases the revenue of the cloud service provider. Also, it judiciously modifies the existing mappings for efficient utilization of resources. Empirical results show that the proposed hybrid approach can attain ∼10% higher acceptance ratio compared with the existing exact and heuristic techniques in the literature. With the proposed mixed integer programming model for static embedding, the average path length is reduced by 20% compared with the existing techniques.

Suggested Citation

  • Malayam Parambath Gilesh & S D Madhu Kumar & Lillykutty Jacob, 2019. "Resource availability–aware adaptive provisioning of virtual data center networks," International Journal of Network Management, John Wiley & Sons, vol. 29(2), March.
  • Handle: RePEc:wly:intnem:v:29:y:2019:i:2:n:e2066
    DOI: 10.1002/nem.2066
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.2066
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.2066?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:intnem:v:29:y:2019:i:2:n:e2066. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.