{"id":"https://openalex.org/W2047228602","doi":"https://doi.org/10.1109/ictc.2013.6675567","title":"Q-learning based adaptive subgraph generation algorithm for graph routing in ISA 100.11a","display_name":"Q-learning based adaptive subgraph generation algorithm for graph routing in ISA 100.11a","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W2047228602","doi":"https://doi.org/10.1109/ictc.2013.6675567","mag":"2047228602"},"language":"en","primary_location":{"id":"doi:10.1109/ictc.2013.6675567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ictc.2013.6675567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on ICT Convergence (ICTC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5113605772","display_name":"Faraz Idris Khan","orcid":null},"institutions":[{"id":"https://openalex.org/I57664883","display_name":"Ajou University","ror":"https://ror.org/03tzb2h73","country_code":"KR","type":"education","lineage":["https://openalex.org/I57664883"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Faraz Idris Khan","raw_affiliation_strings":["Graduate School of Computer Engineering, Ajou University, Suwon, South Korea","Grad. Sch. of Comput. Eng., Ajou Univ., Suwon, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Computer Engineering, Ajou University, Suwon, South Korea","institution_ids":["https://openalex.org/I57664883"]},{"raw_affiliation_string":"Grad. Sch. of Comput. Eng., Ajou Univ., Suwon, South Korea","institution_ids":["https://openalex.org/I57664883"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101410896","display_name":"Ki\u2010Hyung Kim","orcid":"https://orcid.org/0000-0001-6624-3003"},"institutions":[{"id":"https://openalex.org/I57664883","display_name":"Ajou University","ror":"https://ror.org/03tzb2h73","country_code":"KR","type":"education","lineage":["https://openalex.org/I57664883"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Ki-Hyung Kim","raw_affiliation_strings":["Graduate School of Computer Engineering, Ajou University, Suwon, South Korea","Grad. Sch. of Comput. Eng., Ajou Univ., Suwon, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Computer Engineering, Ajou University, Suwon, South Korea","institution_ids":["https://openalex.org/I57664883"]},{"raw_affiliation_string":"Grad. Sch. of Comput. Eng., Ajou Univ., Suwon, South Korea","institution_ids":["https://openalex.org/I57664883"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I57664883"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"6","issue":null,"first_page":"1099","last_page":"1101"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10101","display_name":"Cloud Computing and Resource Management","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10080","display_name":"Energy Efficient Wireless Sensor Networks","score":0.9943000078201294,"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/T10273","display_name":"IoT and Edge/Fog Computing","score":0.9937000274658203,"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.7325922250747681},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5380486845970154},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4397842288017273},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4150581359863281},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3689926266670227},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2992202043533325}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7325922250747681},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5380486845970154},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4397842288017273},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4150581359863281},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3689926266670227},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2992202043533325}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ictc.2013.6675567","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ictc.2013.6675567","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 International Conference on ICT Convergence (ICTC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2156666755","https://openalex.org/W2537747452","https://openalex.org/W6682459407"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W4391913857"],"abstract_inverted_index":{"Graph":[0],"routing":[1,4],"is":[2,21,110,165],"a":[3,17,30,53,61,92,104,111,131,166,190],"protocol":[5],"opted":[6],"to":[7,38,57,100,113],"run":[8],"in":[9,76,117,142],"ISA":[10,48],"100.11a":[11,49],"based":[12,120,145,193],"networks.":[13],"Attention":[14],"towards":[15],"proposing":[16,77],"time":[18,96,106,133,191],"efficient":[19,42],"subgraph":[20],"received":[22],"by":[23],"the":[24,70,82,85,115,118,122,125,140,143,147,151,155,158,161,172],"researchers.":[25],"While":[26],"there":[27,109],"can":[28,66],"be":[29,67,101],"lot":[31],"of":[32,46,84,95,124,157,174,186],"network":[33,119,126,144],"performance":[34,83,127,156],"level":[35],"factors":[36,80],"considered":[37,178],"generate":[39,58],"subgraphs":[40,59,78,116,141,152,188],"for":[41,60,180],"and":[43],"timely":[44],"delivery":[45],"data.":[47],"specification":[50],"doesn't":[51],"specifies":[52],"graph":[54],"generation":[55],"algorithm":[56],"network.":[62,86],"Hence,":[63],"numerous":[64],"efforts":[65],"found":[68],"where":[69],"research":[71],"community":[72],"has":[73],"taken":[74],"initiative":[75],"considering":[79],"affecting":[81],"Subgraphs":[87],"which":[88,135,153,169],"are":[89],"optimal":[90],"at":[91],"particular":[93],"instance":[94],"may":[97],"not":[98,137],"prove":[99],"effective":[102],"after":[103,189],"certain":[105,132],"period.":[107],"Therefore,":[108],"need":[112],"update":[114],"on":[121,146,171,194],"history":[123,148],"parameters":[128],"accumulated":[129],"over":[130],"period":[134,192],"will":[136,149],"necessarily":[138],"regenerate":[139],"penalize":[150],"degrade":[154],"applications":[159],"using":[160],"subgraph.":[162],"Q-learning":[163,195],"mechanism":[164,168],"lightweight":[167],"works":[170],"idea":[173,185],"rewarding":[175],"an":[176,184],"action":[177],"good":[179],"environment.":[181],"We":[182],"propose":[183],"generating":[187],"mechanism.":[196]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}