1 Abstract We consider a single-server multi-queue system with unlimited-size batch service 1 where the next queue to be served is the one with the most senior customer (the so called 2 ‘Israeli Queue’). We study a Markovian system with state-dependent group-joining policy 3 and derive results for various performance measures, such as steady-state distribution of 4 the number of groups in the s...

We consider an MXI ell queueing system with N-policy and single vacation. As soon as the system becomes empty, the server leaves the system for a vacation of random length 11: When he returns from the vacation, if the system size is greater than or equal to a pretermined value N(threshold), he begins to serve the customers. If not, the server waits in the system until the system size reaches or...

A single server queue shared by N different classes of jobs is considered. Class i jobs arrive at the queue in a poisson fashion with a class dependent rate. The total number of class i jobs allowed to wait in the queue is wi, the window size of this class. A class i job that arrives to find wi class i jobs in the shared queue is forced to wait in an input queue. There is one input queue for ea...

A Call Admission Control (CAC) scheme for downlink multimedia service in WCDMA system is proposed in this paper. The admission control based on instantaneous measurements may cause capacity loss and degrade in Quality of Service (QoS) because of abrupt uctuation of the power level at Base Station (BS). Both the average power level of real-time circuit services and average queue size of non-real...

A novel logic-based switching control strategy for internet congestion is applied for asymptotically stabilizing a class of transmission control protocol (TCP) networks at a desired operating point. We consider the problem of output feedback control instead of state-feedback control. The uncertainties with respect to the number of the active TCP sessions are considered. A high gain observer for...

In this paper, a symbolic dynamical model of the average queue size of the random early detection (RED) algorithm is proposed. The conditions on both the system parameters and the initial conditions that the average queue size of the RED algorithm would converge to a fixed point are derived. These results are useful for network engineers to design both the system parameters and the initial cond...

We give new upper and lower bounds for oblivious permutation routing on d-dimensional meshes (d > 1) of side length n. We present O(nd=2 logn) algorithms for d 2 using queue-size 6. Further we present optimal O(nd=2) algorithms using unlimited queue-size. For odd d the presented algorithm is a d-bend algorithm. We further show that for odd d an algorithm which for every packet restrict the bend...

A GI/M/1-type queueing system with finite buffer capacity and AQM-type packet dropping is investigated. Even when the buffer is not saturated an incoming packet can be dropped (lost) with probability dependent on the instanteneous queue size. The system of integral equations for time-dependent queue-size distribution conditioned by the number of packets present in the system initially is built ...

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

Active Queue Management (AQM) plays an important role in the Internet congestion control. It tries to enhance congestion control, and to achieve tradeoff between bottleneck utilization and delay. Random Early Detection (RED) is the most popular active queue management algorithm that has been implemented in the in Internet routers and is trying to supply low delay and low packet loss. RED al...