A general-arrival, bulk service time queueing model is formulated for studying the distribution of random queues in signalized networks. The model is predicated on the occurrence of three traffic stream transformations: merging, splitting, and filtering. The model is applied to steady-state conditions (traffic intensity < 1.0) but can be eventually converted to a time-dependent form to account ...

Efficient and scalable concurrent priority queues are crucial for the performance of many multicore applications, e.g. for task scheduling and the parallelization of various algorithms. Linearizable concurrent priority queues with traditional semantics suffer from an inherent sequential bottleneck in the head of the queue. This bottleneck is the motivation for some recently proposed priority qu...

This paper presents results for the queue-read, queue-write asynchronous parallel random access machine (qrqw asynchronous pram) model, which is the asynchronous variant of the qrqw pram model. The qrqw pram family of models, which was introduced earlier by the authors, permit concurrent reading and writing to shared memory locations, but each memory location is viewed as having a queue which c...

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 ...

Existence of capacity drop phenomenon, as the difference between pre-queue and queue discharge flow rates, has been one of the controversial concepts of traffic engineering. Several researches have focused on capacity drop existence and also its estimation issues. This paper aims to estimate capacity drop based not only on a comparison between breakdown and queue discharge flow rates, but also ...

The study of unreliable server retrial bulk queue with multiphase optional service is analyzed by incorporating the features balking, Bernoulli vacation and feedback. On occasion when occupied customers, an arriving customer finding long queue, can join orbit receives its later on making re-attempt. system reinforced multi phase along essential joining opt any one services after getting service...

In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...

Drivers in urban neighborhoods who patrol streets, seeking inexpensive on-street parking create a significant fraction of measured traffic congestion. The pool of drivers patrolling at any time can be modeled as a queue, where ‘queue service’ is the act of parking in a recently vacated parking space and queue discipline is SIRO – Service In Random Order. We develop a queueing model of such driv...

Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...