Demo Data from EDBT 2026 / reviewers in the wild / expert
Andras Weber
dblp:14/5594
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1991
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer 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 |
Network performance modeling · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Performance modeling and evaluation · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network performance modeling › packet loss
loss probability estimation |
0.0 | 1 | 1991 | Multichannel Circuit Switching-Performance Evaluation of Switching Networks · IEEE J. Sel. Areas Commun. 1991 |
Performance modeling and evaluation
analytical modeling |
0.0 | 1 | 1991 | Multichannel Circuit Switching-Performance Evaluation of Switching Networks · IEEE J. Sel. Areas Commun. 1991 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0analytical approximation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1991 | Multichannel Circuit Switching-Performance Evaluation of Switching NetworksabstractAn approximate analytical method is presented for the estimation of the loss probability for single and multichannel calls in TST (time-space-time) switching networks. Two extended methods are described. The assumptions for the basic method are that: all occupation patterns of the two internal highways between a certain start and destination highway for a given number of occupied channels have the same probability, and that the state probabilities of the start and destination highway are given by a multidimensional Erlang distribution. Based on this method, the second approximation considers calls that are switched from start to destination highway. In a third method, the dependency of the states of all input and output highways is taken into account. The basic approximation has shown the best agreement with the simulation results. The other methods take into account additional properties of TST switching networks for single and multichannel connections. In order to keep the state space in a reasonable size, additional assumptions had to be used which impair the results significantly compared to the basic approximation method.> Andras Weber, Wolfgang Fischer 0002, Manfred N. Huber |
IEEE J. Sel. Areas Commun. | 1 |