乐胖代购免代理版

{"id":"https://openalex.org/W2124726667","doi":"https://doi.org/10.1109/icccn.1997.623338","title":"Heuristic algorithms for path selection in private ATM networks","display_name":"Heuristic algorithms for path selection in private ATM networks","publication_year":2002,"publication_date":"2002-11-22","ids":{"openalex":"https://openalex.org/W2124726667","doi":"https://doi.org/10.1109/icccn.1997.623338","mag":"2124726667"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.1997.623338","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/A5110642069","display_name":"Xuedong Jiang","orcid":null},"institutions":[{"id":"https://openalex.org/I129902397","display_name":"Dalhousie University","ror":"https://ror.org/01e6qks80","country_code":"CA","type":"funder","lineage":["https://openalex.org/I129902397"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"None Xuedong Jiang","raw_affiliation_strings":["Industrial Engineering Department DalTech, Dalhousie University, Halifax, NS, Canada"],"affiliations":[{"raw_affiliation_string":"Industrial Engineering Department DalTech, Dalhousie University, Halifax, NS, Canada","institution_ids":["https://openalex.org/I129902397"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103088331","display_name":"Tao Yang","orcid":"https://orcid.org/0000-0002-9838-4561"},"institutions":[{"id":"https://openalex.org/I129902397","display_name":"Dalhousie University","ror":"https://ror.org/01e6qks80","country_code":"CA","type":"funder","lineage":["https://openalex.org/I129902397"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"None Tao Yang","raw_affiliation_strings":["Industrial Engineering Department DalTech, Dalhousie University, Halifax, NS, Canada"],"affiliations":[{"raw_affiliation_string":"Industrial Engineering Department DalTech, Dalhousie University, Halifax, NS, Canada","institution_ids":["https://openalex.org/I129902397"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.186,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":1,"citation_normalized_percentile":{"value":0.264351,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":57,"max":64},"biblio":{"volume":null,"issue":null,"first_page":"372","last_page":"377"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9997,"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.9997,"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9993,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9986,"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/consistent-heuristic","display_name":"Consistent heuristic","score":0.5923841}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.77438366},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.71848094},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.684776},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6442017},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6387142},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.61351407},{"id":"https://openalex.org/C200246849","wikidata":"https://www.wikidata.org/wiki/Q5163226","display_name":"Consistent heuristic","level":5,"score":0.5923841},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.55613613},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5221729},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5060906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47544667},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4181165},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.4132385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3672211},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.20203191},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13764212},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11105293},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.110102355},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07541385},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.07532105}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.1997.623338","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":13,"referenced_works":["https://openalex.org/W1964119857","https://openalex.org/W2007572995","https://openalex.org/W2011039300","https://openalex.org/W2021136283","https://openalex.org/W2022394070","https://openalex.org/W2058605747","https://openalex.org/W2063317962","https://openalex.org/W2124726667","https://openalex.org/W2127456145","https://openalex.org/W2147184289","https://openalex.org/W2169528473","https://openalex.org/W2170520491","https://openalex.org/W2614099084"],"related_works":["https://openalex.org/W4386259575","https://openalex.org/W2983794855","https://openalex.org/W2796795701","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W2156431668","https://openalex.org/W2120070962","https://openalex.org/W2040572217","https://openalex.org/W2019018557","https://openalex.org/W2018146256"],"abstract_inverted_index":{"The":[0,55],"path":[1,9,29,67,73],"selection":[2],"problem":[3,10,68],"is":[4,15,61,91],"formulated":[5],"as":[6],"a":[7,26,78],"shortest":[8,66,72],"with":[11],"multiple":[12],"constraints":[13,32],"which":[14],"known":[16],"to":[17,24,48,62],"be":[18],"NP-complete.":[19],"We":[20],"propose":[21],"heuristic":[22,60,95],"algorithms":[23,96],"find":[25],"minimum":[27,46],"hop":[28],"satisfying":[30],"the":[31,50,58,64,100],"of":[33,42,57,81,99],"end-to-end":[34],"delay":[35],"requirement,":[36],"maximum":[37],"load":[38],"level":[39],"on":[40],"each":[41],"its":[43],"link":[44],"and":[45],"probability":[47],"pass":[49],"local":[51],"call":[52,101],"admission":[53],"control.":[54],"spirit":[56],"proposed":[59],"transform":[63],"constrained":[65],"into":[69],"an":[70],"unconstrained":[71],"problem.":[74],"Simulation":[75],"study":[76],"over":[77],"large":[79],"number":[80],"randomly":[82],"generated":[83],"networks":[84],"shows":[85],"that":[86],"in":[87,97],"most":[88],"cases":[89],"it":[90],"better":[92],"than":[93],"existing":[94],"terms":[98],"blocking":[102],"ratio.":[103]},"abstract_inverted_index_v3":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2124726667","counts_by_year":[],"updated_date":"2025-03-19T06:27:49.644486","created_date":"2016-06-24"}