We consider a discrete-time single-server queue with arrivals governed by a stationary Markov chain, where no arrivals are assumed to occur only when the Markov chain is in a particular state. This assumption implies that off-periods in the arrival process are i.i.d. and geometrically distributed. For this queue, we establish the exact relationship between queue length distributions in a finite...

In this paper, we consider a discrete-time finite-capacity queue with Bernoulli arrivals and batch services. In this queue, the single server has a variable service capacity and serves the customers only when the number of customers in system is at least a certain threshold value. For this queue, we first obtain the queue-length distribution just after a service completion, using the embedded M...

This paper analyzes renewal input state dependent queue with $N$- policy wherein the server takes exactly one vacation. Using the supplementary variable technique and recursive method, we derive the steady state system length distributions at various epochs. Various performance measures has been presented. Finally, some numerical  computations in the form of graphs are presented to show the par...

We consider a discrete-time single-server queue with arrivals governed by a stationary Markov chain, where no arrivals are assumed to occur only when the Markov chain is in a particular state. This assumption implies that o -periods in the arrival process are i.i.d. and geometrically distributed. For this queue, we establish the exact relationship between queue length distributions in a nite-bu...

The Routers in Internet face the problem of congestion due to the increased use of Internet. Active Queue Management has provided a solution to the problem of congestion control in the Internet routers. But as data traffic is bursty in routers, burstiness must be handled without comprising the high link utilization and low queuing delay. Congested link leads to many problems such as large delay...

How to estimate queue length in real-time at signalized intersection is a long-standing problem. The problem gets even more difficult when signal links are congested. The traditional input–output approach for queue length estimation can only handle queues that are shorter than the distance between vehicle detector and intersection stop line, because cumulative vehicle count for arrival traffic ...

In this paper, we analyze a scheduling algorithm which is suitable for the heterogeneous traffic network. In the large deviation setting, we are interested to see, how the asymptotic decay rate of maximum queue overflow probability achieved by this algorithm.We first derive an upper bound on the decay rate of the queue overflow probability as the queue overflow threshold approaches infinity. Th...

In active queue management (AQM), core routers signal transmission control protocol (TCP) sources with the objective of managing queue utilization and delay. It is essentially a feedback control problem. Based on a recently developed dynamic model of TCPs congestion-avoidance mode, this paper does three things. First, it relates key network parameters such as the number of TCP sessions, link ca...

Carrying IP tra c over connection-oriented networks requires the use of bandwidth on demand schemes at gateways or network interfaces. A new virtual queue occupancy, which is more accurate than the classical one, is being proposed for IP/SONET bandwidth on demand. Based on the virtual queue occupancy, two enhanced periodic approaches for lossless services, LAVQ and LAVQL, are simulated and eval...

Since random early detection (RED) was proposed in 1993, many active queue management (AQM) algorithms have been proposed to support better end-to-end Transmission Control Protocol (TCP) congestion control. In this article, the authors introduce and analyze a feedback control model of the TCP/AQM dynamics. Then they suggest the concept of an AQM algorithm that can detect and avoid congestion pr...