IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0145437.html
   My bibliography  Save this article

A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks

Author

Listed:
  • Huan Chen
  • Lemin Li
  • Jing Ren
  • Yang Wang
  • Yangming Zhao
  • Xiong Wang
  • Sheng Wang
  • Shizhong Xu

Abstract

This paper aims at minimizing the communication cost for collecting flow information in Software Defined Networks (SDN). Since flow-based information collecting method requires too much communication cost, and switch-based method proposed recently cannot benefit from controlling flow routing, jointly optimize flow routing and polling switch selection is proposed to reduce the communication cost. To this end, joint optimization problem is formulated as an Integer Linear Programming (ILP) model firstly. Since the ILP model is intractable in large size network, we also design an optimal algorithm for the multi-rooted tree topology and an efficient heuristic algorithm for general topology. According to extensive simulations, it is found that our method can save up to 55.76% communication cost compared with the state-of-the-art switch-based scheme.

Suggested Citation

  • Huan Chen & Lemin Li & Jing Ren & Yang Wang & Yangming Zhao & Xiong Wang & Sheng Wang & Shizhong Xu, 2015. "A Scheme to Optimize Flow Routing and Polling Switch Selection of Software Defined Networks," PLOS ONE, Public Library of Science, vol. 10(12), pages 1-22, December.
    • Handle: RePEc:plo:pone00:0145437
    DOI: 10.1371/journal.pone.0145437
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0145437
    Download Restriction: no
    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0145437&type=printable
    Download Restriction: no
    File URL: https://libkey.io/10.1371/journal.pone.0145437?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:plo:pone00:0145437. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.