Analysis of finite buffered multistage combining networks

Kyung Ho Lee, Byung Chang Kang, Richard Y. Kain

Research output: Contribution to journalArticle

3 Citations (Scopus)

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 languageEnglish
Pages (from-to)760-766
Number of pages7
JournalIEEE Transactions on Parallel and Distributed Systems
Volume6
Issue number7
DOIs
Publication statusPublished - 1995 Jul 1
Externally publishedYes

Fingerprint

Queue
Blocking probability
Queuing
Performance Bounds
Blocking Probability
Iterative Solution
Buffer
Extremes
Interaction

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Electrical and Electronic Engineering
  • Theoretical Computer Science

Cite this

Analysis of finite buffered multistage combining networks. / Lee, Kyung Ho; Kang, Byung Chang; Kain, Richard Y.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 6, No. 7, 01.07.1995, p. 760-766.

Research output: Contribution to journalArticle

Lee, Kyung Ho ; Kang, Byung Chang ; Kain, Richard Y. / Analysis of finite buffered multistage combining networks. In: IEEE Transactions on Parallel and Distributed Systems. 1995 ; Vol. 6, No. 7. pp. 760-766.
@article{d3842c5e34e6408ba3816a37dc31d79b,
title = "Analysis of finite buffered multistage combining networks",
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.",
author = "Lee, {Kyung Ho} and Kang, {Byung Chang} and Kain, {Richard Y.}",
year = "1995",
month = "7",
day = "1",
doi = "10.1109/71.395405",
language = "English",
volume = "6",
pages = "760--766",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "7",

}

TY - JOUR

T1 - Analysis of finite buffered multistage combining networks

AU - Lee, Kyung Ho

AU - Kang, Byung Chang

AU - Kain, Richard Y.

PY - 1995/7/1

Y1 - 1995/7/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029345359&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029345359&partnerID=8YFLogxK

U2 - 10.1109/71.395405

DO - 10.1109/71.395405

M3 - Article

AN - SCOPUS:0029345359

VL - 6

SP - 760

EP - 766

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 7

ER -