scholarly journals Efficient analysis of the queue length moments of the MMAP/MAP/1 preemptive priority queue

2012 ◽  
Vol 69 (12) ◽  
pp. 684-700 ◽  
Author(s):  
Gábor Horváth
2015 ◽  
Vol 32 (06) ◽  
pp. 1550042 ◽  
Author(s):  
Ning Zhao ◽  
Zhaotong Lian ◽  
Kan Wu

In this paper, we study a MAP/PH/1 queue with two classes of customers and discretionary priority. There are two stages of service for the low-priority customer. The server adopts the preemptive priority discipline at the first stage and adopts the nonpreemptive priority discipline at the second stage. Such a queuing system can be modeled into a quasi-birth-and-death (QBD) process. But there is no general solution for this QBD process since the generator matrix has a block structure with an infinite number of blocks and each block has infinite dimensions. We present an approach to derive the bound for the high-priority queue length. It guarantees that the probabilities of ignored states are within a given error bound, so that the system can be modeled into a QBD process where the block elements of the generator matrix have finite dimensions. The sojourn time distributions of both high and low priority customers are obtained. Some managerial insights are given after comparing the discretionary priority rule with the preemptive and nonpreemptive disciplines numerically.


1984 ◽  
Vol 11 (3) ◽  
pp. 337-343 ◽  
Author(s):  
Asha Seth Kapadia ◽  
Mohammad Fasihullah Kazmi ◽  
A.Cameron Mitchell

2002 ◽  
Vol 55 (1) ◽  
pp. 107-120 ◽  
Author(s):  
Robin Groenevelt ◽  
Ger Koole ◽  
Philippe Nain

1992 ◽  
Vol 18 (3) ◽  
pp. 327-333 ◽  
Author(s):  
D. Audsin Mohana Dhas ◽  
R. Nadarajan ◽  
Ho Woo Lee

2021 ◽  
Vol 21 (03) ◽  
Author(s):  
Soamdeep Singha ◽  
Biswapati Jana ◽  
Niranjan Kumar Mandal

The basic philosophy behind RED is to prevent congestion. When the average queue length exceeds the minimum threshold, packets are randomly dropped, or the explicit congestion notification bit is marked. Since network requirements differ significantly, it is not an optimal approach to establish RED parameters with constant value. There is a new algorithm we are proposing called Critical Point on Target Queue (AQM-RED-CPTQ), provide greater congestion management over the network while also preserving the value of RED. To overcome the problem in RED without changing queue weight parameter, we have proposed few models to control the congestion by introducing range parameter with probability and control mechanism which will belong between minimum and maximum threshold. The current queue size is controlled together with average queue size. A new range variable has been introduced to improve the performance of priority queue of existing RED based algorithm which improves the overall performance of networks. For each packet, minimum and maximum threshold has been updated and dropped with probability (Pa) for a special condition. Instead of multiplicative increase and decrease the maximum probability, the scheme uses additive-increase and multiplicative-decrease. Once the AVG queue length is close to the minimum threshold value, our approach automatically sets queue parameter according to queue conditions and handles queuing delay and improve throughput. The simulated results proof that our approaches are better than RED in terms of throughput, end to end delay, packet delivery ratio and goodput.


Sign in / Sign up

Export Citation Format

Share Document