We consider discrete time versions of two classical problems in the optimal control of admission to a queueing system: (i) optimal routing of arrivals t o two parallel queues and (ii) optimal acceptancefrejection of arrivals to a single queue. We extend the formulation of these problems to permit a k step delay in the observation of the queue lengths by the controller. For geometric inter-arriv...

Consider a single server queue with i.i.d. arrival and service processes, {A, An,n > 0} and {C, Cn,n > 0}, respectively, and a finite buffer B. The queue content process {Qn , n > 0} is recursively defined as Qn+1 = min((Qn + An+1 − Cn+1),B), q = max(0, q). When E(A−C) < 0, and A has a subexponential distribution, we show that the stationary expected loss rate for this queue E(Qn +An+1−Cn+1−B) ...

We consider admission policies to two multiserver loss queues in series with two types of traffic. Both are generated according to independent Poisson processes with constant arrival rates. The first type requires service at the first queue and with a positive probability enters the second queue; the second type requires service at only the second queue. The service time distribution is exponen...

Active queue management policies and in particular Random Early Drop (RED) are being pushed as additional mechanisms in Internet routers to control congestion and keep network utilization high. RED’s performance is highly dependent on the settings of its control parameters. However, no firm guidelines exist on configuring RED parameters and the current suggestions fail to provide the desired pe...

Active queue management policies and in particular Random Early Detection (RED) are being advocated by the Internet Engineering Task Force (IETF) as additional mechanisms in Internet routers to control congestion and keep network utilization high. RED's performance is highly dependent on the settings of its ve control parameters. However, no rm guidelines exist on connguring RED parameters and ...

A priority queue plays an important role in stochastic discrete event simulations for as much as 40% of a simulation execution time is consumed by the pending event set management. This article describes a new form of tree-based priority queues which employs the demarcation procedure to systematically split a single tree-based priority queue into many smaller trees, each divided by a logical ti...

In this paper, a state feedback H¥ controller is proposed in order to design an active queue management (AQM) system based on congestion control algorithm for networks supporting TCP protocols. In this approach, the available link bandwidth is modeled as a time-variant disturbance. The purpose of this paper is to design a controller which is capable of achieving the queue size and can guarantee...

We study a simple network with two parallel batch service queues, where service at a queue commences when the batch is full and each queue is served by infinitely many servers. A stream of general arrivals observe the current state of the system on arrival and choose which queue to join to minimize their own expected transit time. We show that for each set of parameter values there exists a uni...

How to effectively allocate system resource to process the Client request by Gateway servers is a challenging problem. In this paper, we propose an improved scheme for autonomous performance of Gateway servers under highly dynamic traffic loads. We devise a methodology to calculate Queue Length and Waiting Time utilizing Gateway Server information to reduce response time variance in presence of...

We consider a variant of the multiarmed bandit problem where jobs queue for service, and service rates of different servers may be unknown. We study algorithms that minimize queue-regret: the (expected) difference between the queue-lengths obtained by the algorithm, and those obtained by a “genie”-aided matching algorithm that knows exact service rates. A naive view of this problem would sugges...