IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v76y2021i4d10.1007_s11235-020-00720-7.html
   My bibliography  Save this article

Avoiding bottlenecks in networks by short paths

Author

Listed:
  • Chen Levi

    (Ben-Gurion University of the Negev)

  • Michael Segal

    (Ben-Gurion University of the Negev)

Abstract

Data center networks are typically characterized by high density communication components that process and exchange large amount of information using shortest paths. Mostly, data centers network topologies contain multi-rooted tree with multiple equal cost shortest paths between pairs of hosts. Usually, data center networks operation is based on the result of shortest path algorithms and per-flow static hashing which may cause poor network utilization rates with some links becoming congested while some parts of the network are underused. This work presents a flow scheduling algorithm that exploits the path diversity in data center topologies and dynamically reroutes large flows through less congested shortest and non-shortest paths based on the current state of the network without causing packets reordering. The algorithm aims to minimize flows latency while maximizing the network utilization rates. Results show that the algorithm proposed in this work reduces flows completion time by 13–24% over Equal-Cost Multi-Path routing, while improving the average network utilization by up to 10%.

Suggested Citation

  • Chen Levi & Michael Segal, 2021. "Avoiding bottlenecks in networks by short paths," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 76(4), pages 491-503, April.
    • Handle: RePEc:spr:telsys:v:76:y:2021:i:4:d:10.1007_s11235-020-00720-7
    DOI: 10.1007/s11235-020-00720-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-020-00720-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s11235-020-00720-7?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Elham Khani & Shaahin Hessabi & Somayyeh Koohi & Fulong Yan & Nicola Calabretta, 2022. "HFOS $$_L$$ L : hyper scale fast optical switch-based data center network with L-level sub-network," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 80(3), pages 397-411, July.

    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:spr:telsys:v:76:y:2021:i:4:d:10.1007_s11235-020-00720-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.