IEICE TRANSACTIONS on Communications
The Maximum Throughput of a Nonblocking Packet Switch with Window Policy
Summary :
It is known that in a nonblocking packet switch with input queueing, head-of-line (HOL) blocking affects significantly the maximum throughput of the packet switch. To alleviate the HOL blocking effect, a window policy has been proposed in that each input queue can scan up to a fixed number of packets (called the window size) to select for transmission on the outputs. However, the performance of the window policy has never been precisely characterized. In this paper, we use a closed queueing network model to characterize the performance of the packet switch with window policy. We obtain explicit closed-form formulae for the maximum throughput of the packet switch as a function of the window size. Both balanced and imbalanced traffic patterns are discussed. The formulae can easily determine the effectiveness of the window policy.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E80-B No.4 pp.573-580
- Publication Date
- 1997/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Switching and Communication Processing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Dye-Jyun MA, "The Maximum Throughput of a Nonblocking Packet Switch with Window Policy" in IEICE TRANSACTIONS on Communications,
vol. E80-B, no. 4, pp. 573-580, April 1997, doi: .
Abstract: It is known that in a nonblocking packet switch with input queueing, head-of-line (HOL) blocking affects significantly the maximum throughput of the packet switch. To alleviate the HOL blocking effect, a window policy has been proposed in that each input queue can scan up to a fixed number of packets (called the window size) to select for transmission on the outputs. However, the performance of the window policy has never been precisely characterized. In this paper, we use a closed queueing network model to characterize the performance of the packet switch with window policy. We obtain explicit closed-form formulae for the maximum throughput of the packet switch as a function of the window size. Both balanced and imbalanced traffic patterns are discussed. The formulae can easily determine the effectiveness of the window policy.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e80-b_4_573/_p
Copy
@ARTICLE{e80-b_4_573,
author={Dye-Jyun MA, },
journal={IEICE TRANSACTIONS on Communications},
title={The Maximum Throughput of a Nonblocking Packet Switch with Window Policy},
year={1997},
volume={E80-B},
number={4},
pages={573-580},
abstract={It is known that in a nonblocking packet switch with input queueing, head-of-line (HOL) blocking affects significantly the maximum throughput of the packet switch. To alleviate the HOL blocking effect, a window policy has been proposed in that each input queue can scan up to a fixed number of packets (called the window size) to select for transmission on the outputs. However, the performance of the window policy has never been precisely characterized. In this paper, we use a closed queueing network model to characterize the performance of the packet switch with window policy. We obtain explicit closed-form formulae for the maximum throughput of the packet switch as a function of the window size. Both balanced and imbalanced traffic patterns are discussed. The formulae can easily determine the effectiveness of the window policy.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - The Maximum Throughput of a Nonblocking Packet Switch with Window Policy
T2 - IEICE TRANSACTIONS on Communications
SP - 573
EP - 580
AU - Dye-Jyun MA
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E80-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 1997
AB - It is known that in a nonblocking packet switch with input queueing, head-of-line (HOL) blocking affects significantly the maximum throughput of the packet switch. To alleviate the HOL blocking effect, a window policy has been proposed in that each input queue can scan up to a fixed number of packets (called the window size) to select for transmission on the outputs. However, the performance of the window policy has never been precisely characterized. In this paper, we use a closed queueing network model to characterize the performance of the packet switch with window policy. We obtain explicit closed-form formulae for the maximum throughput of the packet switch as a function of the window size. Both balanced and imbalanced traffic patterns are discussed. The formulae can easily determine the effectiveness of the window policy.
ER -
English
