{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:08:17Z","timestamp":1761588497167,"version":"build-2065373602"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Commun. Netw."],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1109\/jcn.2007.6182886","type":"journal-article","created":{"date-parts":[[2013,8,30]],"date-time":"2013-08-30T16:25:47Z","timestamp":1377879947000},"page":"499-510","source":"Crossref","is-referenced-by-count":14,"title":["An efficient algorithm for dynamic shortest path tree update in network routing"],"prefix":"10.23919","volume":"9","author":[{"given":"Bin","family":"Xiao","sequence":"first","affiliation":[{"name":"Hong Kong Polytechnic University, Hong Kong"}]},{"given":"Jiannong","family":"Cao","sequence":"additional","affiliation":[{"name":"Hong Kong Polytechnic University, Hong Kong"}]},{"given":"Zili","family":"Shao","sequence":"additional","affiliation":[{"name":"Hong Kong Polytechnic University, Hong Kong"}]},{"given":"Edwin H.-M.","family":"Sha","sequence":"additional","affiliation":[{"name":"University of Texas at Dallas, USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.815294"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/71.722218"},{"key":"ref12","first-page":"123","article-title":"Destination-driven shortest path tree algorithms","volume":"15","author":"zhang","year":"2006","journal-title":"J High Speed Netw"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2003.1167368"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/70.370502"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","article-title":"On a routing problem","volume":"16","author":"bellman","year":"1958","journal-title":"Quarterly Appl Math"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019335"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814580"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-002-0988-z"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/65.898822"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.810317"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2004.07.016"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/90.993304"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(03)00322-0"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.17487\/rfc1583","article-title":"OSPF version 2","author":"moy","year":"1994"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2004.06.022"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(03)00346-3"},{"key":"ref20","first-page":"212","article-title":"Fully dynamic output bounded single source shortest path problem","author":"frigioni","year":"1998","journal-title":"Proc 7th Annu ACM-SIAM Symp Discrete Algorithms"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/90.893870"},{"key":"ref21","first-page":"1163","article-title":"Shortest path tree update for multiple link state decrements","author":"xiao","year":"2004","journal-title":"Proc IEEE GBOLECOM"},{"key":"ref24","first-page":"1062","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/90.974525"}],"container-title":["Journal of Communications and Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5449605\/6182865\/06182886.pdf?arnumber=6182886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:03:55Z","timestamp":1761588235000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6182886\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":24,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/jcn.2007.6182886","relation":{},"ISSN":["1976-5541","1229-2370"],"issn-type":[{"type":"electronic","value":"1976-5541"},{"type":"print","value":"1229-2370"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}