{"id":"https://openalex.org/W3106721146","doi":"https://doi.org/10.23919/cnsm50824.2020.9269072","title":"Prediction-based Flow Routing in Programmable Networks with P4","display_name":"Prediction-based Flow Routing in Programmable Networks with P4","publication_year":2020,"publication_date":"2020-11-02","ids":{"openalex":"https://openalex.org/W3106721146","doi":"https://doi.org/10.23919/cnsm50824.2020.9269072","mag":"3106721146"},"language":"en","primary_location":{"id":"doi:10.23919/cnsm50824.2020.9269072","is_oa":false,"landing_page_url":"https://doi.org/10.23919/cnsm50824.2020.9269072","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 16th International Conference on Network and Service Management (CNSM)","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/A5007226831","display_name":"Christoph Hardegen","orcid":"https://orcid.org/0000-0003-4002-6160"},"institutions":[{"id":"https://openalex.org/I201850948","display_name":"Fulda University of Applied Sciences","ror":"https://ror.org/041bz9r75","country_code":"DE","type":"education","lineage":["https://openalex.org/I201850948"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Christoph Hardegen","raw_affiliation_strings":["Department of Applied Computer Science, Fulda University of Applied Sciences, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Applied Computer Science, Fulda University of Applied Sciences, Germany","institution_ids":["https://openalex.org/I201850948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057029027","display_name":"Sebastian Rieger","orcid":"https://orcid.org/0000-0003-3597-6284"},"institutions":[{"id":"https://openalex.org/I201850948","display_name":"Fulda University of Applied Sciences","ror":"https://ror.org/041bz9r75","country_code":"DE","type":"education","lineage":["https://openalex.org/I201850948"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Sebastian Rieger","raw_affiliation_strings":["Department of Applied Computer Science, Fulda University of Applied Sciences, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Applied Computer Science, Fulda University of Applied Sciences, Germany","institution_ids":["https://openalex.org/I201850948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5007226831"],"corresponding_institution_ids":["https://openalex.org/I201850948"],"apc_list":null,"apc_paid":null,"fwci":0.7709,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.75083084,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"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/T10138","display_name":"Network Traffic and Congestion Control","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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9997000098228455,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7728514671325684},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.7013318538665771},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.604718804359436},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.6025670766830444},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6009671092033386},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5638041496276855},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.5467343330383301},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5266100168228149},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5085932016372681},{"id":"https://openalex.org/keywords/routing-table","display_name":"Routing table","score":0.49743154644966125},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49410155415534973},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4813581109046936},{"id":"https://openalex.org/keywords/routing-domain","display_name":"Routing domain","score":0.47878921031951904},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.4787101745605469},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.472535640001297},{"id":"https://openalex.org/keywords/hierarchical-routing","display_name":"Hierarchical routing","score":0.4543165862560272},{"id":"https://openalex.org/keywords/forwarding-plane","display_name":"Forwarding plane","score":0.4352724552154541},{"id":"https://openalex.org/keywords/data-flow-diagram","display_name":"Data flow diagram","score":0.4251560568809509},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3686833381652832},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.3125513195991516},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12344306707382202},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12332746386528015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08907121419906616}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7728514671325684},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.7013318538665771},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.604718804359436},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.6025670766830444},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6009671092033386},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5638041496276855},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.5467343330383301},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5266100168228149},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5085932016372681},{"id":"https://openalex.org/C184896649","wikidata":"https://www.wikidata.org/wiki/Q290066","display_name":"Routing table","level":4,"score":0.49743154644966125},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49410155415534973},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4813581109046936},{"id":"https://openalex.org/C94600068","wikidata":"https://www.wikidata.org/wiki/Q7371621","display_name":"Routing domain","level":5,"score":0.47878921031951904},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.4787101745605469},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.472535640001297},{"id":"https://openalex.org/C177818476","wikidata":"https://www.wikidata.org/wiki/Q12878103","display_name":"Hierarchical routing","level":5,"score":0.4543165862560272},{"id":"https://openalex.org/C10597312","wikidata":"https://www.wikidata.org/wiki/Q5473302","display_name":"Forwarding plane","level":3,"score":0.4352724552154541},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.4251560568809509},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3686833381652832},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.3125513195991516},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12344306707382202},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12332746386528015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08907121419906616},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/cnsm50824.2020.9269072","is_oa":false,"landing_page_url":"https://doi.org/10.23919/cnsm50824.2020.9269072","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 16th International Conference on Network and Service Management (CNSM)","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":18,"referenced_works":["https://openalex.org/W1698388015","https://openalex.org/W1978175770","https://openalex.org/W1994926493","https://openalex.org/W2040340473","https://openalex.org/W2132022337","https://openalex.org/W2169246522","https://openalex.org/W2465793152","https://openalex.org/W2567615407","https://openalex.org/W2759910885","https://openalex.org/W2809684781","https://openalex.org/W2915357319","https://openalex.org/W3008784007","https://openalex.org/W3009230553","https://openalex.org/W3009898780","https://openalex.org/W3010002476","https://openalex.org/W3088665058","https://openalex.org/W6679191575","https://openalex.org/W6774779351"],"related_works":["https://openalex.org/W2140700113","https://openalex.org/W2101319396","https://openalex.org/W1993229082","https://openalex.org/W2081873092","https://openalex.org/W2151076198","https://openalex.org/W2102668930","https://openalex.org/W1554946786","https://openalex.org/W2497187365","https://openalex.org/W2162675074","https://openalex.org/W1644042465"],"abstract_inverted_index":{"Distributing":[0],"the":[1,72,76],"load":[2],"of":[3,31,75],"arising":[4],"network":[5],"flows":[6],"with":[7],"varying":[8],"characteristics":[9,48],"across":[10],"available":[11],"topology":[12,43],"links":[13,33],"and":[14,17,40,49,64],"paths":[15],"efficiently":[16],"up":[18],"to":[19,61,70],"capacity":[20],"is":[21,53,59],"challenging.":[22],"To":[23],"allow":[24],"for":[25],"an":[26],"optimized":[27],"(e.g.,":[28],"equalized)":[29],"utilization":[30],"multiple":[32],"or":[34],"paths,":[35],"a":[36],"flow":[37,47,56],"routing":[38,66],"paradigm":[39],"architecture":[41],"leveraging":[42],"state":[44],"snapshots,":[45],"predicted":[46],"data":[50],"plane":[51],"programmability":[52],"proposed.":[54],"This":[55],"steering":[57],"strategy":[58],"compared":[60],"existing":[62],"shortest":[63],"multi-path":[65],"methods.":[67],"Moreover,":[68],"enhancements":[69],"increase":[71],"practical":[73],"applicability":[74],"proposed":[77],"solution":[78],"are":[79],"discussed.":[80]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}