ACM Computing Surveys (CSUR)
Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
Elements of network protocol design
Elements of network protocol design
An analysis of BGP convergence properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Stable Internet routing without global coordination
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Stable internet routing without global coordination
IEEE/ACM Transactions on Networking (TON)
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Route flap damping exacerbates internet routing convergence
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Stabilization of general loop-free routing
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Policy Disputes in Path-Vector Protocols
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Distributed agent paradigm for soft and hard computation
Journal of Network and Computer Applications - Special issue: Innovations in agent collaboration
Resolving inter-domain policy disputes
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
An exercise in selfish stabilization
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
(Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective
Graph-Theoretic Concepts in Computer Science
Proceedings of the International Conference on Advances in Computing, Communication and Control
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Maintaining safety in interdomain routing with hierarchical path-categories
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
On the stability of interdomain routing
ACM Computing Surveys (CSUR)
Hi-index | 0.00 |
The stable path problem is an abstraction of the basic functionality of the Internet's BGP routing protocol. This abstraction has received considerable attention, due to the instabilities observed in BGP. In this abstraction, each process informs its neighboring processes of its current path to the destination. From the paths received from its neighbors, each process chooses the best path according to some locally chosen routing policy. However, since routing policies are chosen locally, conflicts may occur between processes, resulting in unstable behavior. Current solutions either require expensive path histories, or prevent processes from locally choosing their routing policy. In this paper, we present a solution with small overhead, and furthermore, each process has the freedom to choose any routing policy. However, to avoid instabilities, each process is restricted to choose a path that is consistent with the current paths of its descendants on the routing tree. This is enforced through diffusing computations. Furthermore, our solution is stabilizing, and thus, recovers automatically from transient faults.