{"id":"https://openalex.org/W4200080157","doi":"https://doi.org/10.1109/itnac53136.2021.9652145","title":"Path Planning Method using Deep Learning Model for Traffic Engineering in Small Networks","display_name":"Path Planning Method using Deep Learning Model for Traffic Engineering in Small Networks","publication_year":2021,"publication_date":"2021-11-24","ids":{"openalex":"https://openalex.org/W4200080157","doi":"https://doi.org/10.1109/itnac53136.2021.9652145"},"language":"en","primary_location":{"id":"doi:10.1109/itnac53136.2021.9652145","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itnac53136.2021.9652145","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 31st International Telecommunication Networks and Applications Conference (ITNAC)","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"],"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering, Nihon University, Koriyama, Japan","institution_ids":["https://openalex.org/I104946051"]}]},{"author_position":"last","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"],"affiliations":[{"raw_affiliation_string":"College of Engineering, Nihon University, Koriyama, Japan","institution_ids":["https://openalex.org/I104946051"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5034979643"],"corresponding_institution_ids":["https://openalex.org/I104946051"],"apc_list":null,"apc_paid":null,"fwci":0.3056,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61498309,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"65","last_page":"70"},"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.995199978351593,"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.995199978351593,"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/T10761","display_name":"Vehicular Ad Hoc Networks (VANETs)","score":0.9937999844551086,"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9922000169754028,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7497557401657104},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6900393962860107},{"id":"https://openalex.org/keywords/traffic-engineering","display_name":"Traffic engineering","score":0.6886224150657654},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5967801809310913},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5555263757705688},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.49418357014656067},{"id":"https://openalex.org/keywords/traffic-generation-model","display_name":"Traffic generation model","score":0.47882941365242004},{"id":"https://openalex.org/keywords/deep-learning","display_name":"Deep learning","score":0.46695050597190857},{"id":"https://openalex.org/keywords/router","display_name":"Router","score":0.4630658030509949},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.46184107661247253},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43548133969306946},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4320879578590393},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.38796520233154297},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.34484386444091797},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2868923544883728},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.138803631067276},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08512178063392639}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7497557401657104},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6900393962860107},{"id":"https://openalex.org/C16160715","wikidata":"https://www.wikidata.org/wiki/Q1640676","display_name":"Traffic engineering","level":2,"score":0.6886224150657654},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5967801809310913},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5555263757705688},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.49418357014656067},{"id":"https://openalex.org/C176715033","wikidata":"https://www.wikidata.org/wiki/Q2080768","display_name":"Traffic generation model","level":2,"score":0.47882941365242004},{"id":"https://openalex.org/C108583219","wikidata":"https://www.wikidata.org/wiki/Q197536","display_name":"Deep learning","level":2,"score":0.46695050597190857},{"id":"https://openalex.org/C2775896111","wikidata":"https://www.wikidata.org/wiki/Q642560","display_name":"Router","level":2,"score":0.4630658030509949},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.46184107661247253},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43548133969306946},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4320879578590393},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.38796520233154297},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.34484386444091797},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2868923544883728},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.138803631067276},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08512178063392639},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itnac53136.2021.9652145","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itnac53136.2021.9652145","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 31st International Telecommunication Networks and Applications Conference (ITNAC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.41999998688697815}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1507214265","https://openalex.org/W1917209212","https://openalex.org/W1965140698","https://openalex.org/W2004526338","https://openalex.org/W2096655151","https://openalex.org/W2098383356","https://openalex.org/W2111162397","https://openalex.org/W2122518670","https://openalex.org/W2123354331","https://openalex.org/W2162311977","https://openalex.org/W2566425973","https://openalex.org/W2893647509","https://openalex.org/W6683750438"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"Traffic":[0],"engineering":[1,34],"is":[2,29,115,131,143,186,197],"a":[3,36,79,103,106,123],"method":[4,82,96,196],"for":[5,21,43,88],"efficiently":[6],"con-trolling":[7],"traffic":[8,33,89,128],"with":[9,149,188],"large":[10],"time":[11,203],"fluctuations:":[12],"while":[13,204],"maintaining":[14],"the":[15,22,25,47,52,60,84,92,111,118,135,138,147,150,158,163,168,183,194],"Quality":[16],"of":[17,56,201,211],"Service":[18],"(QoS)":[19],"level":[20],"user.":[23],"On":[24],"other":[26],"hand,":[27],"it":[28,71,130,142],"hard":[30,144],"to":[31,51,59,69,116,133,145,173,209],"realize":[32],"in":[35,105,127,199],"realistic":[37],"network.":[38],"This":[39],"technology":[40],"has":[41,102],"problems,":[42],"example,":[44],"difficulty":[45],"recalculating":[46],"link":[48],"cost":[49],"according":[50,58],"network":[53,61],"conditions,":[54],"deterioration":[55],"scalability":[57],"scale.":[62],"To":[63],"solve":[64,70],"this":[65,154],"problem,":[66],"we":[67,77,156],"try":[68],"using":[72,83,97],"machine":[73,98],"learning.":[74],"In":[75,91,153],"particular,":[76],"propose":[78],"path":[80,94,119,136,170,185],"planning":[81],"deep":[85,159],"learning":[86,160],"model":[87,104,161],"engineering.":[90],"conventional":[93,151],"design":[95,134],"learning,":[99],"each":[100],"router":[101],"distributed":[107],"manner":[108],"and":[109,141,162,192],"designs":[110],"next":[112],"hop.":[113],"That":[114],"maintain":[117],"estimation":[120],"accuracy":[121,191],"at":[122],"high":[124,190],"value.":[125],"However,":[126],"engineering,":[129],"necessary":[132],"considering":[137],"entire":[139,169,184],"network,":[140],"learn":[146],"features":[148],"model.":[152],"paper,":[155],"define":[157],"teacher":[164],"signal":[165],"so":[166],"that":[167,182,193,210],"from":[171],"source":[172],"destination":[174],"nodes":[175],"can":[176],"design.":[177],"The":[178],"experimental":[179],"result":[180],"shows":[181],"designed":[187],"very":[189],"proposed":[195],"superior":[198],"terms":[200],"calculation":[202],"achieving":[205],"load":[206],"balancing":[207],"comparable":[208],"Dijkstra\u2019s":[212],"algorithm.":[213]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}