We study an M/G/1 queue with impatience and an adaptive arrival process. The rate of the arrival process changes according to whether an incoming customer is accepted or rejected. We analyse two different models for impatience : (i) based on workload, and (ii) based on queue length. For the workload-based model, we obtain the Laplace-Stieltjes Transform of the joint stationary workload and arrival rate process, and that of the waiting time. For the queue-length based model we obtain the analogous z-transform. These queueing models also capture the interaction between congestion control algorithms and queue management schemes in the Internet
We consider anM/G/1 queue in which an arriving customer doesn’t enter the system when-ever its virtu...
Queueing systems with processor sharing represent the adequate models for sharing the resources, e.g...
This paper presents an adaptive queue management scheme to maintain queuing delay in a router at a r...
We study an M/G/1 queue with impatience and an adaptive arrival process. The rate of the arrival pro...
We study an M/G/1 queue with impatience and an adaptive arrival process. The rate of the arrival pro...
We consider an M/G/1 queue with the following form of customer impatience: an arriving customer balk...
This paper considers a batch arrival M x/ G / 1 queue with impatient customers. We consider two diff...
A semi-open queueing network having a finite number of nodes is considered. The nodes are modeled by...
We consider a queuing network with single-server nodes and heterogeneous customers. The number of cu...
AbstractThis paper presents an adaptive queue management scheme to maintain queuing delay in a route...
We consider an M/G/1 queue in which an arriving customer doesn’t enter the system whenever its virtu...
We consider anM/G/1 queue in which an arriving customer doesn’t enter the system when-ever its virtu...
Queueing systems with processor sharing represent the adequate models for sharing the resources, e.g...
This paper presents an adaptive queue management scheme to maintain queuing delay in a router at a r...
We study an M/G/1 queue with impatience and an adaptive arrival process. The rate of the arrival pro...
We study an M/G/1 queue with impatience and an adaptive arrival process. The rate of the arrival pro...
We consider an M/G/1 queue with the following form of customer impatience: an arriving customer balk...
This paper considers a batch arrival M x/ G / 1 queue with impatient customers. We consider two diff...
A semi-open queueing network having a finite number of nodes is considered. The nodes are modeled by...
We consider a queuing network with single-server nodes and heterogeneous customers. The number of cu...
AbstractThis paper presents an adaptive queue management scheme to maintain queuing delay in a route...
We consider an M/G/1 queue in which an arriving customer doesn’t enter the system whenever its virtu...
We consider anM/G/1 queue in which an arriving customer doesn’t enter the system when-ever its virtu...
Queueing systems with processor sharing represent the adequate models for sharing the resources, e.g...
This paper presents an adaptive queue management scheme to maintain queuing delay in a router at a r...