The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (1995 vol.6)
pp: 760-766
ABSTRACT
<p><it>Abstract</it>—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.</p>
INDEX TERMS
Combining, hot-spot traffic, multistage interconnection network, performance analysis, queuing delay.
CITATION
Gyungho Lee, Byung-Chang Kang, Richard Y. Kain, "Analysis of Finite Buffered Multistage Combining Networks", IEEE Transactions on Parallel & Distributed Systems, vol.6, no. 7, pp. 760-766, July 1995, doi:10.1109/71.395405
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool