Call Admission and Efficient Allocation for Delay Guarantees

スポンサーリンク

概要

• 論文の詳細を見る

• ATM networks are connection-oriented. Making a call requires first sending a message to do an admission control to guarantee the connections' QoS (quality of service) in the network. In this paper, we focus on the problem of translating a global QoS requirement into a set of local QoS requirements in ATM networks. Usually, an end-user is only concerned with the QoS requirements on end-to-end basis and does not care about the local switching node QoS. Most of recent research efforts only focus on worst-case end-to-end delay bound but pay no attention to the problem of distributing the end-to-end delay bound to local switching node. After admission control, when the new connection is admitted to enter the network, they equally allocate the excess delay and reserve the same bandwidth at each switch along the path. But, this can not improve network utilization effciently. It motivates us to design a novel local QoS requirement allocation scheme to get better performance. Using the number of maximum supportable connections as the performance index, we derive an optimal delay allocation (OPT) policy. In addition, we also proposed an analysis model to evaluate the proposed allocation scheme and equal allocation (EQ) scheme in a series of switching nodes with the Rate-controlled scheduling architecture, including a traffic shaper and a non-preemptive earliest-deadline-first scheduler. From the numerical results, we have shown the importance of allocation policy and explored the factors that affect the performance index.

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

著者

• Lin K‐c

  Department Of Management Information Systems National Chung Hsing University

• Lin Kuan-cheng

  Department Of Management Information Systems National Chung Hsing University

• Lin Kuan-cheng

  Department Of Applied Mathematics National Chung-hsing University

• Chen C‐h

  Department Of Management Information Systems Central Taiwan University Of Sciences And Technology

• CHEN Chin-Hsing

  Department of Management Information Systems, Central Taiwan University of Sciences and Technology

• CHU Yen-Ping

  Department of Computer Science and Information Engineer, Tunghai University

• Chu Y‐p

  Department Of Computer Science And Information Engineer Tunghai University

• Chu Yen-ping

  Department Of Applied Mathematics National Chung-hsing University

• Chen Chin-hsing

  Department Of Electrical Engineering National Cheng Kung University

• CHU Yen-Ping

  Department of Applied Mathematics, National Chung-Hsing University

• CHEN Chin-Hsing

  Department of Management Information Systems, Chung-Tai Institute of Health Sciences and Technology

• LIN Kuan-Cheng

  Department of information Management at Kuang Wu Institute of Technology

関連論文

• Improving Fairness in DiffServ Networks Using Adaptive Aggregate Markers(Networks)
• Call Admission and Efficient Allocation for Delay Guarantees
• Local Allocation of End-to-End Delay Requirement
• Optimal Admission Control Based on Per-Switch Delay Allocation for Networks with a Bounded Delay Service
• Multiscale Object Recognition under Affine Transformation
• Prospective assessment of overactive bladder symptoms in women who have undergone transvaginal surgery for advanced vaginal wall prolapse : A preliminary report
• Classified Vector Quantization for Image Compression Using Direction Classification
• A Genetic Grey-Based Neural Networks with Wavelet Transform for Search of Optimal Codebook
• An Edge-Preserving Image Coding System with Vector Quantization
• Improvement of Authenticated Encryption Schemes with Message Linkages for Message Flows(Application Information Security)
• A New Operational Approach for Solving Fractional Calculus and Fractional Differential Equations Numerically(Discrete Mathematics and Its Applications)
• A New Packet Scheduling Algorithm : Minimum Starting-Tag Fair Queuing

もっと見る 閉じる

スポンサーリンク