{"id":"https://openalex.org/W2153395351","doi":"https://doi.org/10.1109/icc.2009.5198976","title":"Efficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model","display_name":"Efficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2153395351","doi":"https://doi.org/10.1109/icc.2009.5198976","mag":"2153395351"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2009.5198976","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5198976","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","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/A5047825950","display_name":"Eiji Oki","orcid":"https://orcid.org/0000-0003-2177-5027"},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"E. Oki","raw_affiliation_strings":["Department of Information and Communication Engineering, University of Electro-Communications, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Communication Engineering, University of Electro-Communications, Tokyo, Japan","institution_ids":["https://openalex.org/I20529979"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088782822","display_name":"Ayako Iwaki","orcid":null},"institutions":[{"id":"https://openalex.org/I20529979","display_name":"University of Electro-Communications","ror":"https://ror.org/02x73b849","country_code":"JP","type":"education","lineage":["https://openalex.org/I20529979"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"A. Iwaki","raw_affiliation_strings":["Department of Information and Communication Engineering, University of Electro-Communications, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information and Communication Engineering, University of Electro-Communications, Tokyo, Japan","institution_ids":["https://openalex.org/I20529979"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039903013","display_name":"Arata MASUDA","orcid":"https://orcid.org/0000-0002-5359-5306"},"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":"A. Masuda","raw_affiliation_strings":["NTT Network Service Systems Laboratories, NTT Corporation, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Network Service Systems Laboratories, NTT Corporation, Tokyo, Japan","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":"K. Shiomoto","raw_affiliation_strings":["NTT Network Service Systems Laboratories, NTT Corporation, Tokyo, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NTT Network Service Systems Laboratories, NTT Corporation, Tokyo, Japan","institution_ids":["https://openalex.org/I2251713219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6103,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.73860198,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"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.9998999834060669,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998000264167786,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9998000264167786,"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/open-shortest-path-first","display_name":"Open Shortest Path First","score":0.6469545960426331},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6392424702644348},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.632409393787384},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6277874112129211},{"id":"https://openalex.org/keywords/multiprotocol-label-switching","display_name":"Multiprotocol Label Switching","score":0.5906482338905334},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5385907888412476},{"id":"https://openalex.org/keywords/traffic-engineering","display_name":"Traffic engineering","score":0.5202049612998962},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5102388858795166},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4844067692756653},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4664549231529236},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4501778483390808},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4446158707141876},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4259395897388458},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.38466134667396545},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3809901475906372},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3205375075340271},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.22132587432861328},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11891573667526245},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.10886126756668091},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10564258694648743},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.08051362633705139}],"concepts":[{"id":"https://openalex.org/C70522964","wikidata":"https://www.wikidata.org/wiki/Q220169","display_name":"Open Shortest Path First","level":5,"score":0.6469545960426331},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6392424702644348},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.632409393787384},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6277874112129211},{"id":"https://openalex.org/C129880937","wikidata":"https://www.wikidata.org/wiki/Q677023","display_name":"Multiprotocol Label Switching","level":3,"score":0.5906482338905334},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5385907888412476},{"id":"https://openalex.org/C16160715","wikidata":"https://www.wikidata.org/wiki/Q1640676","display_name":"Traffic engineering","level":2,"score":0.5202049612998962},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5102388858795166},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4844067692756653},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4664549231529236},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4501778483390808},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4446158707141876},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4259395897388458},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.38466134667396545},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3809901475906372},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3205375075340271},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.22132587432861328},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11891573667526245},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.10886126756668091},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10564258694648743},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.08051362633705139},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2009.5198976","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5198976","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1911069185","https://openalex.org/W2030656000","https://openalex.org/W2047553334","https://openalex.org/W2078995479","https://openalex.org/W2131928951","https://openalex.org/W2138802567","https://openalex.org/W2144300439","https://openalex.org/W2147167313","https://openalex.org/W2155694415","https://openalex.org/W2163907500","https://openalex.org/W6640043936"],"related_works":["https://openalex.org/W2072125400","https://openalex.org/W2378759505","https://openalex.org/W2962525871","https://openalex.org/W2126978988","https://openalex.org/W2167426328","https://openalex.org/W2146696982","https://openalex.org/W2115563213","https://openalex.org/W1578944021","https://openalex.org/W1969412326","https://openalex.org/W2096655151"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,111,147,160],"simple":[4,148],"shortest-path-based":[5],"load-balanced":[6],"IP":[7],"routing":[8,201],"scheme":[9,16,188,202,216],"for":[10,55],"the":[11,21,27,41,44,50,64,78,86,90,95,98,105,115,118,126,133,140,152,178,186,191,197,212],"hose":[12,99,141],"model.":[13],"The":[14,24],"proposed":[15,25,91,187],"is":[17,82,155],"an":[18,169],"extension":[19,131],"of":[20,97,108,121,132,217],"Smart-OSPF":[22],"scheme.":[23],"scheme,":[26,92],"same":[28],"as":[29,146,168],"S-OSPF,":[30,49],"splits":[31],"traffic":[32,42,65,80,109,122,153],"demand":[33,66],"only":[34,104],"at":[35],"source":[36],"edge":[37,58,70],"nodes":[38],"and":[39,117,203],"transmits":[40],"along":[43],"shortest":[45,199],"path":[46,200],"routes.":[47],"In":[48],"split":[51,180],"ratios":[52],"are":[53,73,128],"determined":[54],"each":[56],"source-destination":[57,69],"node":[59,71,112],"pair":[60],"by":[61,211],"assuming":[62],"that":[63,110,172,185,209],"between":[67],"all":[68],"pairs":[72],"known,":[74],"in":[75,89,101],"other":[76,87],"words,":[77],"exact":[79],"matrix":[81,154],"completely":[83],"given.":[84],"On":[85],"hand,":[88],"we":[93,163],"assume":[94],"use":[96],"model;":[100],"this":[102],"model,":[103],"total":[106,119],"amount":[107,120],"injects":[113],"into":[114],"network":[116,127,192],"it":[123,204],"receives":[124],"from":[125],"known.":[129,157],"Any":[130],"linear":[134],"programming":[135],"(LP)":[136],"formulation":[137,171],"to":[138,196,208],"suit":[139],"model":[142],"cannot":[143],"be":[144,174],"solved":[145,176],"LP":[149,170],"problem,":[150],"because":[151],"not":[156],"By":[158],"introducing":[159],"duality":[161],"theorem,":[162],"successfully":[164],"formulate":[165],"our":[166],"problem":[167],"can":[173],"easily":[175],"yielding":[177],"desired":[179],"ratios.":[181],"Numerical":[182],"results":[183],"show":[184],"dramatically":[189],"reduces":[190],"congestion":[193],"ratio":[194],"compared":[195],"classical":[198],"provides":[205],"performance":[206],"close":[207],"provided":[210],"sophisticated":[213],"traffic-engineering":[214],"(TE)":[215],"multi-protocol":[218],"label":[219],"switching":[220],"(MPLS)-TE.":[221]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}