{"id":"https://openalex.org/W2158701168","doi":"https://doi.org/10.1109/glocom.2004.1378139","title":"Dynamic shortest path tree update for multiple link state decrements","display_name":"Dynamic shortest path tree update for multiple link state decrements","publication_year":2005,"publication_date":"2005-04-05","ids":{"openalex":"https://openalex.org/W2158701168","doi":"https://doi.org/10.1109/glocom.2004.1378139","mag":"2158701168"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2004.1378139","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2004.1378139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://ira.lib.polyu.edu.hk/bitstream/10397/797/1/path-tree-update_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":false,"raw_author_name":"Bin Xiao","raw_affiliation_strings":["Department of Computing, Hong Kong Polytechnic University, Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, Hong Kong Polytechnic University, 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":["Department of Computing, Hong Kong Polytechnic University, Hong Kong, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, Hong Kong Polytechnic University, Hong Kong, 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":"Q. Zhuge","raw_affiliation_strings":["Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]},{"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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas, Dallas, Richardson, TX, USA","institution_ids":["https://openalex.org/I162577319"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1163","last_page":"1167"},"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.9991999864578247,"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.9991999864578247,"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.9991999864578247,"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.9973000288009644,"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/node","display_name":"Node (physics)","score":0.7378075122833252},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6990877389907837},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5314691662788391},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5260990858078003},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5153021812438965},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5099378824234009},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.507902204990387},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4799811542034149},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.42974767088890076},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4146224558353424},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3112725019454956},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3021153211593628},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.27431225776672363},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17910975217819214},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.13552555441856384},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0896424949169159}],"concepts":[{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.7378075122833252},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6990877389907837},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5314691662788391},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5260990858078003},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5153021812438965},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5099378824234009},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.507902204990387},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4799811542034149},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.42974767088890076},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4146224558353424},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3112725019454956},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3021153211593628},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.27431225776672363},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17910975217819214},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13552555441856384},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0896424949169159},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/glocom.2004.1378139","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2004.1378139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Global Telecommunications Conference, 2004. GLOBECOM '04.","raw_type":"proceedings-article"},{"id":"pmh:oai:ira.lib.polyu.edu.hk:10397/797","is_oa":true,"landing_page_url":"http://hdl.handle.net/10397/797","pdf_url":"http://ira.lib.polyu.edu.hk/bitstream/10397/797/1/path-tree-update_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.411.6995","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.411.6995","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/Globecom04_SPT.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:ira.lib.polyu.edu.hk:10397/797","is_oa":true,"landing_page_url":"http://hdl.handle.net/10397/797","pdf_url":"http://ira.lib.polyu.edu.hk/bitstream/10397/797/1/path-tree-update_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":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W2158701168.pdf"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W49567615","https://openalex.org/W1671669295","https://openalex.org/W1947367101","https://openalex.org/W1998662322","https://openalex.org/W2023396430","https://openalex.org/W2102334244","https://openalex.org/W2132523953","https://openalex.org/W2135810626","https://openalex.org/W2150444597","https://openalex.org/W6602067033","https://openalex.org/W6637410273","https://openalex.org/W6656625896"],"related_works":["https://openalex.org/W1518185400","https://openalex.org/W3200586296","https://openalex.org/W4230332972","https://openalex.org/W1998033311","https://openalex.org/W4247322236","https://openalex.org/W4231165741","https://openalex.org/W233457313","https://openalex.org/W4295104149","https://openalex.org/W1762272577","https://openalex.org/W1985727224"],"abstract_inverted_index":{"Previous":[0],"approaches":[1],"for":[2,39,91,98,112],"the":[3,14,27,89,99,116,126,136],"shortest":[4],"path":[5],"tree":[6],"(SPT)":[7],"dynamic":[8,81,117],"update":[9,101,118],"have":[10],"mainly":[11],"focused":[12],"on":[13,26,35,135],"case":[15],"of":[16,29,54,64,102,128],"one":[17,38],"link":[18,41],"state":[19,42],"change.":[20],"Little":[21],"work":[22],"has":[23],"been":[24],"done":[25],"problem":[28,56],"deriving":[30],"a":[31,45,133,139,144],"new":[32],"SPT":[33,100,137],"based":[34],"its":[36],"old":[37],"multiple":[40,75,103],"decrements":[43,76],"in":[44,69,132],"network":[46],"that":[47,74],"applies":[48],"link-state":[49],"routing":[50],"protocols.":[51],"The":[52],"complexity":[53],"this":[55],"comes":[57],"from":[58,143],"there":[59],"being":[60],"no":[61],"accurate":[62],"boundary":[63],"nodes":[65],"to":[66,87,152],"be":[67,78],"updated":[68],"an":[70,121],"updating":[71,131],"process":[72],"and":[73],"can":[77],"accumulated.":[79],"Two":[80],"algorithms":[82,97,108],"(MaxR,":[83],"MinD)":[84],"are":[85,150],"proposed":[86],"reduce":[88],"times":[90,111],"node":[92,113,130,141,146],"updating.":[93],"Compared":[94],"with":[95],"other":[96],"edge":[104],"weight":[105],"decrements,":[106],"our":[107,154],"yield":[109],"fewer":[110],"updates":[114],"during":[115],"process.":[119],"Such":[120],"achievement":[122],"is":[123],"attained":[124],"by":[125],"mechanism":[127],"part":[129],"branch":[134],"after":[138],"particular":[140],"selection":[142],"built":[145],"list.":[147],"Simulation":[148],"results":[149],"given":[151],"show":[153],"improvements.":[155]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}