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...

random early detection (red) is one of the most commonly used active queue management (aqm) algorithms that is recommended by ietf for deployment in the network. although red provides low average queuing delay and high throughput at the same time, but effectiveness of red is highly sensitive to the red parameters setting. as network condition varies largely, setting red's parameters with fixed ...

A single server queueing system 'With constant Poisson input is considered and the partiel elimination of the station's idle fraction is envisaged by intermittent close-do'Wn and setup. The rule pertaining to the dismantling and re-establishing of the service staticn-the management doctrine-is based on the instantaneous size of the queue, but these processes are assumed to consume time. Operati...

We consider a finite buffer queue with one deterministic server fed by packets arriving in batches. We assume that we are not able to fully describe the batch distribution: only the maximal size and the average number of packets are supposed known. Indeed, these two quantities are simple to measure in a real system. We additionally allow the batch distribution to be state dependent. We analyze ...

In this paper, an M/G/1 queue model with the multiple adaptive vacations and pure decrementing service policy is studied based on the classical M/G/1 queueing model. The PGF of stationary queue length is derived by using an embedded Markov chain method. The LST of stationary waiting time is also given according to the independence between waiting time and arrival process. The average probabilit...

In this paper we study a two-queue polling model with zero switch-over times and k-limited service (serve at most ki customers during one visit period to queue i , i = 1, 2) in each queue. The arrival processes at the two queues are Poisson, and the service times are exponentially distributed. By increasing the arrival intensities until one of the queues becomes critically loaded, we derive exa...

In this paper, a hybrid overlay/underlay cognitive radio system is modeled as an M/M/1 queue where the rate of arrival and the service capacity are subject to Poisson alternations. Each packet as a customer arriving at the queue makes a decision to join the queue or not. Upon arrival, the individual decision of each packet is optimized based on his observation about the queue length and the sta...

We propose a ow-control scheme that combines the merits of creditand rate-based ow-control schemes by applying direct control over both bandwidth and bu er resources. The goal of the proposed scheme is to design an optimal ratecontrol policy for a given nite bu er capacity that maximizes average throughput and bounds end-to-end delay. By applying higher-order rate control, the proposed scheme n...

Although concepts of the XDL intersection or CFI (Continuous Flow Intersection) have been around for approximately four decades, users do not yet have a simplified procedure to evaluate its traffic performance and compare it with a conventional intersection. Several studies have shown qualitative and quantitative benefits of the XDL intersection without providing accessible tools for traffic en...

Offset optimization is of critical importance to the traffic control system, especially when spillovers appear. In order to avoid vehicle queue spillovers, an arterial offset optimization model was presented in saturated arterial intersections based on minimizing the queue length over the whole duration of the saturated traffic environment. The paper uses the shockwave theory to analyze the que...