Data networks
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
Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Internet Routing Architectures
Internet Routing Architectures
Distributed Algorithms
BGP4: Inter-Domain Routing in the Internet
BGP4: Inter-Domain Routing in the Internet
Route oscillations in I-BGP with route reflection
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Policy Disputes in Path-Vector Protocols
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
An Experimental Analysis of BGP Convergence Time
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Scoped Bellman-Ford geographic routing for large dynamic wireless sensor networks
Journal of Computer Science and Technology
Increasing bisemigroups and algebraic routing
RelMiCS'08/AKA'08 Proceedings of the 10th international conference on Relational and kleene algebra methods in computer science, and 5th international conference on Applications of kleene algebra
On the convergence condition and convergence time of BGP
Computer Communications
| Hi-index | 0.00 |
We study the running time of a particular path-vector protocol for distributively and asynchronously computing shortest paths in a network to a given target node t. We study two cases. In both, the protocol starts with each node possibly knowing some path to t, subject to conditions discussed in the paper. In the first case, the "withdrawal case," all edges incident to the target are cut. We prove that in this case, the protocol always terminates but may need exponential time to do so, if the nodes "fire" (i.e., execute) in an adversarially chosen order, even if the initial paths are shortest. If the graph is a clique, the protocol terminates in polynomial time. If, on the other hand, the nodes fire in random order, and the graph is arbitrary, then the algorithm terminates in polynomial expected time. In the second case, the "announcement case," in which new edges incident to t appear, we prove that the protocol terminates in polynomial time, regardless of the firing order.This protocol is interesting since it models the shortest-path protocol used by BGP, the interdomain routing protocol of the Internet, in the absence of policy.