{"id":"https://openalex.org/W2133012247","doi":"https://doi.org/10.1109/ispan.2004.1300451","title":"Dynamic update of shortest path tree in OSPF","display_name":"Dynamic update of shortest path tree in OSPF","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2133012247","doi":"https://doi.org/10.1109/ispan.2004.1300451","mag":"2133012247"},"language":"en","primary_location":{"id":"doi:10.1109/ispan.2004.1300451","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2004.1300451","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://ira.lib.polyu.edu.hk/bitstream/10397/793/1/shortest-path_04.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100365935","display_name":"Bin Xiao","orcid":"https://orcid.org/0000-0003-4223-8220"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Bin Xiao","raw_affiliation_strings":["Department of Computing, Hong Kong Polytechnic University, Hong Kong, China","Dept. of Comput., Hong Kong Polytech. Univ., Kowloon, China"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Hong Kong Polytechnic University, Hong Kong, China","institution_ids":["https://openalex.org/I14243506"]},{"raw_affiliation_string":"Dept. of Comput., Hong Kong Polytech. Univ., Kowloon, China","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100740023","display_name":"Jiannong Cao","orcid":"https://orcid.org/0000-0002-2725-2529"},"institutions":[{"id":"https://openalex.org/I14243506","display_name":"Hong Kong Polytechnic University","ror":"https://ror.org/0030zas98","country_code":"HK","type":"education","lineage":["https://openalex.org/I14243506"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Jiannong Cao","raw_affiliation_strings":["Department of Computing, Hong Kong Polytechnic University, Hong Kong, China","Dept. of Comput., Hong Kong Polytech. Univ., Kowloon, China"],"affiliations":[{"raw_affiliation_string":"Department of Computing, Hong Kong Polytechnic University, Hong Kong, China","institution_ids":["https://openalex.org/I14243506"]},{"raw_affiliation_string":"Dept. of Comput., Hong Kong Polytech. Univ., Kowloon, China","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5005358696","display_name":"Qingfeng Zhuge","orcid":"https://orcid.org/0000-0002-1107-3470"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Qingfeng Zhuge","raw_affiliation_strings":["Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","University of Texas at Dallas"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"University of Texas at Dallas","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101639532","display_name":"Zili Shao","orcid":"https://orcid.org/0000-0002-2173-2847"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zili Shao","raw_affiliation_strings":["Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","University of Texas at Dallas"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"University of Texas at Dallas","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077381252","display_name":"Edwin H.\u2010M. Sha","orcid":"https://orcid.org/0000-0001-5605-5631"},"institutions":[{"id":"https://openalex.org/I162577319","display_name":"The University of Texas at Dallas","ror":"https://ror.org/049emcs32","country_code":"US","type":"education","lineage":["https://openalex.org/I162577319"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"E.H.M. Sha","raw_affiliation_strings":["Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","Computer Science, Software Engineering, Computer Engineering"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]},{"raw_affiliation_string":"Computer Science, Software Engineering, Computer Engineering","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5100365935"],"corresponding_institution_ids":["https://openalex.org/I14243506"],"apc_list":null,"apc_paid":null,"fwci":1.745,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.87923697,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"16","issue":null,"first_page":"18","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.8347090482711792},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6908263564109802},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6821255683898926},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6259486675262451},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5361274480819702},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5147268772125244},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5111282467842102},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.48404306173324585},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4812159836292267},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.47813308238983154},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.46077248454093933},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4244576692581177},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41747069358825684},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.37709522247314453},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.36054426431655884},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.34746426343917847},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2748120427131653},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.2333555519580841},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1418919861316681}],"concepts":[{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.8347090482711792},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6908263564109802},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6821255683898926},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6259486675262451},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5361274480819702},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5147268772125244},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5111282467842102},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.48404306173324585},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4812159836292267},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.47813308238983154},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.46077248454093933},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4244576692581177},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41747069358825684},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.37709522247314453},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.36054426431655884},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.34746426343917847},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2748120427131653},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.2333555519580841},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1418919861316681},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/ispan.2004.1300451","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispan.2004.1300451","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:ira.lib.polyu.edu.hk:10397/793","is_oa":true,"landing_page_url":"http://hdl.handle.net/10397/793","pdf_url":"http://ira.lib.polyu.edu.hk/bitstream/10397/793/1/shortest-path_04.pdf","source":{"id":"https://openalex.org/S4306400205","display_name":"PolyU Institutional Research Archive (Hong Kong Polytechnic University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I14243506","host_organization_name":"Hong Kong Polytechnic University","host_organization_lineage":["https://openalex.org/I14243506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Paper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.330.4126","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.330.4126","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www4.comp.polyu.edu.hk/~csbxiao/paper/2004/ISPAN04_spt.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.412.202","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.412.202","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.utdallas.edu/~edsha/papers/bin/ISPAN04_spt.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:ira.lib.polyu.edu.hk:10397/793","is_oa":true,"landing_page_url":"http://hdl.handle.net/10397/793","pdf_url":"http://ira.lib.polyu.edu.hk/bitstream/10397/793/1/shortest-path_04.pdf","source":{"id":"https://openalex.org/S4306400205","display_name":"PolyU Institutional Research Archive (Hong Kong Polytechnic University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I14243506","host_organization_name":"Hong Kong Polytechnic University","host_organization_lineage":["https://openalex.org/I14243506"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Paper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2133012247.pdf","grobid_xml":"https://content.openalex.org/works/W2133012247.grobid-xml"},"referenced_works_count":14,"referenced_works":["https://openalex.org/W1920977060","https://openalex.org/W1947367101","https://openalex.org/W1998662322","https://openalex.org/W2061208844","https://openalex.org/W2098754127","https://openalex.org/W2119673702","https://openalex.org/W2132523953","https://openalex.org/W2135810626","https://openalex.org/W2150444597","https://openalex.org/W2161835730","https://openalex.org/W2163907500","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W6666008577"],"related_works":["https://openalex.org/W2523719706","https://openalex.org/W2198982833","https://openalex.org/W2375775343","https://openalex.org/W4293054712","https://openalex.org/W2161960576","https://openalex.org/W2962525871","https://openalex.org/W2167426328","https://openalex.org/W2357391150","https://openalex.org/W2365712669","https://openalex.org/W2358754422"],"abstract_inverted_index":{"The":[0,58,91,112],"shortest":[1,26],"path":[2,27],"tree":[3],"(SPT)":[4],"construction":[5,80],"is":[6,61,96,119,123],"a":[7,37,142],"critical":[8],"issue":[9],"to":[10,45,70,78,103,135,150],"the":[11,47,64,67,79,85,104,109,116,137,151],"high":[12],"performance":[13],"routing":[14],"in":[15,141],"an":[16],"interior":[17],"network":[18],"using":[19],"link":[20],"state":[21],"protocols,":[22],"such":[23],"as":[24],"open":[25],"first":[28],"(OSPF)":[29],"and":[30,148],"IS-IS.":[31],"In":[32],"this":[33],"paper,":[34],"we":[35],"propose":[36],"new":[38,59,82],"efficient":[39],"algorithm":[40,60,95,118,130],"for":[41,108,115],"dynamic":[42],"SPT":[43,55,83,138],"update":[44,56,68,110],"avoid":[46],"disadvantages":[48],"(e.g.":[49],"redundant":[50],"computation)":[51],"caused":[52],"by":[53],"static":[54],"algorithms.":[57],"based":[62],"on":[63],"understanding":[65],"of":[66,81,93,153],"procedure":[69],"reduce":[71],"redundancy.":[72],"Only":[73],"significant":[74],"elements":[75],"that":[76],"contribute":[77],"from":[84],"old":[86],"one":[87],"are":[88],"focused":[89],"on.":[90],"efficiency":[92],"our":[94,129],"improved":[97],"because":[98],"it":[99],"only":[100],"pay":[101],"attention":[102],"edges":[105,147],"really":[106],"count":[107],"process.":[111],"running":[113],"time":[114],"proposed":[117],"maximum":[120],"reduced,":[121],"which":[122],"shown":[124],"through":[125],"experimental":[126],"results.":[127],"Furthermore,":[128],"can":[131],"be":[132],"easily":[133],"generalized":[134],"solve":[136],"updating":[139],"problem":[140],"graph":[143],"with":[144],"negative":[145],"weight":[146,156],"applied":[149],"scenario":[152],"multiple":[154],"edge":[155],"changes.":[157]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}