A Fast Computation Algorithm for Connection Admission Control of Delay Sensitive Traffic with Multiple Quality of Service Requirements

スポンサーリンク

概要

• 論文の詳細を見る

• This paper presents a fast computation algorithm for connection admission control for heterogeneous delay sensitive traffic in ATM networks. Cell loss probability is adopted as the measure of quality of service. In our study, cells of each connection are allowed to have two different loss priorities and the aggregate traffic can have more than two. To cope with multiple quality of service requirements, the link capacity is divided into several bands. For simplicity, each traffic source is assumed to alternate between active and idle periods. However, the results can be extended to traffic sources having more than two states. Upper bounds of actual cell loss probabilities are derived based on the bufferless fluid flow model. Numerical results show that the upper bounds are close to the actual cell loss probabilities.

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

著者

• Lee T‐h

  National Chiao Tung Univ. Hsinchu Twn

• Lee Tsern-huei

  The Faculty Of National Chiao Tung University

• Lai K‐c

  National Taipei Univ. Taipei Twn

• LAI Kuen-Chu

  the Institute of Electronics, National Chiao Tung University

関連論文

• Quality of Service Guarantee in a Combined Input Output Queued Switch (IEICE/IEEE Joint Special Issue on Recent Progress in ATM Technologies)
• A Fast Computation Algorithm for Connection Admission Control of Delay Sensitive Traffic with Multiple Quality of Service Requirements

スポンサーリンク