Demo Data from EDBT 2026 / reviewers in the wild / expert
Phani Kumar Arava
dblp:08/1572
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Applied, interdisciplinary, general and emerging computing · 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 architecture, parallel and distributed computing, and storage systems
1 paper |
Embedded and real-time systems · 100% | |
| Computer networks
1 paper |
Network measurement and analytics · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Embedded and real-time systems › real-time scheduling › deadline scheduling
EDF scheduling |
0.1 | 1 | 2005 | Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements · RTSS 2005 |
Embedded and real-time systems
real-time scheduling |
0.1 | 1 | 2005 | Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements · RTSS 2005 |
Network measurement and analytics › network performance measurement
network performance monitoring |
0.0 | 1 | 2005 | Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active Measurements · RTSS 2005 |
Methods — techniques the papers use, named apart from their topics
on-demand scheduling · 0.1offline scheduling · 0.1earliest-deadline-first heuristic · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | Enhanced EDF Scheduling Algorithms for Orchestrating Network-Wide Active MeasurementsabstractMonitoring network status such as end-to-end delay, jitter, and available bandwidth is important to support QoS-sensitive applications and timely detection of network anomalies like denial of service attacks. For this purpose, Internet service providers (ISPs) have started to instrument their networks with network measurement infrastructures (NMIs) that periodically run active measurement tasks using measurement servers located at strategic points in their networks. However, one problem that most network engineers have overlooked is the measurement conflict problem. Since active measurement tasks actively inject test packets to collect measurements along network paths, running multiple active measurements at the same time over the same path could result in misleading reports of network performance. We call this phenomenon a measurement conflict. Our recent observation of such measurement conflict motivates us to form a measurement task scheduling problem of meeting periodicity requirements, where real-time scheduling algorithms can play a role. The scheduling problem, however, is not exactly same as any of the existing scheduling problems in the realtime literature, because the problem involves multiple measurement servers running multiple measurement tasks whose conflict dependency propagates along the chains of paths. For this problem, we propose to use an EDF (earliest deadline first) heuristic but allowing "concurrent executions" if possible, to construct an offline schedule for a given measurement task set. Also, we propose a novel mechanism to flexibly use the offline schedule for minimizing the response time of dynamic on-demand measurement jobs. Further, we implement and deploy our scheduling algorithms in a real working NMI for monitoring Internet 2 Abilene network. Prasad Calyam, Chang-Gun Lee, Phani Kumar Arava, Dima Krymskiy |
RTSS | 3 |