乐胖代购免代理版

{"id":"https://openalex.org/W2112057179","doi":"https://doi.org/10.1109/glocom.2008.ecp.492","title":"Network Design Method Based on Adaptive Selection of Facility-Adding and Path-Routing Policies under Traffic Growth","display_name":"Network Design Method Based on Adaptive Selection of Facility-Adding and Path-Routing Policies under Traffic Growth","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2112057179","doi":"https://doi.org/10.1109/glocom.2008.ecp.492","mag":"2112057179"},"language":"en","primary_location":{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2008.ecp.492","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/A5003871945","display_name":"Ryuta Sugiyama","orcid":null},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ryuta Sugiyama","raw_affiliation_strings":["NTT Network Service Syst. Labs., NTT Corp., Musashino"],"affiliations":[{"raw_affiliation_string":"NTT Network Service Syst. Labs., NTT Corp., Musashino","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106172149","display_name":"Tomonori Takeda","orcid":null},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Tomonori Takeda","raw_affiliation_strings":["NTT Network Service Syst. Labs., NTT Corp., Musashino"],"affiliations":[{"raw_affiliation_string":"NTT Network Service Syst. Labs., NTT Corp., Musashino","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047825950","display_name":"Eiji Oki","orcid":"https://orcid.org/0000-0003-2177-5027"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Eiji Oki","raw_affiliation_strings":["NTT Network Service Syst. Labs., NTT Corp., Musashino"],"affiliations":[{"raw_affiliation_string":"NTT Network Service Syst. Labs., NTT Corp., Musashino","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038560855","display_name":"Kohei Shiomoto","orcid":"https://orcid.org/0000-0003-2968-2060"},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kohei Shiomoto","raw_affiliation_strings":["NTT Network Service Syst. Labs., NTT Corp., Musashino"],"affiliations":[{"raw_affiliation_string":"NTT Network Service Syst. Labs., NTT Corp., Musashino","institution_ids":["https://openalex.org/I2251713219"]}]}],"institution_assertions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"fulltext_origin":"ngrams","cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":0,"max":63},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9978,"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"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9978,"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"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9893,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9839,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.451301},{"id":"https://openalex.org/keywords/cost-reduction","display_name":"Cost reduction","score":0.41906998}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6860622},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6241508},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6208991},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.597548},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.48292014},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46575195},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.451301},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.44424078},{"id":"https://openalex.org/C2778820799","wikidata":"https://www.wikidata.org/wiki/Q3454688","display_name":"Cost reduction","level":2,"score":0.41906998},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.26608473},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.25905716},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11515227},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.107396394},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.07496694},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2008.ecp.492","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":5,"referenced_works":["https://openalex.org/W1651117873","https://openalex.org/W2003886474","https://openalex.org/W2112240752","https://openalex.org/W2297145602","https://openalex.org/W2323439966"],"related_works":["https://openalex.org/W3094029073","https://openalex.org/W2767202586","https://openalex.org/W2388051136","https://openalex.org/W2370345607","https://openalex.org/W2369626564","https://openalex.org/W2171039275","https://openalex.org/W2138676684","https://openalex.org/W2047399896","https://openalex.org/W2018146256","https://openalex.org/W191849398"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,24,27,32,35,74,91],"network":[4,25,119,154],"design":[5,120,155,182],"method":[6,121,171],"based":[7],"on":[8],"adaptive":[9],"selection":[10],"of":[11,104,136,162],"\"facility-adding\"":[12],"and":[13,41,59,107,184],"\"path-routing\"":[14],"policies":[15,65],"under":[16],"the":[17,48,51,79,82,96,101,105,133,137,144,152,169,174,193],"condition":[18],"that":[19,99,143,168],"traffic":[20],"keeps":[21],"increasing.":[22],"In":[23],"where":[26],"path":[28,37,49,70,80,106,130],"is":[29,39,44,73,90,141],"provided":[30],"as":[31],"service,":[33],"when":[34],"new":[36,69],"demand":[38,103],"generated":[40],"if":[42],"it":[43,109,140],"impossible":[45],"to":[46,66,126,132,151,173,192],"accommodate":[47,67],"along":[50,81,110],"shortest":[52,83],"route":[53,84,98,113],"with":[54],"only":[55,159],"existing":[56],"facilities":[57],"(links":[58],"nodes,":[60],"etc.),":[61],"there":[62],"are":[63,148],"two":[64,163],"this":[68,111],"demand.":[71],"One":[72],"facility-adding":[75],"policy,":[76,93],"which":[77,94,124,157],"accommodates":[78,108],"by":[85],"adding":[86,115],"facilities.":[87,116],"The":[88,117],"other":[89],"path-routing":[92],"finds":[95],"detour":[97,112],"meets":[100],"bandwidth":[102],"without":[114],"proposed":[118,170],"adaptively":[122],"selects":[123],"policy":[125],"be":[127],"applied":[128],"per":[129],"according":[131],"holding":[134],"time":[135],"path.":[138],"Therefore,":[139],"expected":[142],"total":[145,175,187],"facility":[146,176,188],"cost":[147,177,189],"reduced":[149],"compared":[150,191],"conventional":[153,194],"method,":[156],"uses":[158],"either":[160],"one":[161],"policies.":[164],"Simulation":[165],"results":[166],"show":[167],"contributes":[172],"reduction":[178,190],"for":[179],"an":[180],"arbitrary":[181],"period":[183],"achieves":[185],"10%":[186],"method.":[195]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2112057179","counts_by_year":[],"updated_date":"2024-12-13T12:00:43.210913","created_date":"2016-06-24"}