Real-time model and convergence time of BGP
Proceedings - IEEE INFOCOM - Tập 2 - Trang 893-901 vol.2
Tóm tắt
BGP allows routers to use general preference policies for route selection. This paper studies the impact of these policies on convergence time. We first describe a real-time model of BGP. We then state and prove a general theorem providing an upper bound on convergence time. Finally, we show how to the use the theorem to prove convergence and estimate convergence time in three case studies.
Từ khóa
#Convergence #Peer to peer computing #Routing protocols #Upper bound #Shortest path problem #Distributed algorithms #Concatenated codesTài liệu tham khảo
bertsekas, 1991, Data Networks
obradovic, 2001, Formal Analysis of Routing Protocols
labovitz, 2000, An experimental study of internet routing convergence
bhargavan, 2000, RIP in SPIN/HOL, Theorem Proving in Higher Order Logics
10.1145/316194.316231
rekhter, 1995, A border gateway protocol 4 (BGP-4), 10.17487/rfc1771
stewart j w iii, 1998, BGP4 (Inter-Domain Routing in the Internet)
huston, 0, Interconnection, peering, and settlements, Proceedings of INET June 1999
10.1016/S1389-1286(99)00108-5
10.1145/339331.339426
10.1109/INFCOM.2000.832222
10.1109/ICNP.1999.801912
alaettinoglu, 0, Scalable router configuration for the internet, Proceedings of the 1996 International Conference on Networking Protocols October 1996
10.1109/INFCOM.2001.916775