{"id":"https://openalex.org/W2515731637","doi":"https://doi.org/10.1109/iscc.2016.7543807","title":"Optimizing SLA-driven adaptive routing","display_name":"Optimizing SLA-driven adaptive routing","publication_year":2016,"publication_date":"2016-06-01","ids":{"openalex":"https://openalex.org/W2515731637","doi":"https://doi.org/10.1109/iscc.2016.7543807","mag":"2515731637"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2016.7543807","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2016.7543807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Symposium on Computers and Communication (ISCC)","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/A5030953570","display_name":"Georgios Katsikogiannis","orcid":"https://orcid.org/0000-0002-8033-5833"},"institutions":[{"id":"https://openalex.org/I154757721","display_name":"University of Piraeus","ror":"https://ror.org/02qs84g94","country_code":"GR","type":"education","lineage":["https://openalex.org/I154757721"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Georgios Katsikogiannis","raw_affiliation_strings":["Department of Informatics, University of Piraeus, Piraeus, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Piraeus, Piraeus, Greece","institution_ids":["https://openalex.org/I154757721"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026689984","display_name":"Sarandis Mitropoulos","orcid":"https://orcid.org/0000-0002-3744-855X"},"institutions":[{"id":"https://openalex.org/I154757721","display_name":"University of Piraeus","ror":"https://ror.org/02qs84g94","country_code":"GR","type":"education","lineage":["https://openalex.org/I154757721"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Sarandis Mitropoulos","raw_affiliation_strings":["Department of Informatics, University of Piraeus, Piraeus, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Piraeus, Piraeus, Greece","institution_ids":["https://openalex.org/I154757721"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000463728","display_name":"Christos Douligeris","orcid":"https://orcid.org/0000-0002-6849-6693"},"institutions":[{"id":"https://openalex.org/I154757721","display_name":"University of Piraeus","ror":"https://ror.org/02qs84g94","country_code":"GR","type":"education","lineage":["https://openalex.org/I154757721"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Christos Douligeris","raw_affiliation_strings":["Department of Informatics, University of Piraeus, Piraeus, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Informatics, University of Piraeus, Piraeus, Greece","institution_ids":["https://openalex.org/I154757721"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154757721"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"627","last_page":"632"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998999834060669,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9998999834060669,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9998000264167786,"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/T11598","display_name":"Internet Traffic Analysis and Secure E-voting","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.8160961866378784},{"id":"https://openalex.org/keywords/policy-based-routing","display_name":"Policy-based routing","score":0.6666502356529236},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.6202836036682129},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.612157940864563},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5735272765159607},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5141596794128418},{"id":"https://openalex.org/keywords/adaptive-routing","display_name":"Adaptive routing","score":0.49520912766456604},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.49088627099990845},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.47976645827293396},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46248847246170044},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.4502522051334381},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.41923969984054565},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4186219573020935},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3268629014492035}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8160961866378784},{"id":"https://openalex.org/C196423136","wikidata":"https://www.wikidata.org/wiki/Q7209671","display_name":"Policy-based routing","level":5,"score":0.6666502356529236},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.6202836036682129},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.612157940864563},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5735272765159607},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5141596794128418},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.49520912766456604},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.49088627099990845},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.47976645827293396},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46248847246170044},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.4502522051334381},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.41923969984054565},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4186219573020935},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3268629014492035},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscc.2016.7543807","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2016.7543807","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Symposium on Computers and Communication (ISCC)","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":11,"referenced_works":["https://openalex.org/W273611289","https://openalex.org/W2021805553","https://openalex.org/W2065554567","https://openalex.org/W2073323913","https://openalex.org/W2080944062","https://openalex.org/W2105818150","https://openalex.org/W2115377324","https://openalex.org/W2131006316","https://openalex.org/W2148008863","https://openalex.org/W3009217644","https://openalex.org/W3098522360"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W4253436398","https://openalex.org/W2068473861","https://openalex.org/W2607223747","https://openalex.org/W2351878639","https://openalex.org/W1538003338","https://openalex.org/W2556128816","https://openalex.org/W2369989480","https://openalex.org/W4211082391","https://openalex.org/W1998565297"],"abstract_inverted_index":{"As":[0],"network":[1,116],"complexity":[2],"and":[3,24,39,72,76,81,94,109,137],"heterogeneity":[4],"have":[5],"increased":[6],"dramatically":[7],"in":[8],"the":[9,35,40,55,59,64,70,84,89,139],"last":[10],"decade,":[11],"modern":[12],"policy-based":[13],"management":[14,42],"techniques":[15],"for":[16,44],"adaptive":[17,45,91],"routing":[18,66,92,106],"decisions":[19],"regarding":[20],"path":[21,26,132,141],"selection":[22],"optimization":[23],"intelligent":[25],"control":[27],"are":[28],"necessary.":[29],"In":[30],"this":[31],"paper,":[32],"we":[33,48,82,119],"analyze":[34],"application":[36],"performance":[37,102],"requirements,":[38],"event-based":[41],"options":[43],"routing.":[46],"Then,":[47],"propose":[49],"an":[50],"innovative":[51],"model":[52,80,86],"to":[53,114],"monitor":[54],"appropriate":[56,90],"indicators":[57],"with":[58],"suitable":[60],"detectors,":[61],"which":[62],"improves":[63],"dynamic":[65,115],"performance.":[67],"We":[68],"present":[69],"design":[71],"implementation":[73],"of":[74],"Performance-based":[75],"Event-Management":[77],"Routing":[78],"(PEMR)":[79],"validate":[83],"proposed":[85],"by":[87],"enforcing":[88],"policies":[93,124],"decisions.":[95],"PEMR":[96],"can":[97,111,120],"resolve":[98],"failed":[99],"or":[100],"poorly":[101],"paths":[103,107],"into":[104],"alternative":[105],"automatically":[108],"it":[110],"adapt":[112],"quickly":[113],"conditions.":[117],"Besides,":[118],"avoid":[121],"any":[122],"conflicting":[123],"(i.e.":[125],"traffic":[126],"load":[127],"distribution":[128],"versus":[129,134],"cost":[130],"minimization,":[131],"availability":[133],"response":[135],"time),":[136],"facilitate":[138],"optimum":[140],"selection.":[142]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}