Demo Data from VLDB 2026 / reviewers in the wild / expert
Pedram Jaefari Fard
dblp:51/4292
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2001
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 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 networks
1 paper |
Transport protocols and congestion control · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Transport protocols and congestion control › ATM congestion control
ABR flow control |
0.0 | 1 | 2001 | Optimal structured feedback policies for ABR flow control using two-timescale SPSA · IEEE/ACM Trans. Netw. 2001 |
Transport protocols and congestion control › rate-based flow control
rate-based feedback control |
0.0 | 1 | 2001 | Optimal structured feedback policies for ABR flow control using two-timescale SPSA · IEEE/ACM Trans. Netw. 2001 |
Transport protocols and congestion control › TCP congestion control
congestion avoidance |
0.0 | 1 | 2001 | Optimal structured feedback policies for ABR flow control using two-timescale SPSA · IEEE/ACM Trans. Netw. 2001 |
Methods — techniques the papers use, named apart from their topics
two-timescale SPSA · 0.0stochastic approximation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2001 | Optimal structured feedback policies for ABR flow control using two-timescale SPSAabstractOptimal structured feedback control policies for rate-based flow control of available bit rate service in asynchronous transfer mode networks are obtained in the presence of information and propagation delays, using a numerically efficient two-timescale simultaneous perturbation stochastic approximation (SPSA) algorithm. Models comprising both a single bottleneck node and a network with multiple bottleneck nodes are considered. A convergence analysis of the algorithm is presented. Numerical experiments demonstrate fast convergence even in the presence of significant delays. We also illustrate performance comparisons with the well-known explicit rate indication for congestion avoidance (ERICA) algorithm and describe another algorithm (based on ERICA) that does not require estimating available bandwidth (as in ERICA). Shalabh Bhatnagar, Michael C. Fu 0001, Steven I. Marcus, Pedram Jaefari Fard |
IEEE/ACM Trans. Netw. | 4 |