{"id":"https://openalex.org/W2295147941","doi":"https://doi.org/10.1109/icoin.2016.7427100","title":"Congestion prevention mechanism based on Q-leaning for efficient routing in SDN","display_name":"Congestion prevention mechanism based on Q-leaning for efficient routing in SDN","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2295147941","doi":"https://doi.org/10.1109/icoin.2016.7427100","mag":"2295147941"},"language":"en","primary_location":{"id":"doi:10.1109/icoin.2016.7427100","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icoin.2016.7427100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Information Networking (ICOIN)","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/A5016802796","display_name":"Seonhyeok Kim","orcid":"https://orcid.org/0000-0001-7279-2017"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seonhyeok Kim","raw_affiliation_strings":["Department of Computer Science and Engineering, Kyung Hee University, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Kyung Hee University, Republic of Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038622372","display_name":"Jaehyeok Son","orcid":null},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jaehyeok Son","raw_affiliation_strings":["Department of Computer Science and Engineering, Kyung Hee University, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Kyung Hee University, Republic of Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078972500","display_name":"Ashis Talukder","orcid":"https://orcid.org/0000-0003-2991-9136"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Ashis Talukder","raw_affiliation_strings":["Department of Computer Science and Engineering, Kyung Hee University, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Kyung Hee University, Republic of Korea","institution_ids":["https://openalex.org/I35928602"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034052371","display_name":"Choong Seon Hong","orcid":"https://orcid.org/0000-0003-3484-7333"},"institutions":[{"id":"https://openalex.org/I35928602","display_name":"Kyung Hee University","ror":"https://ror.org/01zqcg218","country_code":"KR","type":"education","lineage":["https://openalex.org/I35928602"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Choong Seon Hong","raw_affiliation_strings":["Department of Computer Science and Engineering, Kyung Hee University, Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Kyung Hee University, Republic of Korea","institution_ids":["https://openalex.org/I35928602"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I35928602"],"apc_list":null,"apc_paid":null,"fwci":3.545,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.93202428,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"124","last_page":"128"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":1.0,"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":1.0,"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.9896000027656555,"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/T11478","display_name":"Caching and Content Delivery","score":0.9861000180244446,"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.8136098384857178},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7476658225059509},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.5734374523162842},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5411602258682251},{"id":"https://openalex.org/keywords/hierarchical-routing","display_name":"Hierarchical routing","score":0.526509702205658},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.4979259967803955},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.49737003445625305},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4929172992706299},{"id":"https://openalex.org/keywords/software-defined-networking","display_name":"Software-defined networking","score":0.4695121943950653},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.4665776193141937},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.46462756395339966},{"id":"https://openalex.org/keywords/network-congestion","display_name":"Network congestion","score":0.4313914179801941},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.38603129982948303},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.3839688003063202},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.34578022360801697},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.32096347212791443}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8136098384857178},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7476658225059509},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.5734374523162842},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5411602258682251},{"id":"https://openalex.org/C177818476","wikidata":"https://www.wikidata.org/wiki/Q12878103","display_name":"Hierarchical routing","level":5,"score":0.526509702205658},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.4979259967803955},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.49737003445625305},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4929172992706299},{"id":"https://openalex.org/C77270119","wikidata":"https://www.wikidata.org/wiki/Q1655198","display_name":"Software-defined networking","level":2,"score":0.4695121943950653},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.4665776193141937},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.46462756395339966},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.4313914179801941},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.38603129982948303},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.3839688003063202},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.34578022360801697},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.32096347212791443},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","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/icoin.2016.7427100","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icoin.2016.7427100","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 International Conference on Information Networking (ICOIN)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4399999976158142,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1966312720","https://openalex.org/W1985327440","https://openalex.org/W2005244180","https://openalex.org/W2040340473","https://openalex.org/W2054470660","https://openalex.org/W2067453331","https://openalex.org/W2075800961","https://openalex.org/W2125560635","https://openalex.org/W2129197233","https://openalex.org/W2136451165","https://openalex.org/W2147118406","https://openalex.org/W2295167007"],"related_works":["https://openalex.org/W2155400411","https://openalex.org/W2351097701","https://openalex.org/W2162880363","https://openalex.org/W2352609928","https://openalex.org/W142214912","https://openalex.org/W2154440508","https://openalex.org/W2352561993","https://openalex.org/W3152092244","https://openalex.org/W2114321370","https://openalex.org/W199826539"],"abstract_inverted_index":{"SDN":[0],"(Software-Defined":[1],"Networking)":[2],"has":[3],"been":[4],"proposed":[5],"to":[6,24,46,75],"solve":[7],"problems":[8],"caused":[9],"by":[10,98],"difficulties":[11],"in":[12,19,52,67,85],"central":[13],"management,":[14],"vendor":[15],"dependency,":[16],"and":[17,39,102,109],"increase":[18],"complexity":[20],"of":[21,64],"network":[22,53,77,93],"due":[23],"individual":[25],"process.":[26],"In":[27,87],"current":[28],"SDN,":[29],"however,":[30],"routing":[31,84,111],"algorithm":[32],"is":[33,44,58],"mainly":[34],"based":[35,79],"on":[36,80],"Dijkstra's":[37],"Algorithm":[38],"the":[40,68,92,100],"shortest":[41],"Flow":[42,104],"Path":[43],"selected":[45],"deliver":[47],"packets.":[48],"This":[49],"may":[50],"result":[51],"congestion":[54,78,94],"since":[55],"bandwidth":[56],"overhead":[57],"not":[59],"considered":[60],"when":[61],"a":[62,73],"lot":[63],"traffic":[65],"enters":[66],"network.":[69],"Therefore,":[70],"we":[71,90],"propose":[72],"mechanism":[74],"prevent":[76],"Q-learning":[81,110],"for":[82],"efficient":[83],"SDN.":[86],"this":[88],"paper,":[89],"show":[91],"can":[95],"be":[96],"improved":[97],"reselecting":[99],"path":[101],"changing":[103],"Table":[105],"using":[106],"predefined":[107],"threshold":[108],"algorithm.":[112]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}