For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Call Admission and Efficient Allocation for Delay Guarantees
Yen-Ping CHU Chin-Hsing CHEN Kuan-Cheng LIN
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2001/08/01
Print ISSN: 0916-8532
Type of Manuscript: PAPER
guaranteed service, scheduling, local QoS allocation, traffic shaper,
Full Text: PDF(527.2KB)>>
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 efficiently. 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.