A distributed routing algorithm for mobile wireless networks
Wireless Networks
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Data Center Fundamentals
Two Routing Algorithms for Failure Protection in IP Networks
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Achieving convergence-free routing using failure-carrying packets
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable, commodity data center network architecture
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
VL2: a scalable and flexible data center network
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Understanding TCP incast throughput collapse in datacenter networks
Proceedings of the 1st ACM workshop on Research on enterprise networking
Link Reversal: How to Play Better to Work Less
Algorithmic Aspects of Wireless Sensor Networks
Always acyclic distributed path computation
IEEE/ACM Transactions on Networking (TON)
On the feasibility and efficacy of protection routing in IP networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Proceedings of the ACM SIGCOMM 2010 conference
SPAIN: COTS data-center Ethernet for multipathing over arbitrary topologies
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
Packet re-cycling: eliminating packet losses due to network failures
Hotnets-IX Proceedings of the 9th ACM SIGCOMM Workshop on Hot Topics in Networks
Network architecture for joint failure recovery and traffic engineering
Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Better never than late: meeting deadlines in datacenter networks
Proceedings of the ACM SIGCOMM 2011 conference
Understanding network failures in data centers: measurement, analysis, and implications
Proceedings of the ACM SIGCOMM 2011 conference
Data-driven network connectivity
Proceedings of the 10th ACM Workshop on Hot Topics in Networks
Link Reversal Algorithms
Brief announcement: on the resilience of routing tables
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Reproducible network experiments using container-based emulation
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Improving availability in distributed systems with failure informers
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
FatTire: declarative fault tolerance for software-defined networks
Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
Aspen trees: balancing data center fault tolerance, scalability and cost
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
Plinko: building provably resilient forwarding tables
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
| Hi-index | 0.00 |
We typically think of network architectures as having two basic components: a data plane responsible for forwarding packets at line-speed, and a control plane that instantiates the forwarding state the data plane needs. With this separation of concerns, ensuring connectivity is the responsibility of the control plane. However, the control plane typically operates at timescales several orders of magnitude slower than the data plane, which means that failure recovery will always be slow compared to data plane forwarding rates. In this paper we propose moving the responsibility for connectivity to the data plane. Our design, called Data-Driven Connectivity (DDC) ensures routing connectivity via data plane mechanisms. We believe this new separation of concerns -- basic connectivity on the data plane, optimal paths on the control plane -- will allow networks to provide a much higher degree of availability, while still providing flexible routing control.