Demo Data from VLDB 2026 / reviewers in the wild / expert
Sandeep Bajaj
dblp:10/571
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1998
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 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
2 papers |
Internet architecture and protocols · 61% Wireless networking · 30% Transport protocols and congestion control · 9% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols › buffer management
packet dropping policy |
0.0 | 1 | 1998 | Uniform versus Priority Dropping for Layered Video · SIGCOMM 1998 |
Wireless networking › scheduling › scheduling policy
priority service |
0.0 | 1 | 1998 | Is Service Priority Useful in Networks? · SIGMETRICS 1998 |
Internet architecture and protocols
quality of service |
0.0 | 1 | 1998 | Is Service Priority Useful in Networks? · SIGMETRICS 1998 |
Methods — techniques the papers use, named apart from their topics
utility modeling · 0.0simulation · 0.0queueing analysis · 0.0analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | Uniform versus Priority Dropping for Layered VideoabstractIn this paper, we analyze the relative merits of uniform versus priority dropping for the transmission of layered video. We first present our original intuitions about these two approaches, and then investigate the issue more thoroughly through simulations and analysis in which we explicitly model the performance of layered video applications. We compare both their performance characteristics and incentive properties, and find that the performance benefit of priority dropping is smaller than we expected, while uniform dropping has worse incentive properties than we previously believed. Sandeep Bajaj, Lee Breslau, Scott Shenker |
SIGCOMM | 1 |
| 1998 | Is Service Priority Useful in Networks?abstractA key question in the definition of new services for the Internet is whether to provide a single class of relaxed real-time service or multiple levels differentiated by their delay characteristics. In that context we pose the question: is service priority useful in networks? We argue that, contrary to some of our earlier work, to properly address this question one cannot just consider raw network-centric performance numbers, such as the delay distribution. Rather, one must incorporate two new elements into the analysis: the utility functions of the applications (how application performance depends on network service), and the adaptive nature of applications (how applications react to changing network service). This last point is especially crucial; modern Internet applications are designed to tolerate a wide range of network service quality, and they do so by adapting to the current network conditions. Most previous investigations of network performance have neglected to include this adaptive behavior.In this paper we present an analysis of service priority in the context of audio applications embodying these two elements: utility functions and adaptation. Our investigation is far from conclusive. The definitive answer to the question depends on many factors that are outside the scope of this paper and are, at present, unknowable, such as the burstiness of future Internet traffic and the relative offered loads of best-effort and real-time applications. Despite these shortcomings, our analysis illustrates this new approach to evaluating network design decisions, and sheds some light on the properties of adaptive applications. Sandeep Bajaj, Lee Breslau, Scott Shenker |
SIGMETRICS | 1 |