{"id":"https://openalex.org/W4391742759","doi":"https://doi.org/10.1109/imcom60618.2024.10418401","title":"Planning of Primary and Alternative Path Using Deep Learning Model for Traffic Engineering in Small Networks","display_name":"Planning of Primary and Alternative Path Using Deep Learning Model for Traffic Engineering in Small Networks","publication_year":2024,"publication_date":"2024-01-03","ids":{"openalex":"https://openalex.org/W4391742759","doi":"https://doi.org/10.1109/imcom60618.2024.10418401"},"language":"en","primary_location":{"id":"doi:10.1109/imcom60618.2024.10418401","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/imcom60618.2024.10418401","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 18th International Conference on Ubiquitous Information Management and Communication (IMCOM)","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/A5034979643","display_name":"Makoto Ito","orcid":"https://orcid.org/0000-0003-2687-7655"},"institutions":[{"id":"https://openalex.org/I104946051","display_name":"Nihon University","ror":"https://ror.org/05jk51a88","country_code":"JP","type":"education","lineage":["https://openalex.org/I104946051"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Makoto Ito","raw_affiliation_strings":["Graduate School of Engineering, Nihon University,Koriyama,Japan","Graduate School of Engineering, Nihon University, Koriyama, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering, Nihon University,Koriyama,Japan","institution_ids":["https://openalex.org/I104946051"]},{"raw_affiliation_string":"Graduate School of Engineering, Nihon University, Koriyama, Japan","institution_ids":["https://openalex.org/I104946051"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069940028","display_name":"Taiju Mikoshi","orcid":"https://orcid.org/0000-0002-5651-8891"},"institutions":[{"id":"https://openalex.org/I104946051","display_name":"Nihon University","ror":"https://ror.org/05jk51a88","country_code":"JP","type":"education","lineage":["https://openalex.org/I104946051"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Taiju Mikoshi","raw_affiliation_strings":["College of Engineering, Nihon University,Koriyama,Japan","College of Engineering, Nihon University, Koriyama, Japan"],"affiliations":[{"raw_affiliation_string":"College of Engineering, Nihon University,Koriyama,Japan","institution_ids":["https://openalex.org/I104946051"]},{"raw_affiliation_string":"College of Engineering, Nihon University, Koriyama, Japan","institution_ids":["https://openalex.org/I104946051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014962584","display_name":"Kouichi Genda","orcid":null},"institutions":[{"id":"https://openalex.org/I104946051","display_name":"Nihon University","ror":"https://ror.org/05jk51a88","country_code":"JP","type":"education","lineage":["https://openalex.org/I104946051"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kouichi Genda","raw_affiliation_strings":["College of Engineering, Nihon University,Koriyama,Japan","College of Engineering, Nihon University, Koriyama, Japan"],"affiliations":[{"raw_affiliation_string":"College of Engineering, Nihon University,Koriyama,Japan","institution_ids":["https://openalex.org/I104946051"]},{"raw_affiliation_string":"College of Engineering, Nihon University, Koriyama, Japan","institution_ids":["https://openalex.org/I104946051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5034979643"],"corresponding_institution_ids":["https://openalex.org/I104946051"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.01391224,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"48","issue":null,"first_page":"1","last_page":"4"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9991000294685364,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9991000294685364,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9986000061035156,"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.996999979019165,"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/any-angle-path-planning","display_name":"Any-angle path planning","score":0.792757511138916},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7191022634506226},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6907155513763428},{"id":"https://openalex.org/keywords/fast-path","display_name":"Fast path","score":0.6459113955497742},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5524607300758362},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49974799156188965},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4992215633392334},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.46887660026550293},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.46522045135498047},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4551248252391815},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40615102648735046},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35312795639038086},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3093017637729645},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2464641034603119},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16771623492240906},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13923650979995728},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12298515439033508},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.08800768852233887}],"concepts":[{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.792757511138916},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7191022634506226},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6907155513763428},{"id":"https://openalex.org/C32638748","wikidata":"https://www.wikidata.org/wiki/Q5437051","display_name":"Fast path","level":4,"score":0.6459113955497742},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5524607300758362},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49974799156188965},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4992215633392334},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.46887660026550293},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.46522045135498047},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4551248252391815},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40615102648735046},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35312795639038086},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3093017637729645},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2464641034603119},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16771623492240906},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13923650979995728},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12298515439033508},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.08800768852233887},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"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/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/imcom60618.2024.10418401","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/imcom60618.2024.10418401","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 18th International Conference on Ubiquitous Information Management and Communication (IMCOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5199999809265137,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1988144156","https://openalex.org/W2096655151","https://openalex.org/W2098383356","https://openalex.org/W2111162397","https://openalex.org/W2122518670","https://openalex.org/W2162311977","https://openalex.org/W2562195265","https://openalex.org/W2804362738","https://openalex.org/W4200080157","https://openalex.org/W4390401786"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2092513144","https://openalex.org/W2165808384","https://openalex.org/W2129550502","https://openalex.org/W2776102956","https://openalex.org/W3111684308"],"abstract_inverted_index":{"Traffic":[0],"engineering":[1],"enables":[2],"to":[3,70,146],"control":[4],"of":[5,74,248,257],"network":[6,67,105],"congestion":[7],"and":[8,26,48,169,187,222,251],"achieves":[9],"load":[10,50],"balancing":[11],"using":[12,40,154,177,218],"paths":[13,56,60,141,191,207,239],"planning":[14,22,38,153,175,250],"method":[15,39,54],"for":[16,208],"traffic":[17,71,75],"flows.":[18],"However,":[19,171],"optimum":[20],"path":[21,37,86,90,100,114,127,152,174,249],"requires":[23,28],"complex":[24],"calculations,":[25],"it":[27,157],"huge":[29],"calculation":[30],"time.":[31],"We":[32],"have":[33,192],"been":[34,194],"proposing":[35],"a":[36,104,109,119,161,228,243],"the":[41,65,95,98,137,147,167,173,199,214,219,223,231],"deep":[42,155,178],"learning":[43,163,180,201],"model":[44,164,204],"reducing":[45],"computational":[46],"complexity":[47],"attaining":[49],"balancing.":[51],"In":[52,79],"this":[53,80],"congestion-controlled":[55],"are":[57,61,134,240,252],"designed;":[58],"those":[59],"while":[62],"looking":[63],"over":[64],"entire":[66],"in":[68,136,172,255],"response":[69],"demand":[72],"consisting":[73],"between":[76],"multiple":[77],"locations.":[78],"paper,":[81],"we":[82,197],"focus":[83],"on":[84,118],"alternative":[85,89,99,140],"design.":[87],"An":[88],"is":[91,101,115,158,216,225],"designed":[92,116,144,241],"separate":[93],"from":[94],"primary-path.":[96,138,148,232],"And":[97],"used":[102],"when":[103,151],"node":[106],"accident":[107],"or":[108,124,131],"link":[110,259],"failure":[111],"occurs.":[112],"This":[113],"depending":[117],"purpose,":[120],"such":[121],"as":[122,227],"node-disjoint-paths":[123],"link-disjoint-paths.":[125],"The":[126,203,233],"excludes":[128],"any":[129],"nodes":[130],"links":[132],"which":[133,182],"contained":[135],"Particularly,":[139],"should":[142],"be":[143],"according":[145],"Therefore,":[149],"even":[150],"learning,":[156,179],"desirable":[159],"that":[160,237],"single":[162],"simultaneously":[165],"designs":[166],"primary-path":[168,215],"alternative-path.":[170],"methods":[176],"models,":[181],"learn":[183],"different":[184,190],"teaching":[185,212],"data":[186],"simultaneously,":[188],"design":[189],"not":[193],"considered.":[195],"Thus,":[196],"extend":[198],"conventional":[200],"model.":[202],"outputs":[205],"two":[206],"one":[209],"input.":[210],"As":[211],"data,":[213],"created":[217,226],"Dijkstra":[220],"method,":[221],"alternative-path":[224],"link-disjoint-path":[229],"considering":[230],"experimental":[234],"result":[235],"shows":[236],"both":[238],"with":[242],"very":[244],"high":[245],"success":[246],"rate":[247],"confirmed":[253],"superior":[254],"terms":[256],"low":[258],"overlapping":[260],"rate.":[261]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}