Demo Data from EDBT 2026 / reviewers in the wild / expert
Per Tengkvist
dblp:206/0441
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2020
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer networks
1 paper |
Network measurement and analytics · 62% Cellular and mobile networks · 19% Edge and fog computing · 19% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network measurement and analytics
traffic prediction |
0.4 | 1 | 2020 | A Meta-Learning Scheme for Adaptive Short-Term Network Traffic Prediction · IEEE J. Sel. Areas Commun. 2020 |
Cellular and mobile networks › resource scheduling
cellular network scheduling |
0.1 | 1 | 2020 | A Meta-Learning Scheme for Adaptive Short-Term Network Traffic Prediction · IEEE J. Sel. Areas Commun. 2020 |
Edge and fog computing › resource management
resource provisioning |
0.1 | 1 | 2020 | A Meta-Learning Scheme for Adaptive Short-Term Network Traffic Prediction · IEEE J. Sel. Areas Commun. 2020 |
Methods — techniques the papers use, named apart from their topics
meta-learning · 0.4deep reinforcement learning · 0.4adversarial learning · 0.4
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | A Meta-Learning Scheme for Adaptive Short-Term Network Traffic PredictionabstractNetwork traffic prediction is a fundamental prerequisite for dynamic resource provisioning in wireline and wireless networks, but is known to be challenging due to non-stationarity and due to its burstiness and self-similar nature. The prediction of network traffic at the user level is particularly challenging, because the traffic characteristics emerge from a complex interaction of user level and application protocol behavior. In this work we address the problem of predicting the network traffic at the user level over a short horizon, motivated by its applications in cellular scheduling. Motivated by recent works on robust adversarial learning, we treat the prediction problem for non-stationary traffic in an adversarial context, and propose a meta-learning scheme that consists of a set of predictors, each optimized to predict a particular kind of traffic, and of a master policy that is trained for choosing the best fit predictor dynamically based on recent prediction performance, using deep reinforcement learning. We evaluate the proposed meta-learning scheme on a variety of traffic traces consisting of video and non-video traffic. Our results show that it consistently outperforms state-of-the-art predictors, and can adapt to before unseen traffic without the need for retraining the individual predictors. Qing He 0002, Arash Moayyedi, György Dán, Georgios P. Koudouridis, Per Tengkvist |
IEEE J. Sel. Areas Commun. | 5 |