Demo Data from VLDB 2026 / reviewers in the wild / expert
Theodore E. Tedijanto
dblp:13/3587
· DBLP profile ↗
3ranked-venue papers
3as first author
0since 2021 · last 1993
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 first-authorComputer 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 |
Internet architecture and protocols · 87% Network performance modeling · 13% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Internet architecture and protocols › traffic shaping
leaky bucket |
0.0 | 1 | 1993 | Effectiveness of Dynamic Bandwidth Management Mechanisms in ATM Networks · INFOCOM 1993 |
Internet architecture and protocols
traffic management |
0.0 | 1 | 1993 | Effectiveness of Dynamic Bandwidth Management Mechanisms in ATM Networks · INFOCOM 1993 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | Effectiveness of Dynamic Bandwidth Management Mechanisms in ATM NetworksabstractThe leaky bucket, a credit management system that allows cells to enter the network only if sufficient credit is available, is considered. Motivation for an in-depth study of dynamic control algorithms, to avoid congestion in high-speed networks under time varying traffic statistics, is provided. The need for real-time traffic measurements and dynamic control actions for long-lived connections is demonstrated. In particular, it is shown through simulations that implementing access control algorithms based on the bandwidth allocation procedures only at connection setup is not sufficient for congestion-free operation of the network. It is further shown that if the bandwidth allocation and the leaky bucket parameters are not dynamically adjusted, the performances of the connections depend on their initial parameters and can be very undesirable as the traffic parameters change over time. Moreover, if corrective actions are not taken, congestion may build up in the network even in the presence of leaky buckets. The simple dynamic approach proposed limits the congestion periods in the network to the time scales of the connection-level controls. Therefore, the probability of many connections sending excess traffic into the network at the same time is greatly reduced, alleviating the congestion problem.> Theodore E. Tedijanto, Levent Gün |
INFOCOM | 1 |
| 1992 | A Note on the Comparison Between Bernoulli and Limited Policies in Vacation Models
Theodore E. Tedijanto |
Perform. Evaluation | 1 |
| 1990 | Exact Results for the Cyclic-Service Queue with a Bernoulli Schedule
Theodore E. Tedijanto |
Perform. Evaluation | 1 |