Demo Data from EDBT 2026 / reviewers in the wild / expert
Mathew P. Haynos
dblp:77/3630
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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 |
Interconnection networks and networks-on-chip · 87% Hardware reliability and fault tolerance · 13% | |
| Computer networks
1 paper |
Network performance modeling · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Network performance modeling › loss systems
blocking probability |
0.0 | 1 | 1999 | An Analytical Model on the Blocking Probability of a Fault-Tolerant Network · IEEE Trans. Parallel Distributed Syst. 1999 |
Interconnection networks and networks-on-chip › switching network
clos network |
0.0 | 1 | 1999 | An Analytical Model on the Blocking Probability of a Fault-Tolerant Network · IEEE Trans. Parallel Distributed Syst. 1999 |
Interconnection networks and networks-on-chip › switching network
multistage interconnection network |
0.0 | 1 | 1999 | An Analytical Model on the Blocking Probability of a Fault-Tolerant Network · IEEE Trans. Parallel Distributed Syst. 1999 |
Hardware reliability and fault tolerance
network fault tolerance |
0.0 | 1 | 1999 | An Analytical Model on the Blocking Probability of a Fault-Tolerant Network · IEEE Trans. Parallel Distributed Syst. 1999 |
Methods — techniques the papers use, named apart from their topics
simulation · 0.0analytical modeling · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | An Analytical Model on the Blocking Probability of a Fault-Tolerant NetworkabstractThe well-known Clos network has been extensively used for telephone switching, multiprocessor interconnection and data communications. Much work has been done to develop analytical models for understanding the routing blocking probability of the Clos network. However, none of the analytical models for estimating the blocking probability of this type of network have taken into account the very real possibility of the interstage links in the network failing. In this paper, we consider the routing between arbitrary network inputs and outputs in the Clos network in the presence of interstage link faults. In particular, we present an analytical model for the routing blocking probability of the Clos network which incorporates the probability of interstage link failure to allow for a more realistic and useful determination of the approximation of blocking probability. We also conduct extensive simulations to validate the model. Our analytical and simulation results demonstrate that for a relatively small interstage link failure probability, the blocking behavior of the Clos network is similar to that of a fault-free network, and indicate that the Clos network has a good fault-tolerant capability. The new integrated analytical model can guide network designers in the determination of the effects of network failure on the overall connecting capability of the network and allows for the examination of the relationship between network utilization and network failure. Mathew P. Haynos, Yuanyuan Yang 0001 |
IEEE Trans. Parallel Distributed Syst. | 1 |