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

Cost‐effective and accurate flow statistics collection in OpenFlow‐based SDN

Author

Listed:
  • Binghao Yan
  • Qinrang Liu
  • Jianliang Shen
  • Dong Liang
  • Xingyu Liu

Abstract

Network resource scheduling and optimization require the acquisition of status information as a basis. High‐cost solutions lead to more resource consumption but only bring negligible benefits. To address this challenge, this paper proposes a novel statistics collection method adapted to OpenFlow‐based SDN, which can reduce the measurement cost while ensuring the statistical accuracy. First, based on the complex network theory, we propose multi‐path weighted closeness centrality (MWCC) to perform importance ranking on network switching nodes, which helps us select top‐k key nodes for statistical collection to reduce the overhead. Second, we propose an adaptive flow rule timeout mechanism AFRT. AFRT continuously optimizes the rule timeout values based on statistical results, further balancing flow table overhead and statistical accuracy. A series of simulation results on real network topologies verify the superiority of the proposed method in terms of communication cost, statistical accuracy, and time consumption, compared with the existing representative methods.

Suggested Citation

  • Binghao Yan & Qinrang Liu & Jianliang Shen & Dong Liang & Xingyu Liu, 2022. "Cost‐effective and accurate flow statistics collection in OpenFlow‐based SDN," International Journal of Network Management, John Wiley & Sons, vol. 32(4), July.
  • Handle: RePEc:wly:intnem:v:32:y:2022:i:4:n:e2197
    DOI: 10.1002/nem.2197
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1002/nem.2197?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:32:y:2022:i:4:n:e2197. 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.