{"id":"https://openalex.org/W3156666283","doi":"https://doi.org/10.1155/2021/5572881","title":"Selecting the Best Routing Traffic for Packets in LAN via Machine Learning to Achieve the Best Strategy","display_name":"Selecting the Best Routing Traffic for Packets in LAN via Machine Learning to Achieve the Best Strategy","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W3156666283","doi":"https://doi.org/10.1155/2021/5572881","mag":"3156666283"},"language":"en","primary_location":{"id":"doi:10.1155/2021/5572881","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2021/5572881","pdf_url":"https://downloads.hindawi.com/journals/complexity/2021/5572881.pdf","source":{"id":"https://openalex.org/S207319443","display_name":"Complexity","issn_l":"1076-2787","issn":["1076-2787","1099-0526"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://downloads.hindawi.com/journals/complexity/2021/5572881.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101753952","display_name":"Bo Zhang","orcid":"https://orcid.org/0000-0001-6173-2668"},"institutions":[{"id":"https://openalex.org/I75689368","display_name":"Communication University of China","ror":"https://ror.org/04facbs33","country_code":"CN","type":"education","lineage":["https://openalex.org/I75689368"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Bo Zhang","raw_affiliation_strings":["School of Information and Communication Engineering, Communication University of China, Beijing, China"],"affiliations":[{"raw_affiliation_string":"School of Information and Communication Engineering, Communication University of China, Beijing, China","institution_ids":["https://openalex.org/I75689368"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5040410091","display_name":"Rongji Liao","orcid":null},"institutions":[{"id":"https://openalex.org/I75689368","display_name":"Communication University of China","ror":"https://ror.org/04facbs33","country_code":"CN","type":"education","lineage":["https://openalex.org/I75689368"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Rongji Liao","raw_affiliation_strings":["School of Information and Communication Engineering, Communication University of China, Beijing, China"],"affiliations":[{"raw_affiliation_string":"School of Information and Communication Engineering, Communication University of China, Beijing, China","institution_ids":["https://openalex.org/I75689368"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101753952"],"corresponding_institution_ids":["https://openalex.org/I75689368"],"apc_list":{"value":2300,"currency":"USD","value_usd":2300},"apc_paid":{"value":2300,"currency":"USD","value_usd":2300},"fwci":0.32,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.59270155,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"2021","issue":"1","first_page":null,"last_page":null},"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.9993000030517578,"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.9993000030517578,"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/T10400","display_name":"Network Security and Intrusion Detection","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"}},{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9944999814033508,"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.8297977447509766},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.5802477598190308},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5666905045509338},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.5311597585678101},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5032188296318054},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.5020380020141602},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4876355230808258},{"id":"https://openalex.org/keywords/backpropagation","display_name":"Backpropagation","score":0.4718194901943207},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.44604814052581787},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.4223950505256653},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4162832796573639},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39283668994903564},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.36949658393859863},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3156817853450775},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.27034929394721985},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.19814369082450867},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.09072604775428772},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0785720944404602}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8297977447509766},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.5802477598190308},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5666905045509338},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.5311597585678101},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5032188296318054},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.5020380020141602},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4876355230808258},{"id":"https://openalex.org/C155032097","wikidata":"https://www.wikidata.org/wiki/Q798503","display_name":"Backpropagation","level":3,"score":0.4718194901943207},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.44604814052581787},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.4223950505256653},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4162832796573639},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39283668994903564},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.36949658393859863},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3156817853450775},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.27034929394721985},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.19814369082450867},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.09072604775428772},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0785720944404602},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1155/2021/5572881","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2021/5572881","pdf_url":"https://downloads.hindawi.com/journals/complexity/2021/5572881.pdf","source":{"id":"https://openalex.org/S207319443","display_name":"Complexity","issn_l":"1076-2787","issn":["1076-2787","1099-0526"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Complexity","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:hin:complx:5572881","is_oa":false,"landing_page_url":"http://downloads.hindawi.com/journals/complexity/2021/5572881.xml","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},{"id":"pmh:oai:doaj.org/article:77205bb28f4c4cd88ff0d022ca2d30a5","is_oa":true,"landing_page_url":"https://doaj.org/article/77205bb28f4c4cd88ff0d022ca2d30a5","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Complexity, Vol 2021 (2021)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1155/2021/5572881","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2021/5572881","pdf_url":"https://downloads.hindawi.com/journals/complexity/2021/5572881.pdf","source":{"id":"https://openalex.org/S207319443","display_name":"Complexity","issn_l":"1076-2787","issn":["1076-2787","1099-0526"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Complexity","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8287273995","display_name":null,"funder_award_id":"CUC2019B072","funder_id":"https://openalex.org/F4320335787","funder_display_name":"Fundamental Research Funds for the Central Universities"}],"funders":[{"id":"https://openalex.org/F4320335787","display_name":"Fundamental Research Funds for the Central Universities","ror":null}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3156666283.pdf","grobid_xml":"https://content.openalex.org/works/W3156666283.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W1895527359","https://openalex.org/W2145339207","https://openalex.org/W2151904809","https://openalex.org/W2479919851","https://openalex.org/W2561715836","https://openalex.org/W2573212983","https://openalex.org/W2735793369","https://openalex.org/W2736402963","https://openalex.org/W2781788077","https://openalex.org/W2789828921","https://openalex.org/W2797742547","https://openalex.org/W2898231005","https://openalex.org/W2915905517","https://openalex.org/W2916641566","https://openalex.org/W2942476636","https://openalex.org/W2950863887","https://openalex.org/W2963350322","https://openalex.org/W2965731744","https://openalex.org/W2993659802","https://openalex.org/W2995295303","https://openalex.org/W2996685790","https://openalex.org/W3000411124","https://openalex.org/W3004276756","https://openalex.org/W3007031080","https://openalex.org/W3010014325","https://openalex.org/W3012289819","https://openalex.org/W3025804100","https://openalex.org/W3030437655","https://openalex.org/W3042603127","https://openalex.org/W3093400706","https://openalex.org/W3100035092","https://openalex.org/W3103211661","https://openalex.org/W3105750153","https://openalex.org/W3109519452","https://openalex.org/W3124659894","https://openalex.org/W3128060799","https://openalex.org/W3131785125","https://openalex.org/W4230471307","https://openalex.org/W6687891233","https://openalex.org/W6785608253"],"related_works":["https://openalex.org/W2370345607","https://openalex.org/W2388051136","https://openalex.org/W2171039275","https://openalex.org/W2047399896","https://openalex.org/W2767202586","https://openalex.org/W191849398","https://openalex.org/W2369626564","https://openalex.org/W2523719706","https://openalex.org/W2138676684","https://openalex.org/W3094029073"],"abstract_inverted_index":{"The":[0,110,136,253],"application":[1],"of":[2,8,23,38,51,74,88,112,127,156,171,173,183,235,240,250,255,263,308],"machine":[3],"learning":[4],"touches":[5],"all":[6],"activities":[7],"human":[9],"behavior":[10],"such":[11,47],"as":[12,48,84,141,180],"computer":[13,268],"network":[14,81,98,116,121,227,239,287],"and":[15,42,56,92,176,223,320],"routing":[16,146],"packets":[17],"in":[18,53,62,77,95,99,133,145,162,168,207,245,297,317],"LAN.":[19,299],"In":[20,230],"the":[21,36,39,44,49,54,57,65,72,79,86,89,93,96,103,107,113,120,125,128,142,160,169,174,177,188,209,214,233,236,248,251,256,261,278,285,301,305,309],"field":[22],"our":[24],"research":[25],"here,":[26],"emphasis":[27],"was":[28],"placed":[29],"on":[30,59],"extracting":[31],"weights":[32,218],"that":[33,148,204,259,277,304],"would":[34],"affect":[35],"speed":[37],"network\u2032s":[40],"response":[41],"finding":[43],"best":[45,104,108],"path,":[46,61],"number":[50],"nodes":[52,296],"path":[55,138,157,211,327],"congestion":[58],"each":[60,69],"addition":[63],"to":[64,101,118,193,199,212,224,266,289,315,324],"cache":[66],"used":[67],"for":[68,106],"node.":[70],"Therefore,":[71],"use":[73],"these":[75],"elements":[76],"building":[78],"neural":[80,97,115,226,238,286],"is":[82,85,117,139,243,270,274],"worthy,":[83],"exploitation":[87],"feed":[90],"forwarding":[91],"backpropagation":[94],"order":[100],"reach":[102],"prediction":[105,179],"path.":[109],"goal":[111],"proposed":[114,310],"minimize":[119],"time":[122,155,292,319],"delay":[123,293],"within":[124],"optimization":[126],"packet":[129,221],"paths":[130],"being":[131],"addressed":[132],"this":[134,231],"study.":[135],"shortest":[137,210],"considered":[140],"key":[143],"issue":[144],"algorithm":[147,203],"can":[149],"be":[150,313],"carried":[151],"out":[152],"with":[153,294,326],"real":[154,318],"computations.":[158],"Exploiting":[159],"gaps":[161],"previous":[163],"studies,":[164],"which":[165],"are":[166,321],"represented":[167],"lack":[170],"training":[172,284],"system":[175,265,279,288],"inaccurate":[178],"a":[181],"result":[182],"not":[184],"taking":[185],"into":[186],"consideration":[187],"hidden":[189],"layers\u2032":[190],"feedback,":[191],"leads":[192],"great":[194],"performance.":[195],"This":[196],"study":[197,257],"aims":[198],"suggest":[200],"an":[201],"efficient":[202,237],"could":[205],"help":[206],"selecting":[208],"improve":[213],"existing":[215],"methods":[216],"using":[217],"derived":[219],"from":[220],"ID":[222],"change":[225,325],"iteration":[228],"simultaneously.":[229],"study,":[232],"design":[234],"appropriate":[241],"output":[242],"discussed":[244],"detail":[246],"including":[247],"principles":[249],"network.":[252],"findings":[254],"revealed":[258],"exploiting":[260],"power":[262],"computational":[264],"demonstrate":[267],"simulation":[269],"really":[271],"effective.":[272],"It":[273],"also":[275,322],"shown":[276],"achieved":[280],"good":[281],"results":[282,302],"when":[283],"get":[290],"2.4%":[291],"5":[295],"local":[298],"Besides,":[300],"showed":[303],"major":[306],"features":[307],"model":[311],"will":[312],"able":[314],"run":[316],"adaptive":[323],"topology.":[328]},"counts_by_year":[{"year":2022,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}