We study N-queues single-server fluid polling systems, where a fluid is continuously flowing into the queues at queue-dependent rates. When visiting and serving a queue, the server reduces the amount of fluid in that queue at a queue-dependent rate. Switching from queue i to queue j requires two random-duration steps: (i) departing queue i, and (ii) reaching queue j. The length of time the serv...

Customers arrive to a single service queue according to a Poisson process with rate l, from which they are routed to two parallel heterogeneous and exponential servers whose ra.tes are 1'1 > #2· Customers are released from the system after service completion, according to their arrival order a requirement introducing additional resequencing delays. Customers which are delayed due to resequencin...

A multiple optional vacation policy for the unreliable server batch arrival queueing system with essential and multi optional services under N-policy is investigated. According to vacation policy, the server takes an essential phase of vacation after the completion of service of an individual customer when queue becomes empty. On returning from the vacation, if the server finds the queue empty,...

This paper investigates the steady state property of queue length for a batch arrival queue under N-policy with single vacation and setup times. When the system becomes empty, the server is turned off at once and takes a single vacation of random length V . When he returns, if the queue length reaches or exceeds threshold ( 1) N N  , the server is immediately turned on but is temporarily unava...

A queueing network that is served by a single server in a cyclic order is analyzed in this paper. Customers arrive at the queues from outside the network according to independent Poisson processes. Upon completion of his service, a customer may leave the network, be routed to another queue in the network or rejoin the same queue for another portion of service. The single server through the diff...

We study the average Age of Information (AoI) and peak AoI (PAoI) a dual-queue status update system that monitors common stochastic process through two independent channels. Although double queue parallel transmission is instrumental in reducing AoI, out order data arrivals also imposes significant challenge to performance analysis. consider settings: M-M where service time servers exponentiall...

This paper examines a discrete-time queuing system with applications to telecommunications traffic. The arrival process is a particular Markov modulated process which belongs to the class of discrete batched Markovian arrival processes. The server process is a single server deterministic queue. A closed form exact solution is given for the expected queue length and delay. A simple system of equ...

This paper considers a discrete-time queue with gated priority. Low priority customers arrive at the first queue at the gate in batches according to a batch Bernoulli process (BBP). When the gate opens, all low priority customers at the first queue move to the second queue at a single server. On the other hand, high priority customers directly join the second queue upon arrival. The arrival pro...

In this survey we provide an overview of recent advances on scalable load balancing schemes which favorable delay performance and yet require minimal implementation overhead. The basic scenario involves a single dispatcher where tasks arrive that must immediately be forwarded to one $N$ single-server queues. join-the-shortest-queue (JSQ) policy yields vanishing delays as grows large, in central...