A congestion avoidance scheme allows a network to operate in the region of low delay and high throughput. Such scheme prevent a network from entering in to congested state. RED(Random Early Detection), is one such congestion avoidance mechanism used for effectively control of congestion. In RED, router uses only the average queue size, as a congestion indicator and the average queue length is i...

This paper treats a discrete-time single-server finite-buffer exhaustive (singleand multiple-) vacation queueing system with discrete-time Markovian arrival process (D-MAP). The service and vacation times are generally distributed random variables and their durations are integral multiples of a slot duration. We obtain the queue-length distributions at departure, service completion, vacation te...

One problem with a RED router with fixed parameter settings is that the buffer queue length varies markedly with the traffic level. In this paper, an algorithm is derived analytically for automatically tuning the key RED parameter maxp to keep the average queue length at the target value despite a varying traffic load. A control-theoretic stability analysis is performed to obtain guidelines for...

This paper considers the issue of optimal subcarrier allocation in OFDMA. We show, via a counter example, that water-filling based subcarrier allocation policies, contrary to conventional wisdom, fail to provide rate-stability for an otherwise stabilizable OFDMA system. Water-filling is too myopic when considering longtime average performance, e.g. delay, queue lengths, and even long-run throug...

A state-dependent 1-limited polling model with N queues is analyzed. The routing strategy generalizes the classical Markovian polling model, in the sense that two routing matrices are involved, the choice being made according to the state of the last visited queue. The stationary distribution of the position of the server is given. Ergodicity conditions are obtained by means of an associated dy...

Abstract: The purpose of this research is to develop algorithm calculating the traffic queue length which is main variable for effective operation at signalized intersection. For the methods to calculate the traffic queue length, there are queue theory and shock wave theory. And, the estimation of traffic queue length by existing point detection system utilizes traffic queue theory calculating ...

Many analytical tools have been devised to analyze CBR video coders, however only few have been applied to the VBR case. In this paper, we present a semi-Markov process model for approximating the stochastic equilibrium queue length distribution for VBR video sources multiplexed onto a constant capacity A TM channel. The sources are assumed to have two rates, and generate cells that pass throug...

Abstract. We consider a two-priority, preemptive, single-server queueing model. Each customer is classified into either a high priority class or a low priority class. The arrivals of the two priority classes follow independent Poisson processes and service time is assumed to be exponentially distributed. A queue-length-cutoff method is considered. Under this discipline the server responds only ...

In this paper we first show how the Extended Linear Complementarity Problem, which is a mathematical programming problem, can be used to design optimal switching schemes for a class of switched systems with linear dynamics subject to saturation. More specifically, we consider the determination of the optimal switching time instants (the switching sequences are acyclic, but the phase sequence is...