IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
An evaluation of IP-based fast reroute techniques
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
Achieving convergence-free routing using failure-carrying packets
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
OpenFlow: enabling innovation in campus networks
ACM SIGCOMM Computer Communication Review
Proceedings of the ACM SIGCOMM 2010 conference
Packet re-cycling: eliminating packet losses due to network failures
Hotnets-IX Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks
Axon: a flexible substrate for source-routed ethernet
Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
Design, implementation and evaluation of congestion control for multipath TCP
Proceedings of the 8th USENIX conference on Networked systems design and implementation
R-BGP: staying connected In a connected world
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
NetLord: a scalable multi-tenant network architecture for virtualized datacenters
Proceedings of the ACM SIGCOMM 2011 conference
Understanding network failures in data centers: measurement, analysis, and implications
Proceedings of the ACM SIGCOMM 2011 conference
Jellyfish: networking data centers randomly
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Bit weaving: a non-prefix approach to compressing packet classifiers in TCAMs
IEEE/ACM Transactions on Networking (TON)
Brief announcement: on the resilience of routing tables
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Deadline-aware datacenter tcp (D2TCP)
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
DeTail: reducing the flow completion time tail in datacenter networks
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Abstractions for network update
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
PAST: scalable ethernet for data centers
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Ensuring connectivity via data plane mechanisms
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
| Hi-index | 0.00 |
This paper introduces Plinko, a network architecture that uses a novel forwarding model and routing algorithm to build networks with forwarding paths that, assuming arbitrarily large forwarding tables, are provably resilient against t link failures, ∀t ∈ N. However, in practice, there are clearly limits on the size of forwarding tables. Nonetheless, when constrained to hardware comparable to modern top-of-rack (TOR) switches, Plinko scales with high resilience to networks with up to ten thousand hosts. Thus, as long as t or fewer links have failed, the only reason packets of any flow in a Plinko network will be dropped are congestion, packet corruption, and a partitioning of the network topology, and, even after t + 1 failures, most, if not all, flows may be unaffected. In addition, Plinko is topology independent, supports arbitrary paths for routing, provably bounds stretch, and does not require any additional computation during forwarding. To the best of our knowledge, Plinko is the first network to have all of these properties.