Random Early Detection (RED) is one of the most commonly used Active Queue Management (AQM) algorithms that is recommended by IETF for deployment in the network. Although RED provides low average queuing delay and high throughput at the same time, but effectiveness of RED is highly sensitive to the RED parameters setting. As network condition varies largely, setting RED's parameters with fixed ...

In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...

The machine repair problem with spares and additional repairman is analyzed. The interfailure and repair times of the units are general identical and independently distributed. The failure and repair rates are assumed to be state dependent. Using diffusion approximation technique, we obtain the queue size distribution under steady state. The average number of failed units, average number of ope...

In discrete event simulation, very often the future event set is represented by a priority queue. The data structure used to implement the queue and the way operations are performed on it are often crucial to the execution time of a simulation. In this paper a new priority queue implementation strategy, the Lazy Queue, is presented. It is tailored to handle operations on the pending event set e...

In this paper, we study the performance of service systems with priority upgrades. We model the service system as a single-server two-class priority queue, with queue 1 as the normal queue and queue 2 as the priority queue. The queueing model of interest has various applications in healthcare services, perishable inventory and project management. We comprehensively examine the system’s stationa...

Geostandards and Geoanalytical ResearchVolume 45, Issue 4 p. 771-771 IAG Membership InformationFree Access Information First published: 24 November 2021 https://doi.org/10.1111/ggr.12339AboutPDF ToolsRequest permissionExport citationAdd to favoritesTrack citation ShareShare Give accessShare full text full-text accessPlease review our Terms Conditions of Use check box below share version article...

Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary queue is served exhaustively, after which the server switches over to queue 0. The duration of time the server resides in the secondary queue is determined by the dynamic evolution in queue 1. If there is an arrival t...