Tandem Queue Approximation of Non-preemptive Priority Queues for Capacity Dimensioning and Call Admission Control in an ATM Switch

Hiroyuki YOKOYAMA; Hajime NAKAMURA

Tandem Queue Approximation of Non-preemptive Priority Queues for Capacity Dimensioning and Call Admission Control in an ATM Switch

Hiroyuki YOKOYAMA, Hajime NAKAMURA

Full Text Views

0

Share
Cite this

Summary :

Priority control and call admission control are indispensable traffic management methods to guarantee each QoS requirement of connections in ATM networks. The key technique of call admission control under priority control is to estimate required bandwidth of each connection to satisfy all QoSs of calls in progress. In this paper, we propose a novel approximation method to calculate the required bandwidth of ATM connections through priority queues and show a practical call admission control scheme using the proposed method. The essence of the approximation method is to model prioritized parallel queues as a series of queues in tandem with no priority control by focusing on the number of cells in queues. The tandem queue approximation method enables us to model each queue under priority control as a single non-priority FIFO queue in terms of its queue length. This results in that effective bandwidth techniques are applicable to priority queues. The effectiveness of the proposed scheme is evaluated by some numerical examples.

Publication: IEICE TRANSACTIONS on Communications Vol.E81-B No.11 pp.2072-2080

Publication Date: 1998/11/25

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on Performance and Quality of Service (QoS) of Multimedia Networks)

Category: ATM Networks

Cite this

Copy

Hiroyuki YOKOYAMA, Hajime NAKAMURA, "Tandem Queue Approximation of Non-preemptive Priority Queues for Capacity Dimensioning and Call Admission Control in an ATM Switch" in IEICE TRANSACTIONS on Communications, vol. E81-B, no. 11, pp. 2072-2080, November 1998, doi: .
Abstract: Priority control and call admission control are indispensable traffic management methods to guarantee each QoS requirement of connections in ATM networks. The key technique of call admission control under priority control is to estimate required bandwidth of each connection to satisfy all QoSs of calls in progress. In this paper, we propose a novel approximation method to calculate the required bandwidth of ATM connections through priority queues and show a practical call admission control scheme using the proposed method. The essence of the approximation method is to model prioritized parallel queues as a series of queues in tandem with no priority control by focusing on the number of cells in queues. The tandem queue approximation method enables us to model each queue under priority control as a single non-priority FIFO queue in terms of its queue length. This results in that effective bandwidth techniques are applicable to priority queues. The effectiveness of the proposed scheme is evaluated by some numerical examples.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/e81-b_11_2072/_p

Copy

@ARTICLE{e81-b_11_2072,
author={Hiroyuki YOKOYAMA, Hajime NAKAMURA, },
journal={IEICE TRANSACTIONS on Communications},
title={Tandem Queue Approximation of Non-preemptive Priority Queues for Capacity Dimensioning and Call Admission Control in an ATM Switch},
year={1998},
volume={E81-B},
number={11},
pages={2072-2080},
abstract={Priority control and call admission control are indispensable traffic management methods to guarantee each QoS requirement of connections in ATM networks. The key technique of call admission control under priority control is to estimate required bandwidth of each connection to satisfy all QoSs of calls in progress. In this paper, we propose a novel approximation method to calculate the required bandwidth of ATM connections through priority queues and show a practical call admission control scheme using the proposed method. The essence of the approximation method is to model prioritized parallel queues as a series of queues in tandem with no priority control by focusing on the number of cells in queues. The tandem queue approximation method enables us to model each queue under priority control as a single non-priority FIFO queue in terms of its queue length. This results in that effective bandwidth techniques are applicable to priority queues. The effectiveness of the proposed scheme is evaluated by some numerical examples.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - Tandem Queue Approximation of Non-preemptive Priority Queues for Capacity Dimensioning and Call Admission Control in an ATM Switch
T2 - IEICE TRANSACTIONS on Communications
SP - 2072
EP - 2080
AU - Hiroyuki YOKOYAMA
AU - Hajime NAKAMURA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E81-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 1998
AB - Priority control and call admission control are indispensable traffic management methods to guarantee each QoS requirement of connections in ATM networks. The key technique of call admission control under priority control is to estimate required bandwidth of each connection to satisfy all QoSs of calls in progress. In this paper, we propose a novel approximation method to calculate the required bandwidth of ATM connections through priority queues and show a practical call admission control scheme using the proposed method. The essence of the approximation method is to model prioritized parallel queues as a series of queues in tandem with no priority control by focusing on the number of cells in queues. The tandem queue approximation method enables us to model each queue under priority control as a single non-priority FIFO queue in terms of its queue length. This results in that effective bandwidth techniques are applicable to priority queues. The effectiveness of the proposed scheme is evaluated by some numerical examples.
ER -