InFaRR: In-Network Fast ReRouting

被引:3
|
作者
Verdi, Fabio L. [1 ]
Luz, Gustavo V. [2 ]
机构
[1] Fed Univ Sao Carlos Sorocaba Campus, Comp Sci Dept, BR-18052780 Sorocaba, Brazil
[2] Claro Telecom Operator, Sao Paulo, Brazil
基金
巴西圣保罗研究基金会;
关键词
Switches; Routing; IP networks; Real-time systems; Quality of service; Process control; Packet loss; Data center networks; dataplane programmability; fault management; software-defined networking; fast rerouting; RECOVERY; PROTECTION;
D O I
10.1109/TNSM.2023.3283459
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
InFaRR (In-network Fast ReRouting) is an algorithm for fast rerouting in programmable data planes. Implemented in P4, InFaRR is free of additional headers and network state heartbeats. InFaRR has four essential features not jointly found in other recovery mechanisms: Loop prevention, Pushback, Recognition and Restoration and Return to the main route. Tests in standard Fat-Tree and AB Fat-Tree topologies with failures in different scenarios showed positive results when compared to state-of-the-art algorithms in the literature. In scenarios in which the other algorithms were able to recover, InFaRR presented fewer hops to bypass the failure when the Pushback, Loop Prevention and Recognition and Restoration mechanisms were used. In scenarios with multiple failures, InFaRR successfully rerouted where the others algorithms in some cases looped. The mechanism for returning to the main route allows to verify failures in remote links, making it possible to return to the main route without intervention from the control plane. Several evaluations were done comparing the results of InFaRR with the state-of-the art mechanisms, showing the capability of our fast rerouting algorithm in dealing with failures at the line-rate.
引用
收藏
页码:2319 / 2330
页数:12
相关论文
共 50 条
  • [41] Indexing in-network trajectory flows
    Iulian Sandu Popa
    Karine Zeitouni
    Vincent Oria
    Dominique Barth
    Sandrine Vial
    The VLDB Journal , 2011, 20 : 643 - 669
  • [42] In-Network Analytics for Ubiquitous Sensing
    Eyal, Ittay
    Keidar, Idit
    Patterson, Stacy
    Rom, Raphi
    DISTRIBUTED COMPUTING, 2013, 8205 : 507 - 521
  • [43] The Case For In-Network Computing On Demand
    Tokusashi, Yuta
    Huynh Tu Dang
    Pedone, Fernando
    Soule, Robert
    Zilberman, Noa
    PROCEEDINGS OF THE FOURTEENTH EUROSYS CONFERENCE 2019 (EUROSYS '19), 2019,
  • [44] MCPC: Improving In-Network Caching with Network Partitions
    He, Dongbiao
    Jiang, Jinlei
    Yang, Guangwen
    Westphal, Cedric
    2018 IEEE 24TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS 2018), 2018, : 730 - 738
  • [45] Leveraging In-Network Application Awareness
    Sultana, Nik
    PROCEEDINGS OF THE ACM SIGCOMM 2021 WORKSHOP ON NETWORK-APPLICATION INTEGRATION (NAI '21), 2021, : 63 - 67
  • [46] The Case for In-Network Replay Suppression
    Lee, Taeho
    Pappas, Christos
    Perrig, Adrian
    Gligor, Virgil
    Hu, Yih-Chun
    PROCEEDINGS OF THE 2017 ACM ASIA CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY (ASIA CCS'17), 2017, : 862 - 873
  • [47] Flare: Flexible In-Network Allreduce
    De Sensi, Daniele
    Di Girolamo, Salvatore
    Ashkboos, Saleh
    Li, Shigang
    Hoefler, Torsten
    SC21: INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2021,
  • [48] Computation Hierarchy for In-Network Processing
    Vlasios Tsiatsis
    Ram Kumar
    Mani B. Srivastava
    Mobile Networks and Applications, 2005, 10 : 505 - 518
  • [49] In-Network Caching for Chip Multiprocessors
    Yanamandra, Aditya
    Irwin, Mary Jane
    Narayanan, Vijaykrishnan
    Kandemir, Mahmut
    Narayanan, Sri Hari Krishna
    HIGH PERFORMANCE EMBEDDED ARCHITECTURES AND COMPILERS, PROCEEDINGS, 2009, 5409 : 373 - 388
  • [50] In-network estimation of frequency moments
    Pooja Vyavahare
    Nutan Limaye
    D. Manjunath
    International Journal of Advances in Engineering Sciences and Applied Mathematics, 2013, 5 (1) : 76 - 84