{"id":"https://openalex.org/W1546782532","doi":"https://doi.org/10.1109/icon.2004.1409216","title":"Shortest paths in stochastic networks","display_name":"Shortest paths in stochastic networks","publication_year":2005,"publication_date":"2005-04-12","ids":{"openalex":"https://openalex.org/W1546782532","doi":"https://doi.org/10.1109/icon.2004.1409216","mag":"1546782532"},"language":"en","primary_location":{"id":"doi:10.1109/icon.2004.1409216","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icon.2004.1409216","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955)","raw_type":"proceedings-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/A5028461874","display_name":"Bill Lloyd-Smith","orcid":null},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"B. Lloyd-Smith","raw_affiliation_strings":["Sch. of Comput. Sci. & Inf. Technol., RMIT Univ., Melbourne, Vic., Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sch. of Comput. Sci. & Inf. Technol., RMIT Univ., Melbourne, Vic., Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001918018","display_name":"Alexander A. Kist","orcid":"https://orcid.org/0000-0001-9105-7050"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"A.A. Kist","raw_affiliation_strings":["Centre for Advanced Technology in Telecommunications, RMIT University, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Advanced Technology in Telecommunications, RMIT University, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002757843","display_name":"Richard Harris","orcid":"https://orcid.org/0000-0001-7943-9005"},"institutions":[{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"R.J. Harris","raw_affiliation_strings":["Centre for Advanced Technology in Telecommunications, RMIT University, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centre for Advanced Technology in Telecommunications, RMIT University, Australia","institution_ids":["https://openalex.org/I82951845"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053054325","display_name":"Nirisha Shrestha","orcid":null},"institutions":[{"id":"https://openalex.org/I99043593","display_name":"Macquarie University","ror":"https://ror.org/01sf06y89","country_code":"AU","type":"education","lineage":["https://openalex.org/I99043593"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"N. Shrestha","raw_affiliation_strings":["Department of Computing, Macquarie University, North Ryde, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, Macquarie University, North Ryde, Australia","institution_ids":["https://openalex.org/I99043593"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.08921308,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"492","last_page":"496"},"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.9997000098228455,"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.9997000098228455,"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9908000230789185,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8105025291442871},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.718431830406189},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6146354675292969},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.614044189453125},{"id":"https://openalex.org/keywords/sensitivity","display_name":"Sensitivity (control systems)","score":0.5983344316482544},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5806553363800049},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5773063898086548},{"id":"https://openalex.org/keywords/link","display_name":"Link (geometry)","score":0.5704283118247986},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.49913620948791504},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4921228289604187},{"id":"https://openalex.org/keywords/average-path-length","display_name":"Average path length","score":0.47313395142555237},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.46796756982803345},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.46022990345954895},{"id":"https://openalex.org/keywords/probability-distribution","display_name":"Probability distribution","score":0.4506252110004425},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43956854939460754},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3682350814342499},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.35808777809143066},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.34380072355270386},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.31914234161376953},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30929258465766907},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.21533575654029846},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.14446023106575012},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12103554606437683},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11402282118797302},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10570621490478516}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8105025291442871},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.718431830406189},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6146354675292969},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.614044189453125},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.5983344316482544},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5806553363800049},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5773063898086548},{"id":"https://openalex.org/C2778753846","wikidata":"https://www.wikidata.org/wiki/Q6554239","display_name":"Link (geometry)","level":2,"score":0.5704283118247986},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.49913620948791504},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4921228289604187},{"id":"https://openalex.org/C91886571","wikidata":"https://www.wikidata.org/wiki/Q432520","display_name":"Average path length","level":4,"score":0.47313395142555237},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.46796756982803345},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.46022990345954895},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.4506252110004425},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43956854939460754},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3682350814342499},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.35808777809143066},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.34380072355270386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31914234161376953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30929258465766907},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.21533575654029846},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14446023106575012},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12103554606437683},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11402282118797302},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10570621490478516},{"id":"https://openalex.org/C24326235","wikidata":"https://www.wikidata.org/wiki/Q126095","display_name":"Electronic engineering","level":1,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icon.2004.1409216","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icon.2004.1409216","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 2004 12th IEEE International Conference on Networks (ICON 2004) (IEEE Cat. No.04EX955)","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.usq.edu.au:7267","is_oa":false,"landing_page_url":"http://eprints.usq.edu.au/7267/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400692","display_name":"University of Southern Queensland ePrints (University of Southern Queensland)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I185523456","host_organization_name":"University of Southern Queensland","host_organization_lineage":["https://openalex.org/I185523456"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference or Workshop Item (Commonwealth Reporting Category E)"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1492947302","https://openalex.org/W1560853093","https://openalex.org/W2062014422","https://openalex.org/W2064975723","https://openalex.org/W2075793153","https://openalex.org/W2111022489","https://openalex.org/W2120608001","https://openalex.org/W2121842672","https://openalex.org/W2162689181","https://openalex.org/W2243986870","https://openalex.org/W2751862591","https://openalex.org/W2790825170","https://openalex.org/W2801319052","https://openalex.org/W2972424502","https://openalex.org/W3014841294"],"related_works":["https://openalex.org/W2154023691","https://openalex.org/W1997440971","https://openalex.org/W2962525871","https://openalex.org/W2357391150","https://openalex.org/W2388051136","https://openalex.org/W2161960576","https://openalex.org/W2541249923","https://openalex.org/W2392001488","https://openalex.org/W2353596372","https://openalex.org/W2359578922"],"abstract_inverted_index":{"This":[0],"paper":[1],"discusses":[2],"the":[3,20,26,39,65,83],"sensitivity":[4,66],"of":[5,22,41,67],"network":[6,32],"flows":[7],"to":[8,63,70],"uncertain":[9],"link":[10,27,72],"state":[11],"information":[12],"for":[13,25,29,48,60,78],"various":[14],"routing":[15],"protocols.":[16],"We":[17,56,75],"show":[18],"that":[19],"choice":[21],"probability":[23],"distribution":[24],"metrics":[28],"a":[30,88],"given":[31],"can":[33],"have":[34],"markedly":[35],"different":[36,71],"effects":[37],"on":[38],"probabilities":[40,50],"path":[42,80,85],"selection.":[43],"Exact":[44],"results":[45,59,77],"are":[46],"obtained":[47],"these":[49],"but":[51],"their":[52],"computation":[53],"is":[54],"NP-hard.":[55],"provide":[57,76],"simulation":[58],"three":[61],"networks":[62],"illustrate":[64],"shortest":[68],"paths":[69],"metric":[73],"distributions.":[74],"mean":[79],"costs":[81],"and":[82],"k-shortest":[84],"algorithm":[86],"as":[87],"comparison.":[89]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}