Demo Data from EDBT 2026 / reviewers in the wild / expert
San-Chiao Huang
dblp:81/506
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1993
—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 |
Network performance modeling · 93% Internet architecture and protocols · 7% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network performance modeling › point process
markov modulated poisson process |
0.0 | 1 | 1993 | HAP: A New Model for Packet Arrivals · SIGCOMM 1993 |
Network performance modeling › traffic modeling
packet arrival process |
0.0 | 1 | 1993 | HAP: A New Model for Packet Arrivals · SIGCOMM 1993 |
Network performance modeling
queueing analysis |
0.0 | 1 | 1993 | HAP: A New Model for Packet Arrivals · SIGCOMM 1993 |
Network performance modeling
traffic modeling |
0.0 | 1 | 1993 | HAP: A New Model for Packet Arrivals · SIGCOMM 1993 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0queueing theory · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | HAP: A New Model for Packet ArrivalsabstractApplications to be supported on broadband networks exhibit a wide range of traffic statistics and many of them are sensitive to delay and loss violations. To accurately estimate admissible workload and bandwidth requirement, a detailed traffic model, HAP (Hierarchical Arrival Process) is proposed in this paper. Packets generated from HAP are modulated by processes at user, application, and message levels. This model is a generalization of on-off traffic models and is shown to be equivalent to a special class of MMPP (Markov Modulated Poisson Process). Three algorithmic methods along with simulations are applied to evaluate the queueing performance under HAP traffic. Delay under HAP traffic can be well over tens of times higher than Poisson traffic, depending on parameters and load. Congestion may persist for minutes. HAP's dramatic short-term behavior explains the occasional congestion in the real networks. Conventional traffic models, however, do not exhibit this behavior. With these results, we give implications for broadband network control. Ying-Dar Lin, Tzu-Chieh Tsai, San-Chiao Huang, Mario Gerla |
SIGCOMM | 3 |