Achieving convergence-free routing using failure-carrying packets

Author:

Lakshminarayanan Karthik1,Caesar Matthew1,Rangan Murali1,Anderson Tom2,Shenker Scott1,Stoica Ion1

Affiliation:

1. University of California at Berkeley, Berkeley, CA

2. University of Washington, Seattle, WA

Abstract

Current distributed routing paradigms (such as link-state, distance-vector, and path-vector) involve a convergence process consisting of an iterative exploration of intermediate routes triggered by certain events such as link failures. The convergence process increases router load, introduces outages and transient loops, and slows reaction to failures. We propose a new routing paradigm where the goal is not to reduce the convergence times but rather to eliminate the convergence process completely. To this end, we propose a technique called Failure-Carrying Packets (FCP) that allows data packets to autonomously discover a working path without requiring completely up-to-date state in routers. Our simulations, performed using real-world failure traces and Rocketfuel topologies, show that: (a) the overhead of FCP is very low, (b) unlike traditional link-state routing (such as OSPF), FCP can provide both low loss-rate as well as low control overhead, (c) compared to prior work in backup path pre-computations, FCP provides better routing guarantees under failures despite maintaining lesser state at the routers.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Networks and Communications,Software

Reference35 articles.

1. Abilene observatory data collections. 2006. http://abilene.internet2.edu/observatory/. Abilene observatory data collections. 2006. http://abilene.internet2.edu/observatory/.

2. Anonymized OC48 traces CAIDA. 2006.http://data.caida.org/. Anonymized OC48 traces CAIDA. 2006.http://data.caida.org/.

3. A. Atlas. U-turn Alternates for IP/LDP Fast-Reroute. Internet Draft draft-atlas-ip-local-protect-uturn-03.txt February 2006. A. Atlas. U-turn Alternates for IP/LDP Fast-Reroute. Internet Draft draft-atlas-ip-local-protect-uturn-03.txt February 2006.

4. Distributed, scalable routing based on link-state vectors

Cited by 51 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. A Decentralized SDN Architecture for the WAN;Proceedings of the ACM SIGCOMM 2024 Conference;2024-08-04

2. Improving Network Availability through Optimized Multipath Routing and Incremental Deployment Strategies;Computers, Materials & Continua;2024

3. Fast Recovery from Multiple Link Failures in LEO Satellite Networks;2023 IEEE 34th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC);2023-09-05

4. Beyond a Centralized Verifier: Scaling Data Plane Checking via Distributed, On-Device Verification;Proceedings of the ACM SIGCOMM 2023 Conference;2023-09

5. A Survey on Rerouting Techniques with P4 Programmable Data Plane Switches;Computer Networks;2023-07

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3