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

Highly efficient optical aggregation network with network functions virtualization

Author

Listed:
  • Takashi Miyamura
  • Akira Misawa
  • Jun‐ichi Kani

Abstract

Network functions virtualization enables network edge functions to be relocated from dedicated hardware to distributed pools of commodity servers. Metro aggregation networks provide transport between access gateway nodes and such servers accommodating virtual network functions (VNFs). Networks need to be designed to increase the efficiency of network resource usage and reducing network cost as well as energy consumption. However, independently placing VNFs on a server from a physical network design degrades the efficiency of resource usage and causes an increase in network cost. We can avoid such problems by adequately placing each VNF in consideration of the location of access gateway nodes and a network topology. We thus propose a method for designing an optical aggregation network with VNF placement. We successfully formulate the design method as mixed‐integer linear programming and demonstrate its effectiveness through intensive mathematical experiments. The experiments showed that the proposed method reduced network cost by up to about 18% while performing almost optimally in terms of server load dispersion.

Suggested Citation

  • Takashi Miyamura & Akira Misawa & Jun‐ichi Kani, 2019. "Highly efficient optical aggregation network with network functions virtualization," International Journal of Network Management, John Wiley & Sons, vol. 29(2), March.
  • Handle: RePEc:wly:intnem:v:29:y:2019:i:2:n:e2052
    DOI: 10.1002/nem.2052
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1002/nem.2052?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:e2052. 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.