$MAP₁, MAP₂/G/1 FINITE QUEUES WITH SERVICE SCHEDULING FUNCTION DEPENDENT UPON QUEUE LENGTHS

$MAP₁, MAP₂/G/1 FINITE QUEUES WITH SERVICE SCHEDULING FUNCTION DEPENDENT UPON QUEUE LENGTHS

We analyze $MAP_1,\;MAP_2$/G/1 finite queues with service scheduling function dependent upon queue lengths. The customers are classified into two types. The arrivals of customers are assumed to be the Markovian Arrival Processes (MAPs). The service order of customers in each buffer is determined by a service scheduling function dependent upon queue lengths. Methods of embedded Markov chain and supplementary variable give us information for queue length of two buffers. Finally, the performance measures such as loss probability and mean waiting time are derived. Some numerical examples also are given with applications in telecommunication networks.