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

Research on scheduling method based on traffic matrix for IoT security

Author

Listed:
  • Shaohua Cao
  • Dongjie Zhu
  • Guofu Li
  • Yanwu Zhang
  • Xiani Fan
  • Shanshan Geng
  • Haiwen Du
  • Ning Cao

Abstract

With the increasing number of sensors in the Internet of Things (IoT), network nodes are prone to load imbalance, which seriously affects the reliability and scalability of the IoT. In this paper, a method of load balancing is proposed to reduce the pressure of switches in IoT and improve the efficiency of switch. The method is based on software defined network (SDN) technology using dynamic traffic scheduling of server cluster (DTSSC) model. It obtains the traffic and load matrices for each server and achieves load balancing on each of them. This method has high efficiency and low overhead and is easy to deploy. The validity of this method is verified through experiments; ie, the load ratio of each server is balanced.

Suggested Citation

  • Shaohua Cao & Dongjie Zhu & Guofu Li & Yanwu Zhang & Xiani Fan & Shanshan Geng & Haiwen Du & Ning Cao, 2021. "Research on scheduling method based on traffic matrix for IoT security," International Journal of Network Management, John Wiley & Sons, vol. 31(2), March.
    • Handle: RePEc:wly:intnem:v:31:y:2021:i:2:n:e2101
    DOI: 10.1002/nem.2101
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.2101
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nem.2101?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:31:y:2021:i:2:n:e2101. 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.