乐胖代购免代理版

{"id":"https://openalex.org/W1793047635","doi":"https://doi.org/10.1109/icpp.1998.708471","title":"Routing algorithms for anycast messages","display_name":"Routing algorithms for anycast messages","publication_year":2002,"publication_date":"2002-11-27","ids":{"openalex":"https://openalex.org/W1793047635","doi":"https://doi.org/10.1109/icpp.1998.708471","mag":"1793047635"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.1998.708471","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false},"type":"article","type_crossref":"proceedings-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/A5101805063","display_name":"Dong Xuan","orcid":"https://orcid.org/0009-0008-5223-7428"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"funder","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"None Dong Xuan","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051803761","display_name":"Weijia Jia","orcid":"https://orcid.org/0000-0002-0231-3196"},"institutions":[{"id":"https://openalex.org/I168719708","display_name":"City University of Hong Kong","ror":"https://ror.org/03q8dnn23","country_code":"HK","type":"funder","lineage":["https://openalex.org/I168719708"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"None Weijia Jia","raw_affiliation_strings":["Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, City University of Hong Kong, Kowloon, Hong Kong, China","institution_ids":["https://openalex.org/I168719708"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002311337","display_name":"Wei Zhao","orcid":"https://orcid.org/0000-0002-6268-2559"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"funder","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"None Wei Zhao","raw_affiliation_strings":["Department of Computer Science, Texas A and M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Texas A and M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institution_assertions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.491,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":15,"citation_normalized_percentile":{"value":0.833987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":83,"max":84},"biblio":{"volume":null,"issue":null,"first_page":"122","last_page":"130"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9999,"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.9999,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9998,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9995,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/unicast","display_name":"Unicast","score":0.77323025},{"id":"https://openalex.org/keywords/anycast","display_name":"Anycast","score":0.6320531},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.50448334}],"concepts":[{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.77323025},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7648156},{"id":"https://openalex.org/C122005561","wikidata":"https://www.wikidata.org/wiki/Q613897","display_name":"Anycast","level":3,"score":0.6320531},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6303388},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.60574824},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.5403256},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5242679},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.50448334},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5015836},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.4887757},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.48053938},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.42832333},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.41641793},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.41229582},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.37778524},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3651522},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.14322081},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.078769475},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07199451},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.1998.708471","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false}],"best_oa_location":null,"sustainable_development_goals":[],"grants":[],"datasets":[],"versions":[],"referenced_works_count":32,"referenced_works":["https://openalex.org/W1489830740","https://openalex.org/W1538002404","https://openalex.org/W1786926183","https://openalex.org/W1857703786","https://openalex.org/W1966086139","https://openalex.org/W1986215185","https://openalex.org/W1995945562","https://openalex.org/W1997996213","https://openalex.org/W2021136283","https://openalex.org/W2031887679","https://openalex.org/W2042633944","https://openalex.org/W2063029333","https://openalex.org/W2090138028","https://openalex.org/W2096322909","https://openalex.org/W2096704096","https://openalex.org/W2109233419","https://openalex.org/W2117007245","https://openalex.org/W2120450054","https://openalex.org/W2121756644","https://openalex.org/W2142793498","https://openalex.org/W2143063000","https://openalex.org/W2151250580","https://openalex.org/W2152530926","https://openalex.org/W2155779166","https://openalex.org/W2158052609","https://openalex.org/W2169528473","https://openalex.org/W2248064281","https://openalex.org/W2795939803","https://openalex.org/W2997896042","https://openalex.org/W3161268770","https://openalex.org/W3161295396","https://openalex.org/W4241305028"],"related_works":["https://openalex.org/W3203760565","https://openalex.org/W2607223747","https://openalex.org/W2555559350","https://openalex.org/W2361465121","https://openalex.org/W2355320194","https://openalex.org/W2121931036","https://openalex.org/W2081964190","https://openalex.org/W2036930058","https://openalex.org/W1988508308","https://openalex.org/W1976978163"],"abstract_inverted_index":{"We":[0,122],"propose":[1],"and":[2,26,52,64,79,113,129],"analyze":[3],"three":[4],"routing":[5,12,20,47,120],"algorithms":[6,54,81,109],"for":[7,46,132],"anycast":[8,61],"packets:":[9],"source-destination":[10],"based":[11,19],"with":[13,21,115],"weighted":[14,22],"random":[15,23],"selection":[16,24],"(SD/WRS);":[17],"destination":[18],"(D/WRS);":[25],"the":[27,42,77,116,126],"shortest":[28,29],"path":[30],"first":[31],"(SSPF)":[32],"algorithms.":[33,134],"The":[34,50],"SSPF":[35,86],"algorithm":[36,45,104],"is":[37],"a":[38,69,101],"simple":[39],"extension":[40],"to":[41,100],"traditional":[43],"SPF":[44],"unicast":[48],"packets.":[49],"SD/WRS":[51,78,96],"D/WRS":[53,80],"explicitly":[55],"take":[56],"into":[57],"account":[58],"characteristics":[59],"of":[60,89,118],"message":[62],"traffic":[63],"its":[65],"recipient":[66],"group.":[67],"As":[68],"result,":[70],"our":[71,133],"simulation":[72],"study":[73],"shows":[74],"that":[75],"both":[76],"perform":[82],"much":[83],"better":[84],"than":[85],"in":[87,105],"terms":[88],"average":[90],"end-to-end":[91],"packet":[92],"delay.":[93],"In":[94],"particular,":[95],"performs":[97],"very":[98],"close":[99],"dynamic":[102],"optimal":[103],"most":[106,117],"cases.":[107],"Our":[108],"are":[110],"simple,":[111],"efficient":[112],"compatible":[114],"existing":[119],"technologies.":[121],"also":[123],"formally":[124],"prove":[125],"loop":[127],"free":[128],"correctness":[130],"properties":[131]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1793047635","counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-04-20T04:48:08.427251","created_date":"2016-06-24"}