Paper Info
Title
Performance analysis of input queue with combination of push-out and state-dependent scheduling schemes for nonblocking ATM switches
Abstract
In this paper, assuming two classes of input traffic, we analyze a combination of push-out and general state-dependent scheduling schemes applied to input queues of nonblocking ATM switches with the speed-up factor ≥ 1. The analysis is done in two steps in the discrete-time domain, using an embedded semi-Markov process (SMP) concept (Takagi, 1993). In numerical examples for some specific scheduling schemes, we compare the performances and show that reasonable performance differences both in loss probabilities and in waiting times can be achieved between two classes over a wide range of the offered load. We also show that all the priority schemes considered in this paper allow higher utilization of the switch than the non priority one, and among them the queue length threshold (QLT) scheduling scheme gets the highest utilization. Lastly, we note that although the analysis assumes an infinitely large size switch, the result gives a quite accurate approximation for finite size switches with around one hundred input/output ports.
Year
DOI
Venue
1997
10.1016/S0166-5316(96)00050-8
Perform. Eval.
Keywords
Field
DocType
performance analysis,push-out scheme,state-dependent scheduling scheme,scheduling scheme,priority control,nonblocking atm,semi-markov process,atm switch,input queue,asynchronous transfer mode,discrete time,input output
State dependent,Scheduling (computing),Computer science,Queue,Offered load,Real-time computing,Asynchronous Transfer Mode,Earliest deadline first scheduling,Dynamic priority scheduling,Atmosphere (unit),Distributed computing
Journal
Volume
Issue
ISSN
30
3
Performance Evaluation
Citations 
PageRank 
References 
0
0.34
7
Authors
3
Name
Order
Citations
PageRank
Kye Sang Lee120.73
Chong Kwan Un224747.46
Jae Yong Lee39723.87