Fast and scalable routing protocols for data center networks

被引:0
|
作者
Vesovic, Mihailo [1 ]
Smiljanic, Aleksandra [1 ]
Kostic, Dusan [2 ]
机构
[1] Univ Belgrade, Sch Elect Engn, Belgrade 11120, Serbia
[2] Amazon Web Serv AWS, Zurich, Switzerland
关键词
Routing protocols; Data center networks; Parallel algorithms; Distributed algorithms; Algorithm design and analysis; Shortest-path problem; Scalability;
D O I
10.1016/j.dcan.2022.06.010
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Data center networks may comprise tens or hundreds of thousands of nodes, and, naturally, suffer from frequent software and hardware failures as well as link congestions. Packets are routed along the shortest paths with sufficient resources to facilitate efficient network utilization and minimize delays. In such dynamic networks, links frequently fail or get congested, making the recalculation of the shortest paths a computationally intensive problem. Various routing protocols were proposed to overcome this problem by focusing on network utilization rather than speed. Surprisingly, the design of fast shortest-path algorithms for data centers was largely neglected, though they are universal components of routing protocols. Moreover, parallelization techniques were mostly deployed for random network topologies, and not for regular topologies that are often found in data centers. The aim of this paper is to improve scalability and reduce the time required for the shortest-path calculation in data center networks by parallelization on general-purpose hardware. We propose a novel algorithm that parallelizes edge relaxations as a faster and more scalable solution for popular data center topologies.
引用
收藏
页码:1340 / 1350
页数:11
相关论文
共 50 条
  • [1] Fast, Scalable and Robust Centralized Routing for Data Center Networks
    Lin, Fusheng
    Wang, Hongyu
    Chen, Guo
    Zhou, Guihua
    Xu, Tingting
    Wei, Dehui
    Chen, Li
    Lu, Yuanwei
    Qu, Andrew
    Shao, Hua
    Jiang, Hongbo
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2023, 31 (06) : 2624 - 2639
  • [2] Routing Optimization in Data Center Networks
    Maksic, Natasa
    Smiljanic, Aleksandra
    2015 23RD TELECOMMUNICATIONS FORUM TELFOR (TELFOR), 2015, : 49 - 56
  • [3] Routing Protocols in Opportunistic Networks - A Survey
    Alajeely, Majeed
    Doss, Robin
    Ahmad, Asma'a
    IETE TECHNICAL REVIEW, 2018, 35 (04) : 369 - 387
  • [4] Comparative Study of Routing Protocols for Opportunistic Networks
    Alajeely, Majeed
    Ahmad, Asma'a
    Doss, Robin
    2013 SEVENTH INTERNATIONAL CONFERENCE ON SENSING TECHNOLOGY (ICST), 2013, : 209 - 214
  • [5] Routing pre-configuration for fast and scalable path restoration in DWDM networks
    Gao, Donghui
    Zhang, Hanyi
    PHOTONIC NETWORK COMMUNICATIONS, 2006, 12 (03) : 321 - 327
  • [6] Routing pre-configuration for fast and scalable path restoration in DWDM networks
    Donghui Gao
    Hanyi Zhang
    Photonic Network Communications, 2006, 12 : 321 - 327
  • [7] Topology Independent Multipath Routing for Data Center Networks
    Maksic, Natasa
    IEEE ACCESS, 2021, 9 : 128590 - 128600
  • [8] Performance evaluation of transport protocols in cloud data center networks
    Tsiknas, Konstantinos G.
    Aidinidis, Paraskevas, I
    Zoiros, Kyriakos E.
    PHOTONIC NETWORK COMMUNICATIONS, 2021, 42 (02) : 105 - 116
  • [9] Performance evaluation of transport protocols in cloud data center networks
    Konstantinos G. Tsiknas
    Paraskevas I. Aidinidis
    Kyriakos E. Zoiros
    Photonic Network Communications, 2021, 42 : 105 - 116
  • [10] RSLB: Robust and Scalable Load Balancing in Software-Defined Data Center Networks
    Liu, Yong
    Gu, Huaxi
    Zhou, Zhaoxing
    Wang, Ning
    IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2022, 19 (04): : 4706 - 4720