Demo Data from VLDB 2026 / reviewers in the wild / expert
Sai Kiran Burle
dblp:181/1444
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 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 |
Performance modeling and evaluation · 67% Interconnection networks and networks-on-chip · 33% | |
| Computer networks
1 paper |
Routing and switching · 50% Network optimization and economics · 50% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network optimization and economics › throughput-optimal scheduling
max-weight scheduling |
0.2 | 1 | 2016 | Optimal Heavy-Traffic Queue Length Scaling in an Incompletely Saturated Switch · SIGMETRICS 2016 |
Routing and switching
switch scheduling |
0.2 | 1 | 2016 | Optimal Heavy-Traffic Queue Length Scaling in an Incompletely Saturated Switch · SIGMETRICS 2016 |
Performance modeling and evaluation › queueing models
heavy-traffic analysis |
0.2 | 1 | 2016 | Optimal Heavy-Traffic Queue Length Scaling in an Incompletely Saturated Switch · SIGMETRICS 2016 |
Interconnection networks and networks-on-chip › switch architecture
input-queued switch |
0.2 | 1 | 2016 | Optimal Heavy-Traffic Queue Length Scaling in an Incompletely Saturated Switch · SIGMETRICS 2016 |
Performance modeling and evaluation
queueing models |
0.2 | 1 | 2016 | Optimal Heavy-Traffic Queue Length Scaling in an Incompletely Saturated Switch · SIGMETRICS 2016 |
Methods — techniques the papers use, named apart from their topics
drift technique · 0.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Optimal Heavy-Traffic Queue Length Scaling in an Incompletely Saturated SwitchabstractWe consider an input queued switch operating under the MaxWeight scheduling algorithm. This system is interesting to study because it is a model for Internet routers and data center networks. Recently, it was shown that the MaxWeight algorithm has optimal heavy-traffic queue length scaling when all ports are uniformly saturated. Here we consider the case where a fraction of the ports are saturated and others are not (which we call the incompletely saturated case), and also the case where the rates at which the ports are saturated can be different. We use a recently developed drift technique to show that the heavy-traffic queue length under the MaxWeight scheduling algorithm has optimal scaling with respect to the switch size even in these cases. Siva Theja Maguluri, Sai Kiran Burle, R. Srikant 0001 |
SIGMETRICS | 2 |