Abstract
In this article, the authors propose modifications to OSPF's interface state machine to reduce the time/processing requirements of the leader election process in a broadcast local-area network (LAN) environment. The proposed modifications are based on dynamic adjustment of wait time duration rather than using a static value. They compare the original and modified state machines both analytically as well as via testbed experiments.
Get full access to this article
View all access options for this article.
References
1.
Moy, J. 1998. OSPF version 2. Request for Comments (Standards Track) RFC 2328, Internet Engineering Task Force, April.
2.
Garcia-Molina, H.
1982 . ‘ Elections in a distributed computing system . IEEE Transactions on Computers
31 : 48 -59 .
3.
Fredrickson, N.
, and
N. Lynch
1987 . Electing a leader in a synchronous ring . Journal of the ACM
34 : 98 -115 .
4.
Huang, Y.
, and
P. McKinley
1997 . Group leader election under linkstate routing . In Proceedings of ICNP'1997 , pp. 95 -104 .
5.
Lynch, N.
1996 . Distributed algorithms . San Francisco : Morgan Kaufmann .
6.
Goyal, M.
,
W. Xie
,
S. H. Hosseini
, and
K. Vairavan
2005 . Improving OSPF dynamics over broadcast LAN . In Proceedings of IEEE MASCOTS'2005 .
7.
Moy, J.
Accessed 27th April 2006. OSPFD routing software resources . http://www.ospf.org