We present a new iterative mathematical model for calculating the average bandwidth assigned to traffic flows using a Weighted Round Robin with Priority queuing (WRRPQ) scheduler with both strict and rate controlled priority in IP based NGN networks. The bandwidth assignment estimation is based on the average packet length, link speed and the arrival rate. We prove the model outcome with exampl...

this paper presents a discrete-time single-server finite buffer n threshold policy queue with renewal input and discretemarkovian service process. the server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is n. we obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...

In this paper, we consider the steady-state queue length distribution of the GI/G/1/K queue. As a result, we obtain transform-free expressions for the steady-state queue length distributions at an arrival, at a departure and at an arbitrary time, all in product forms. The results are obtained by what we call the decomposed Little’s formula, which applies the Little’s formula W L λ = to the n wa...

The Active Queue Management algorithms stabilize the instantaneous queue length through mapping the congestion measurement into packet drop probability to achieve high throughput and low average delay. Random Early Detection [RED] is widely used AQM mechanism detecting and avoiding the incipient congestion. The detection of congestion is based on priori estimation of congestion and calculation ...

We consider a single-server queue with Poisson arrivals, where holding costs are continuously incurred as a non-decreasing function of the queue length. The queue length evolves as a birth-and-death process with constant arrival rate λ = 1 and with state-dependent service rates μn that can be chosen from a fixed subset A of [0,∞). Finally, there is a non-decreasing cost-of-effort function c(·) ...

Understanding how delayed information impacts queueing systems is an important area of research. However, much of the current literature neglects one important feature of many queueing systems, namely non-stationary arrivals. Non-stationary arrivals model the fact that customers tend to access services during certain times of the day and not at a constant rate. In this paper, we analyze two two...

We use a discrete-time dynamical feedback system model of TCP/RED to study the performance of Random Early Detection RED for different values of control parameters. Our analysis shows that the queue length is able to keep stable at a given target if the maximum probability pmax and exponential averaging weight w satisfy some conditions. From the mathematical analysis, a new self-tuning RED is p...

The main aim of this paper is to examine issues relating to the performance of various Telecommunication networks, and applied queuing theory for better design and improved efficiency. Firstly, giving an analytical study of queues deals with quantifying the phenomenon of waiting lines using representative measures of performances, such as average queue length (on average number of customers in ...

A standard method of solving queueing network control MDPs with uncontrolled arrivals is to truncate the state space by turning o¤ arrivals at some queue length. However, this method requires large queue lengths to be accurate. This paper formulates approximate linear programs (ALPs) that give lower bounds average cost. Any di¤erential cost is allowed below some queue length but it is approxima...

A method estimating the queue length in city street networks was proposed using the data of roll time occupancy. The key idea of this paper is that when the queue length in front of the queue detector becomes longer, the speeds of the following vehicles to pass through the detector will become smaller, resulting in higher occupancy with constant traffic intensity. Considering the relationship b...