{"id":"https://openalex.org/W7164673175","doi":"https://doi.org/10.1016/j.comnet.2026.112475","title":"A Bayesian optimization framework for optimizing sliding window RLNC","display_name":"A Bayesian optimization framework for optimizing sliding window RLNC","publication_year":2026,"publication_date":"2026-06-13","ids":{"openalex":"https://openalex.org/W7164673175","doi":"https://doi.org/10.1016/j.comnet.2026.112475"},"language":"en","primary_location":{"id":"doi:10.1016/j.comnet.2026.112475","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.comnet.2026.112475","pdf_url":null,"source":{"id":"https://openalex.org/S63392143","display_name":"Computer Networks","issn_l":"1389-1286","issn":["1389-1286","1872-7069"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.comnet.2026.112475","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036088818","display_name":"Foteini Karetsi","orcid":null},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":true,"raw_author_name":"Foteini Karetsi","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Ioannina, 45110, Ioannina, Greece"],"raw_orcid":"https://orcid.org/0009-0006-9883-2682","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Ioannina, 45110, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059959193","display_name":"Evangelos Papapetrou","orcid":"https://orcid.org/0000-0002-3927-2818"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Evangelos Papapetrou","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Ioannina, 45110, Ioannina, Greece"],"raw_orcid":"https://orcid.org/0000-0002-3927-2818","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Ioannina, 45110, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5036088818"],"corresponding_institution_ids":["https://openalex.org/I194019607"],"apc_list":{"value":2370,"currency":"USD","value_usd":2370},"apc_paid":{"value":2370,"currency":"USD","value_usd":2370},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.64350497,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"286","issue":null,"first_page":"112475","last_page":"112475"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.8306000232696533,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.8306000232696533,"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/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.03500000014901161,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.02710000053048134,"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/bayesian-optimization","display_name":"Bayesian optimization","score":0.7937999963760376},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.6136000156402588},{"id":"https://openalex.org/keywords/sliding-window-protocol","display_name":"Sliding window protocol","score":0.5746999979019165},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5497000217437744},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.4253000020980835},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.3756999969482422},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.35910001397132874},{"id":"https://openalex.org/keywords/coding-gain","display_name":"Coding gain","score":0.35199999809265137},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.3441999852657318}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8813999891281128},{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.7937999963760376},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6136000156402588},{"id":"https://openalex.org/C102392041","wikidata":"https://www.wikidata.org/wiki/Q592860","display_name":"Sliding window protocol","level":3,"score":0.5746999979019165},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5497000217437744},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.4253000020980835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4120999872684479},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.3756999969482422},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.35910001397132874},{"id":"https://openalex.org/C76862118","wikidata":"https://www.wikidata.org/wiki/Q1105671","display_name":"Coding gain","level":3,"score":0.35199999809265137},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.3441999852657318},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.34119999408721924},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.3352999985218048},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.334199994802475},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.329800009727478},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32600000500679016},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.30869999527931213},{"id":"https://openalex.org/C116709606","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Algorithmic efficiency","level":3,"score":0.30410000681877136},{"id":"https://openalex.org/C33724603","wikidata":"https://www.wikidata.org/wiki/Q812540","display_name":"Bayesian network","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.26170000433921814},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.25450000166893005},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.25220000743865967}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.comnet.2026.112475","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.comnet.2026.112475","pdf_url":null,"source":{"id":"https://openalex.org/S63392143","display_name":"Computer Networks","issn_l":"1389-1286","issn":["1389-1286","1872-7069"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Networks","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.comnet.2026.112475","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.comnet.2026.112475","pdf_url":null,"source":{"id":"https://openalex.org/S63392143","display_name":"Computer Networks","issn_l":"1389-1286","issn":["1389-1286","1872-7069"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computer Networks","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8741583075","display_name":null,"funder_award_id":"19139","funder_id":"https://openalex.org/F4320327859","funder_display_name":"Hellenic Foundation for Research and Innovation"}],"funders":[{"id":"https://openalex.org/F4320318628","display_name":"Hellenic Academic Libraries Link","ror":null},{"id":"https://openalex.org/F4320327859","display_name":"Hellenic Foundation for Research and Innovation","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W2048235391","https://openalex.org/W2063142364","https://openalex.org/W2105831729","https://openalex.org/W2192203593","https://openalex.org/W2735002564","https://openalex.org/W2760661128","https://openalex.org/W3018588313","https://openalex.org/W3037076798","https://openalex.org/W3112469981","https://openalex.org/W3130210998","https://openalex.org/W3216753527","https://openalex.org/W4220893338","https://openalex.org/W4285110069","https://openalex.org/W4296705670","https://openalex.org/W4385191287","https://openalex.org/W4389459436","https://openalex.org/W4391896142","https://openalex.org/W4393305248","https://openalex.org/W4393950811","https://openalex.org/W4407449615","https://openalex.org/W4407782543"],"related_works":[],"abstract_inverted_index":{"Sliding":[0],"Window":[1],"Random":[2],"Linear":[3],"Network":[4],"Coding":[5],"(SW":[6],"RLNC)":[7],"is":[8,61],"a":[9,97,152],"promising":[10],"approach":[11,154],"for":[12,109,130,155],"ensuring":[13],"resilient":[14],"communication":[15],"in":[16,57,161],"next-generation":[17],"networks.":[18],"In":[19,76],"order":[20],"to":[21,167],"enhance":[22],"both":[23],"the":[24,28,32,35,39,49,68,72,81,85,89,124,138,157],"coding":[25,33,40,52,73,90],"efficiency":[26,53],"and":[27,54,71,88,103],"overall":[29,55],"performance":[30,56],"of":[31,38,84,126],"scheme,":[34],"optimal":[36,143],"configuration":[37],"parameters":[41],"should":[42],"be":[43],"addressed.":[44],"Previous":[45],"studies":[46],"suggest":[47],"that":[48,137],"trade-off":[50],"between":[51],"SW":[58],"RLNC":[59],"schemes":[60],"determined":[62],"by":[63,93],"two":[64],"critical":[65],"parameters,":[66],"namely,":[67],"code":[69,86],"rate":[70,87],"window":[74,91],"size.":[75],"this":[77,131],"work,":[78],"we":[79,116,150],"address":[80],"joint":[82],"optimization":[83,132,139,159],"size":[92],"formulating":[94],"it":[95],"as":[96],"single-objective":[98],"Sequential":[99],"Model-Based":[100],"Optimization":[101,106],"problem":[102],"employ":[104],"Bayesian":[105],"(BO)":[107],"models":[108,129],"efficiently":[110],"solving":[111],"it.":[112],"To":[113],"demonstrate":[114],"proof-of-concept,":[115],"carry":[117],"out":[118],"an":[119],"extensive":[120],"evaluation":[121],"campaign":[122],"assessing":[123],"effectiveness":[125],"different":[127],"BO":[128],"problem.":[133],"The":[134],"results":[135],"confirm":[136],"framework":[140,160],"reliably":[141],"finds":[142],"solutions":[144],"with":[145],"relatively":[146],"few":[147],"evaluations.":[148],"Finally,":[149],"present":[151],"practical":[153],"leveraging":[156],"proposed":[158],"real-world":[162],"scenarios,":[163],"allowing":[164],"efficient":[165],"adaptation":[166],"channel":[168],"variations":[169],"without":[170],"requiring":[171],"real-time":[172],"re-optimization.":[173]},"counts_by_year":[],"updated_date":"2026-08-13T07:04:57.449891","created_date":"2026-06-14T00:00:00"}