{"id":"https://openalex.org/W2045414296","doi":"https://doi.org/10.1109/icc.2014.6883475","title":"A heuristic routing algorithm with erasure correcting code based instantaneous recovery technique","display_name":"A heuristic routing algorithm with erasure correcting code based instantaneous recovery technique","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2045414296","doi":"https://doi.org/10.1109/icc.2014.6883475","mag":"2045414296"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2014.6883475","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2014.6883475","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Communications (ICC)","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/A5065430355","display_name":"Abu Hena Al Muktadir","orcid":"https://orcid.org/0000-0002-6098-1619"},"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":true,"raw_author_name":"Abu Hena Al Muktadir","raw_affiliation_strings":["Denki Tsushin Daigaku, Chofu, Tokyo, JP","Dept. of Commun. Eng. & Inf., Univ. of Electro-Commun., Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Denki Tsushin Daigaku, Chofu, Tokyo, JP","institution_ids":["https://openalex.org/I20529979"]},{"raw_affiliation_string":"Dept. of Commun. Eng. & Inf., Univ. of Electro-Commun., Tokyo, Japan","institution_ids":["https://openalex.org/I20529979"]}]},{"author_position":"last","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":"Eiji Oki","raw_affiliation_strings":["Department of Communication Engineering and Informatics, The University of Electro-Communications, Tokyo, Japan","Dept. of Commun. Eng. & Inf., Univ. of Electro-Commun., Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Communication Engineering and Informatics, The University of Electro-Communications, Tokyo, Japan","institution_ids":["https://openalex.org/I20529979"]},{"raw_affiliation_string":"Dept. of Commun. Eng. & Inf., Univ. of Electro-Commun., Tokyo, Japan","institution_ids":["https://openalex.org/I20529979"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065430355"],"corresponding_institution_ids":["https://openalex.org/I20529979"],"apc_list":null,"apc_paid":null,"fwci":1.3792,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.83704044,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"14","issue":null,"first_page":"1143","last_page":"1147"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","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/T10796","display_name":"Cooperative Communication and Network Coding","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/T10829","display_name":"Interconnection Networks and Systems","score":0.9970999956130981,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9955000281333923,"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/computer-science","display_name":"Computer science","score":0.7366297245025635},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.6292011737823486},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.6057471036911011},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5718125700950623},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5391367673873901},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.5191589593887329},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.48909956216812134},{"id":"https://openalex.org/keywords/destination-sequenced-distance-vector-routing","display_name":"Destination-Sequenced Distance Vector routing","score":0.48522233963012695},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.46507689356803894},{"id":"https://openalex.org/keywords/network-routing","display_name":"Network routing","score":0.4457271993160248},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.44223490357398987},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.43312379717826843},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.35834801197052},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3565335273742676},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.33087629079818726},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2792503833770752},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.21550419926643372},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.20044392347335815},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19202598929405212}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7366297245025635},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.6292011737823486},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.6057471036911011},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5718125700950623},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5391367673873901},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.5191589593887329},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.48909956216812134},{"id":"https://openalex.org/C29436982","wikidata":"https://www.wikidata.org/wiki/Q3700557","display_name":"Destination-Sequenced Distance Vector routing","level":5,"score":0.48522233963012695},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.46507689356803894},{"id":"https://openalex.org/C2983435990","wikidata":"https://www.wikidata.org/wiki/Q22725","display_name":"Network routing","level":3,"score":0.4457271993160248},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.44223490357398987},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.43312379717826843},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.35834801197052},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3565335273742676},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33087629079818726},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2792503833770752},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.21550419926643372},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.20044392347335815},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19202598929405212},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icc.2014.6883475","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2014.6883475","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Conference on Communications (ICC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5099999904632568,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1982593066","https://openalex.org/W1991915995","https://openalex.org/W2019860047","https://openalex.org/W2041651554","https://openalex.org/W2045743538","https://openalex.org/W2051526815","https://openalex.org/W2067445733","https://openalex.org/W2087569367","https://openalex.org/W2088254717","https://openalex.org/W2105831729","https://openalex.org/W2115104320","https://openalex.org/W2119401720","https://openalex.org/W2119564287","https://openalex.org/W2125571835","https://openalex.org/W2128097223","https://openalex.org/W2142955036","https://openalex.org/W2145732257","https://openalex.org/W2156084860","https://openalex.org/W2163426446","https://openalex.org/W2164694181","https://openalex.org/W2168005510","https://openalex.org/W2168993516","https://openalex.org/W2169216002"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2751383119","https://openalex.org/W2117516174","https://openalex.org/W2041853321","https://openalex.org/W2406963874","https://openalex.org/W2604779282","https://openalex.org/W2889464401","https://openalex.org/W152510122","https://openalex.org/W1984835167"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,33,38,43,57,131,135,145,149],"heuristic":[4,154],"routing":[5,45,63,94,132,146],"algorithm":[6,155],"to":[7,92,108,143,159],"design":[8],"routes":[9],"for":[10,32,64,95],"all":[11,65,124,175],"possible":[12,66,119],"source":[13,34,67,176],"destination":[14,35,68,177],"pairs":[15,125,178],"by":[16,70],"provisioning":[17],"erasure":[18,185],"correcting":[19,186],"code":[20,187],"based":[21,188],"instantaneous":[22,73,189],"recovery":[23,74,190],"technique":[24,75,196],"with":[25,163,168],"optimal":[26],"traffic":[27,99,120],"splitting,":[28],"which":[29,111],"was":[30,82],"addressed":[31],"pair":[36,69,161],"in":[37,47,56,208],"prior":[39],"work.":[40],"We":[41],"consider":[42],"static":[44],"problem":[46],"networks":[48],"having":[49],"the":[50,54,86,104,113,152,160,164,169,179],"coding":[51],"capability.":[52],"When":[53],"links":[55],"network":[58],"have":[59],"finite":[60],"capacities,":[61],"assigning":[62],"using":[71],"this":[72,80],"are":[76,197],"mutually":[77],"dependent,":[78],"and":[79,192],"issue":[81],"not":[83,139],"addressed.":[84],"For":[85,174],"route":[87],"designing":[88],"purpose,":[89],"one":[90],"need":[91],"check":[93],"exponential":[96],"number":[97,101,105],"of":[98,106,115,123,183],"splitting":[100,121],"combinations.":[102],"If":[103],"combinations":[107],"be":[109],"considered,":[110,126],"equals":[112],"multiplication":[114],"each":[116],"individual":[117],"maximum":[118],"numbers":[122],"becomes":[127],"extremely":[128],"large":[129],"obtaining":[130],"solution":[133,147],"within":[134,148],"practical":[136,150],"time":[137],"is":[138,206],"possible.":[140],"In":[141],"order":[142],"achieve":[144],"time,":[151],"proposed":[153],"gives":[156],"highest":[157],"priority":[158],"either":[162],"largest":[165,170],"cost":[166],"or":[167],"resource":[171,201],"saving":[172,202],"effect.":[173],"total":[180],"path":[181],"costs":[182],"implementing":[184],"technique,":[191],"conventional":[193],"1+1":[194,204],"protection":[195,205],"computed.":[198],"Almost":[199],"20%":[200],"w.r.to":[203],"achieved":[207],"our":[209],"examined":[210],"networks.":[211]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}