Open Shortest Path First (OSPF) is a dynamic, hierarchical routing protocol designed to support routing in TCP/IP networks. A simulation of the OSPF Election Protocol shows three results: (1) The Designated Router (DR) can be elected in constant time. (2) If a router has a limited number of input buffers, a competition for buffers between the Election and the Flooding Protocols increases the election time and causes an oscillatory behavior.At each router, the Router-ID of the DR continuously changes causing instability. (3) In the worst case, when the DR and the BDR fail at the same time, the DR-agreement-time is bounded above by twice the HelloInterval. A simulation of the OSPF Flooding Protocol, using 20, 50 and 80 router point-to-point networks, shows three results: (1) For the 50 router network, as link speed exceeds 4000 Kbps, the probability of overflowing the input buffers increases causing retransmissions. The increase in bootup-convergence-time from retransmissions is bounded by two and three times the RxmtInterval for link speeds of 4000 to 6000 Kbps and above 50 Mbps respectively. The increase in the bootup-convergence-time is due to large number of unacknowledged flooding packets received within RxmtInterval. (2) For 20 and 50 router networks, the input buffer size has little impact on the bootup-convergence-time. For the 80 router network, a small change in the input buffer size drastically changes the bootup-convergence-time. (3) Reducing the value of the RxmtInterval lowers the bootup-convergence-time at high link speeds.

article Finding disjoint paths in networks Share on Authors: Deepinder Sidhu Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MD Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MDView Profile , Raj Nair Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MD Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MDView Profile , Shukri Abdallah Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MD Department of Computer Science, University of Maryland, BC, Baltimore, MD and Institute for Advanced Computer Studies, University of Maryland, CP, College Park, MDView Profile Authors Info & Claims ACM SIGCOMM Computer Communication ReviewVolume 21Issue 4Sept. 1991 pp 43–51https://doi.org/10.1145/115994.115998Published:01 August 1991 108citation2,329DownloadsMetricsTotal Citations108Total Downloads2,329Last 12 Months68Last 6 weeks8 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access