EDBT 2026 Demo / reviewers in the wild / expert
Irvin Y. Wang
dblp:66/5979
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1990
—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 architecture, parallel and distributed computing, and storage systems
1 paper |
Performance modeling and evaluation · 67% Distributed systems · 33% | |
| Computer networks
1 paper |
Network performance modeling · 100% |
Topics — the 3 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network performance modeling
queueing network model |
0.0 | 1 | 1990 | Recursive computation of steady-state probabilities of nonproduct form queueing networks associated with computer network models · IEEE Trans. Commun. 1990 |
Performance modeling and evaluation › queueing models › product-form queueing networks
product-form solution |
0.0 | 1 | 1989 | Service Stage Petri Net Protocols with Product Form Solution · SIGMETRICS 1989 |
Performance modeling and evaluation › queueing models
queueing network model |
0.0 | 1 | 1989 | Service Stage Petri Net Protocols with Product Form Solution · SIGMETRICS 1989 |
Methods — techniques the papers use, named apart from their topics
state transition lattice analysis · 0.0recursive computation · 0.0product-form analysis · 0.0petri nets · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | Recursive computation of steady-state probabilities of nonproduct form queueing networks associated with computer network modelsabstractConsideration is given to the exact computation of the equilibrium state probabilities of a class of non-product-form queueing networks that is of interest for communication systems. It is shown that a specific structure in the state transition lattice leads to a sequential method of solution. The method is sequential either in terms of individual states or in terms of subsets of states. In the former case, algebraic recursions for the state probabilities can be developed. In both cases, substantial computational savings are possible.> Irvin Y. Wang, Thomas G. Robertazzi |
IEEE Trans. Commun. | 1 |
| 1989 | Service Stage Petri Net Protocols with Product Form Solution
Irvin Y. Wang, Thomas G. Robertazzi |
SIGMETRICS | 1 |