Tandem Queue Approximation of Non-preemptive Priority Queues for Capacity Dimensioning and Call Admission Control in an ATM Switch (Special Issue on Performance and Quality of Service (QoS) of Multimedia Networks)

スポンサーリンク

概要

• 論文の詳細を見る

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

• 社団法人電子情報通信学会の論文
• 1998-11-25

著者

• Nakamura Hajime

  Kdd R & D Laboratories

• Yokoyama Hiroyuki

  Kdd R & D Laboratories

関連論文

• Tandem Queue Approximation of Non-preemptive Priority Queues for Capacity Dimensioning and Call Admission Control in an ATM Switch (Special Issue on Performance and Quality of Service (QoS) of Multimedia Networks)

スポンサーリンク