Name
Abstract | ||
|---|---|---|
This paper studies three-stage Clos switching net- works for multicast communications in terms of their blocking probabilities on a random traffic model. Even though the lack of multicast capability in input-stage switches requires a prohib- itively large number of middle switches to provide compatible requests with nonblocking paths, the probabilistic model gives an observation that the blocking probability decreases drastically and then approaches zero as the number of middle switches is far less than the theoretical bound. The S-shaped curves of blocking probability versus degree of fanout indicate that high fanout requests are mostly blocked at some given reference network utilization. A split routing algorithm and its blocking probability are introduced to enhance the routability of the high fanout requests. We also corroborate the analytic model by performing network simulations based on a random request generator and a random routing strategy. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1109/90.865080 | IEEE/ACM Trans. Netw. |
Keywords | Field | DocType |
Routing,Multicast algorithms,Switches,Communication switching,Multicast communication,Computer science,Telecommunication traffic,Traffic control,Performance analysis,Computational modeling | Random routing,Computer science,Clos network,Computer network,Traffic model,Multistage interconnection networks,Statistical model,Multicast,Analytic model,Routing algorithm,Distributed computing | Journal |
Volume | Issue | ISSN |
8 | 4 | 1063-6692 |
Citations | PageRank | References |
6 | 0.55 | 8 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dongsoo S. Kim | 1 | 150 | 20.40 |
| Ding-Zhu Du | 2 | 3497 | 283.06 |