Abstract
Analyzing the performance of finite buffered multistage networks has been considered a difficult task because of dynamic blocking effects due to finite sized buffers. With the multistage networks enhanced with combining capability, in which multiple requests directed to a shared location combine together to form a single request to be forwarded, the analysis becomes even more difficult due to the interactions between combining probability and queuing delay. Performance bounds for combining networks are known under two extreme assumptions: infinite combining queues and saturated finite combining queues. We analyze multistage combining networks with the consideration of blocking due to finite combining queues. Our analysis provides iterative solutions for combining probability, blocking probability, and queuing delay.
| Original language | English |
|---|---|
| Pages (from-to) | 760-766 |
| Number of pages | 7 |
| Journal | IEEE Transactions on Parallel and Distributed Systems |
| Volume | 6 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - 1995 Jul |
Bibliographical note
Funding Information:This work was supported in part by the National Science Foundation under Grants CDA-9121641, CDA-9222901, and MIP-9204066; by the Department of Energy under Grant DE-FG02-93ER25 167; and by an Ameritech faculty fellowship.
Keywords
- Combining
- hot-spot traffic
- multistage interconnection
- network
- performance analysis
- queuing delay
ASJC Scopus subject areas
- Signal Processing
- Hardware and Architecture
- Computational Theory and Mathematics