Demo Data from EDBT 2026 / reviewers in the wild / expert
Siddhant Agrawal
dblp:133/3851
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2013
0000-0001-5554-2278ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author
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 |
Wireless networking · 56% Cellular and mobile networks · 28% Internet architecture and protocols · 17% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cellular and mobile networks
call admission control |
0.2 | 1 | 2013 | Call admission control for real-time applications in wireless network · INFOCOM 2013 |
Wireless networking › medium access control
MAC protocol |
0.2 | 1 | 2013 | Call admission control for real-time applications in wireless network · INFOCOM 2013 |
Wireless networking › medium access control
TDMA |
0.2 | 1 | 2013 | Call admission control for real-time applications in wireless network · INFOCOM 2013 |
Internet architecture and protocols › quality of service
delay guarantee |
0.0 | 1 | 2013 | Call admission control for real-time applications in wireless network · INFOCOM 2013 |
Internet architecture and protocols
quality of service |
0.0 | 1 | 2013 | Call admission control for real-time applications in wireless network · INFOCOM 2013 |
Methods — techniques the papers use, named apart from their topics
queuing analysis · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Call admission control for real-time applications in wireless networkabstractSupporting real-time applications is paramount to sustaining the growth of wireless networks. Real time applications require strict delay guarantee, i.e., a packet delayed beyond certain predefined value is dropped. Fortunately, depending on the codec used, real-time applications can sustain some loss gracefully. Aim of an admission control algorithm is to make sure that when a new flow is admitted, its and other existing flows' packet loss on account of deadline violation is below their respective acceptable limit. The problem of admission control has been studied extensively for wireline networks. However, this analysis does not extend to wireless case on account of fading. Here, we consider a wireless network with TDMA based MAC, and for this network obtain a scalable admission control algorithm. Siddhant Agrawal, Prasanna Chaporkar, Rajan Udwani |
INFOCOM | 1 |