Demo Data from EDBT 2026 / reviewers in the wild / expert
Wayne P. Stohs
dblp:07/4627
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1984
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 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 architecture, parallel and distributed computing, and storage systems
1 paper |
Performance modeling and evaluation · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Performance modeling and evaluation
queueing models |
0.0 | 1 | 1984 | Some Equivalence Results for Load-Independent Exponential Queueing Networks · IEEE Trans. Software Eng. 1984 |
Performance modeling and evaluation › queueing models
queueing network analysis |
0.0 | 1 | 1984 | Some Equivalence Results for Load-Independent Exponential Queueing Networks · IEEE Trans. Software Eng. 1984 |
Methods — techniques the papers use, named apart from their topics
stochastic routing matrix analysis · 0.0product form network analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1984 | Some Equivalence Results for Load-Independent Exponential Queueing NetworksabstractIn this paper we derive a number of results concerning the behavior of closed load-independent exponential queueing networks. It is shown that if the service rate of any station is increased (decreased), then the throughput of the network itself also increases (decreases). This is not true for product form networks in general. In addition, if the service rate at server i is increased then both the mean queue length and mean waiting time at server i decrease while both these quantities increase at all stations j ≠ i. The opposite effect is observed if the senrvice rate at station i is decreased. The main result of the paper is a proof of the conjective that corresponding to any general closed queueing network consisting of M stations and in which N customers circulate according to the elements of an irreducible stochastic routing matrix Q, there exists a closed load-independent exponential queueing network with the same M, N, and Q such that the mean number of customers at each station in the exponential network is equal to that in the general network. If the network throughput is specified, it is shown that this exponential network iS unique. William J. Stewart 0001, Wayne P. Stohs |
IEEE Trans. Software Eng. | 2 |