{"id":"https://openalex.org/W2117051214","doi":"https://doi.org/10.1109/jcn.2007.6182886","title":"An efficient algorithm for dynamic shortest path tree update in network routing","display_name":"An efficient algorithm for dynamic shortest path tree update in network routing","publication_year":2007,"publication_date":"2007-12-01","ids":{"openalex":"https://openalex.org/W2117051214","doi":"https://doi.org/10.1109/jcn.2007.6182886","mag":"2117051214"},"language":"en","primary_location":{"id":"doi:10.1109/jcn.2007.6182886","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jcn.2007.6182886","pdf_url":null,"source":{"id":"https://openalex.org/S173102057","display_name":"Journal of Communications and Networks","issn_l":"1229-2370","issn":["1229-2370","1976-5541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Communications and Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"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":["Hong Kong Polytechnic University, Hong Kong","Hong Kong Polytech. Univ., Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Hong Kong Polytechnic University, Hong Kong","institution_ids":["https://openalex.org/I14243506"]},{"raw_affiliation_string":"Hong Kong Polytech. Univ., Hong Kong, 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":["Hong Kong Polytechnic University, Hong Kong","Hong Kong Polytech. Univ., Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Hong Kong Polytechnic University, Hong Kong","institution_ids":["https://openalex.org/I14243506"]},{"raw_affiliation_string":"Hong Kong Polytech. Univ., Hong Kong, China","institution_ids":["https://openalex.org/I14243506"]}]},{"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/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":"Zili Shao","raw_affiliation_strings":["Hong Kong Polytechnic University, Hong Kong","Hong Kong Polytech. Univ., Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Hong Kong Polytechnic University, Hong Kong","institution_ids":["https://openalex.org/I14243506"]},{"raw_affiliation_string":"Hong Kong Polytech. Univ., Hong Kong, China","institution_ids":["https://openalex.org/I14243506"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077381252","display_name":"Edwin H.\u2010M. Sha","orcid":"https://orcid.org/0000-0001-5605-5631"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Edwin H.-M. Sha","raw_affiliation_strings":["University of Texas at Dallas, USA","University of Texas at Dallas, Dallas, TX, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Dallas, USA","institution_ids":[]},{"raw_affiliation_string":"University of Texas at Dallas, Dallas, TX, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100365935"],"corresponding_institution_ids":["https://openalex.org/I14243506"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.16240797,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"4","first_page":"499","last_page":"510"},"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.9980999827384949,"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.9980999827384949,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9976000189781189,"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"}},{"id":"https://openalex.org/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9947999715805054,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.7887716889381409},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6854127645492554},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.5829770565032959},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5345040559768677},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5164794921875},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4725325405597687},{"id":"https://openalex.org/keywords/redundancy","display_name":"Redundancy (engineering)","score":0.457522988319397},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4571111500263214},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4312910735607147},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4271222949028015},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42438822984695435},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.42409634590148926},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4101768136024475},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3636411726474762},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30197465419769287},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3018009662628174},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1685139238834381},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12389421463012695}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7887716889381409},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6854127645492554},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.5829770565032959},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5345040559768677},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5164794921875},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4725325405597687},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.457522988319397},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4571111500263214},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4312910735607147},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4271222949028015},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42438822984695435},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.42409634590148926},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4101768136024475},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3636411726474762},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30197465419769287},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3018009662628174},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1685139238834381},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12389421463012695},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/jcn.2007.6182886","is_oa":false,"landing_page_url":"https://doi.org/10.1109/jcn.2007.6182886","pdf_url":null,"source":{"id":"https://openalex.org/S173102057","display_name":"Journal of Communications and Networks","issn_l":"1229-2370","issn":["1229-2370","1976-5541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Communications and Networks","raw_type":"journal-article"},{"id":"pmh:oai:ira.lib.polyu.edu.hk:10397/23126","is_oa":false,"landing_page_url":"http://hdl.handle.net/10397/23126","pdf_url":null,"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":"","raw_type":"Journal/Magazine Article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.6899999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1554407673","https://openalex.org/W1714480694","https://openalex.org/W1965804571","https://openalex.org/W2007776707","https://openalex.org/W2024392310","https://openalex.org/W2037348066","https://openalex.org/W2061208844","https://openalex.org/W2098754127","https://openalex.org/W2102334244","https://openalex.org/W2132523953","https://openalex.org/W2135810626","https://openalex.org/W2142065670","https://openalex.org/W2151023849","https://openalex.org/W2152220755","https://openalex.org/W2158701168","https://openalex.org/W2161835730","https://openalex.org/W2163907500","https://openalex.org/W2166992263","https://openalex.org/W2169528473","https://openalex.org/W2169939394","https://openalex.org/W2180824136","https://openalex.org/W2227557434","https://openalex.org/W2248064281","https://openalex.org/W2753693129","https://openalex.org/W3145128584","https://openalex.org/W4238664085","https://openalex.org/W6637719942","https://openalex.org/W6666008577"],"related_works":["https://openalex.org/W2962525871","https://openalex.org/W2523719706","https://openalex.org/W2381419702","https://openalex.org/W1562631103","https://openalex.org/W1990043277","https://openalex.org/W4223969905","https://openalex.org/W2198982833","https://openalex.org/W2170980056","https://openalex.org/W4310124294","https://openalex.org/W2541249923"],"abstract_inverted_index":{"Shortest":[0],"path":[1,67],"tree":[2,68,131],"(SPT)":[3],"construction":[4,157],"is":[5,46,71,108,139,171],"essential":[6],"in":[7,11,37,155,188],"high":[8],"performance":[9],"routing":[10,55],"an":[12,82,100,129],"interior":[13],"network":[14,45],"using":[15,94],"link":[16],"state":[17,24],"protocols.":[18],"When":[19],"some":[20],"links":[21],"have":[22],"new":[23,62,87,160],"values,":[25],"SPTs":[26],"may":[27],"be":[28,180],"rebuilt,":[29],"but":[30],"the":[31,35,77,103,143,156,184],"total":[32],"rebuilding":[33],"of":[34,119,158],"SPT":[36,84,185],"a":[38,42,61,86,95,111,159,189],"static":[39],"way":[40],"for":[41],"large":[43],"computer":[44],"not":[47,153],"only":[48],"computationally":[49,72],"expensive,":[50],"unnecessary":[51],"modifications":[52],"can":[53,178],"cause":[54],"table":[56],"instability.":[57],"This":[58],"paper":[59],"presents":[60],"update":[63,97,134],"algorithm,":[64],"dynamic":[65,96],"shortest":[66],"(DSPT)":[69],"that":[70,75,151,169],"economical":[73],"and":[74,165],"maintains":[76],"unmodified":[78],"nodes":[79],"mostly":[80],"from":[81,110,136],"old":[83],"to":[85,182],"SPT.":[88,161],"The":[89,116],"proposed":[90],"algorithm":[91,145],"reduces":[92],"redundancy":[93],"approach":[98],"where":[99],"edge":[101,105,113],"becomes":[102],"significant":[104,120,137],"when":[106],"it":[107],"extracted":[109],"built":[112],"list":[114],"Q.":[115],"average":[117],"number":[118],"edges":[121,138,150],"are":[122],"identified":[123],"through":[124],"probability":[125],"analysis":[126,164],"based":[127],"on":[128],"arbitrary":[130],"structure.":[132],"An":[133],"derived":[135],"more":[140],"efficient":[141],"because":[142],"DSPT":[144,170],"neglect":[146],"most":[147],"other":[148,174],"redundant":[149],"do":[152],"participate":[154],"Our":[162],"complexity":[163],"experimental":[166],"results":[167],"show":[168],"faster":[172],"than":[173],"known":[175],"methods.":[176],"It":[177],"also":[179],"extended":[181],"solve":[183],"updating":[186],"problem":[187],"graph":[190],"with":[191],"negative":[192],"weight":[193],"edges.":[194]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}