{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T06:45:14Z","timestamp":1778654714865,"version":"3.51.4"},"reference-count":11,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks and ISDN Systems"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1016\/0169-7552(89)90066-4","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:17:02Z","timestamp":1060298222000},"page":"179-186","source":"Crossref","is-referenced-by-count":22,"title":["Topology broadcast algorithms"],"prefix":"10.1016","volume":"16","author":[{"given":"Pierre A.","family":"Humblet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stuart R.","family":"Soloway","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0169-7552(89)90066-4_BIB1","unstructured":"B. Awerbuch, Optimal Distributed Algorithms for Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems, Extended Abstract, M.I.T. Laboratory for Computer Science, undated."},{"key":"10.1016\/0169-7552(89)90066-4_BIB2","series-title":"Technical Report 128","article-title":"Broadcast Protocols in Packet Switched Computer Networks","author":"Dalal","year":"1977"},{"key":"10.1016\/0169-7552(89)90066-4_BIB3","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1109\/TCOM.1979.1094473","article-title":"Resynch Procedures and a Fail-safe Network Protocol","volume":"27","author":"Finn","year":"1979","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/0169-7552(89)90066-4_BIB4","series-title":"A Shortest Path Algorithm With Automatic Resync","author":"Gallager","year":"1976"},{"key":"10.1016\/0169-7552(89)90066-4_BIB5","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/357195.357200","article-title":"A Distributed Algorithm for Minimum Weight Spanning Trees","volume":"5","author":"Gallager","year":"1983","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/0169-7552(89)90066-4_BIB6","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1109\/TCOM.1983.1095883","article-title":"A Distributed Algorithm for Minimum Weight Directed Spanning Trees","volume":"31","author":"Humblet","year":"1983","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/0169-7552(89)90066-4_BIB7","series-title":"Algorithms for Data Communication Networks - Parts 1 and 2","author":"Humblet","year":"1986"},{"key":"10.1016\/0169-7552(89)90066-4_BIB8","doi-asserted-by":"crossref","DOI":"10.1109\/TCOM.1980.1094721","article-title":"The New Routing Algorithm for the ARPANET","volume":"28","author":"McQuillan","year":"1980","journal-title":"IEEE Transactions on Communications"},{"key":"10.1016\/0169-7552(89)90066-4_BIB9","series-title":"Proc. IEEE Infocom '83","article-title":"Fault-Tolerant Broadcast of Routing Information","author":"Perlman","year":"1983"},{"issue":"1","key":"10.1016\/0169-7552(89)90066-4_BIB10","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1983.1056620","article-title":"Distributed Network Protocols","volume":"29","author":"Segall","year":"1983","journal-title":"IEEE Transactions on Information Theory"},{"key":"10.1016\/0169-7552(89)90066-4_BIB11","doi-asserted-by":"crossref","unstructured":"J. Spinelli, Event Driven Topology Broadcast without Sequence Numbers, IEEE Transactions on Communications, to appear.","DOI":"10.1109\/26.24597"}],"container-title":["Computer Networks and ISDN Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169755289900664?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0169755289900664?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T07:21:06Z","timestamp":1552634466000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0169755289900664"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["0169755289900664"],"URL":"https:\/\/doi.org\/10.1016\/0169-7552(89)90066-4","relation":{},"ISSN":["0169-7552"],"issn-type":[{"value":"0169-7552","type":"print"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}