Brief announcement: on the resilience of routing tables

Authors:
Joan Feigenbaum;Brighten Godfrey;Aurojit Panda;Michael Schapira;Scott Shenker;Ankit Singla
Affiliations:
Yale University, New Haven, CT, USA;University of Illinois at Urbana-Champaign, Urbana, IL, USA;University of California Berkeley, Berkeley, CA, USA;Hebrew University, Jerusalem, Israel;University of California Berkeley, Berkeley, CA, USA;University of Illinois at Urbana-Champaign, Urbana, IL, USA
Venue:
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Year:
2012

Citing 5
Cited 2

Efficient fault-tolerant fixed routings on (k+1)-connected digraphs

Discrete Applied Mathematics - Special double volume: interconnection networks
Achieving convergence-free routing using failure-carrying packets

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Packet re-cycling: eliminating packet losses due to network failures

Hotnets-IX Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks
R-BGP: staying connected In a connected world

NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Data-driven network connectivity

Proceedings of the 10th ACM Workshop on Hot Topics in Networks

Ensuring connectivity via data plane mechanisms

nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Plinko: building provably resilient forwarding tables

Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many modern network designs incorporate "failover" paths into routers' forwarding tables. We initiate the theoretical study of such resilient routing tables.