Improving OSPF Dynamics on a Broadcast LAN

Authors:
M. Goyal;W. Xie;S. H. Hosseini;K. Vairavan;D. Rohm
Affiliations:
EECS Department, University of Wisconsin-Milwaukee, 3200 N Cramer Street, Milwaukee, WI 53201;-;-;-;EECS Department, University of Wisconsin-Milwaukee, 3200 N Cramer Street, Milwaukee, WI 53201
Venue:
Simulation
Year:
2006

Citing 4
Cited 0

Electing a leader in a synchronous ring

Journal of the ACM (JACM)
Distributed Algorithms

Distributed Algorithms
Group leader election under link-state routing

ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Improving OSPF Dynamics On a Broadcast LAN

MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems

Quantified Score

Hi-index	0.00

Visualization

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.