Rafael Schellenberg

Rafael Schellenberg

Auto-generated profile, based on publicly available information

Rafael Schellenberg

Department for Computer Science, Computer Networks Research Group, Paderborn University, Paderborn, Germany

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 April 2021 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
SSStefan Schneider
Stefan Schneider
RKRamin Khalili
Ramin Khalili
AMAdnan Manzoor
Adnan Manzoor
HQHaydar Qarawlus
Haydar Qarawlus
RSRafael Schellenberg
Rafael Schellenberg
AHArtur Hecker
Artur Hecker
Modern services consist of interconnected components, e.g., microservices in a service mesh or machine learning functions in a pipeline. These services can scale and run across multiple network nodes on demand. To process incoming traffic, service components have to be instantiated and traffic assigned to these instances, taking capacities, changing demands, and Quality of Service (QoS) requirements into account. This challenge is usually solved with custom approaches designed by experts. While this typically works well for the considered scenario, the models often rely on unrealistic assumptions or on knowledge that is not available in practice (e.g., a priori knowledge). We propose DeepCoord, a novel deep reinforcement learning approach that learns how to best coordinate services and is geared towards realistic assumptions. It interacts with the network and relies on available, possibly delayed monitoring information. Rather than defining a complex model or an algorithm on how to achieve an objective, our model-free approach adapts to various objectives and traffic patterns. An agent is trained offline without expert knowledge and then applied online with minimal overhead. Compared to a state-of-the-art heuristic, DeepCoord significantly improves flow throughput (up to 76%) and overall network utility (more than 2x) on real-world network topologies and traffic traces. It also supports optimizing multiple, possibly competing objectives, learns to respect QoS requirements, generalizes to scenarios with unseen, stochastic traffic, and scales to large real-world networks. For reproducibility and reuse, our code is publicly available.

2 November 2020
Verified
Conference Paper
Open access
SSStefan Schneider
Stefan Schneider
AMAdnan Manzoor
Adnan Manzoor
HQHaydar Qarawlus
Haydar Qarawlus
RSRafael Schellenberg
Rafael Schellenberg
HKHolger Karl
Holger Karl
AHArtur Hecker
Artur Hecker