{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:41:54Z","timestamp":1777902114726,"version":"3.51.4"},"reference-count":7,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[2006,2]]},"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.1177\/0037549706065924","type":"journal-article","created":{"date-parts":[[2006,5,18]],"date-time":"2006-05-18T05:17:46Z","timestamp":1147929466000},"page":"107-129","source":"Crossref","is-referenced-by-count":1,"title":["Improving OSPF Dynamics on a Broadcast LAN"],"prefix":"10.1177","volume":"82","author":[{"given":"M.","family":"Goyal","sequence":"first","affiliation":[{"name":"EECS Department, University of Wisconsin\u2013Milwaukee, 3200 N                         Cramer Street, Milwaukee, WI 53201,"}]},{"given":"W.","family":"Xie","sequence":"additional","affiliation":[]},{"given":"S. H.","family":"Hosseini","sequence":"additional","affiliation":[]},{"given":"K.","family":"Vairavan","sequence":"additional","affiliation":[]},{"given":"D.","family":"Rohm","sequence":"additional","affiliation":[{"name":"EECS Department, University of Wisconsin\u2013Milwaukee, 3200 N                         Cramer Street, Milwaukee, WI 53201"}]}],"member":"179","published-online":{"date-parts":[[2006,2,1]]},"reference":[{"key":"atypb1","doi-asserted-by":"crossref","unstructured":"Moy, J. 1998. OSPF version 2. Request for Comments (Standards Track) RFC                 2328, Internet Engineering Task Force, April.","DOI":"10.17487\/rfc2328"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675885"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7919"},{"key":"atypb4","first-page":"95","volume-title":"Proceedings of ICNP'1997","author":"Huang, Y.","year":"1997"},{"key":"atypb5","volume-title":"Distributed algorithms","author":"Lynch, N.","year":"1996"},{"key":"atypb6","volume-title":"Proceedings of IEEE MASCOTS'2005","author":"Goyal, M.","year":"2005"},{"key":"atypb7","volume-title":"OSPFD routing software resources","author":"Moy, J."}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549706065924","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0037549706065924","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:19:37Z","timestamp":1777634377000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0037549706065924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["10.1177\/0037549706065924"],"URL":"https:\/\/doi.org\/10.1177\/0037549706065924","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}