the probability of losing a customer in m/g/n/0 and gi/m/n/0 loss queuing systems withheterogeneous servers is minimized. the first system uses a queue discipline in which a customer who arriveswhen there are free servers chooses any one of them with equal probability, but is lost otherwise. providedthat the sum of the servers rates are fixed, loss probability in this system attains minimum val...

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 describe a scalable priority queue manager that implements deadline-ordered service disciplines in an output-buffered ATM switch, which can be used as a switching node in high-speed packet switched networks to provide quality of service (QoS) guarantees. The priority queue manager can handle a range of priority levels from to , a buffer size of 64K ATM cells, and 16 input links at 2.5 Gb/s. ...

We develop approximate solutions for the equilibrium queue length probability distribution of queues in open Markovian networks by considering each queue independently, constructing its arrival process as the join of each contributing queue's departing traffic. Without modulation and non-unit batches, we would only need to consider mean internal traffic rates, modelling each queue as M/M/1 to g...

This paper presents an analysis of a cyclic-service tandem queue (M/C/l type queue) with exhaustive services and multiple server vacations, in which a single server takes repeated vacations until it finds at least one message in the first queue after emptying the queueing system. It is assumed that the vacation time is generally distributed, and switch-over times are zero. This paper analyzes q...

The use of multicast transmissions, in which users broadcast their data (typically video or audio) to a subset of other users, is growing on the Internet. For example, in input-queued ATM (asynchronous transfer mode) multicast switches, a cell in an input queue may be broadcast to several outputs, and only the cell at the head of each input queue (the HOL, or head-of-line,, cell) is observed an...

Resequencing issue is a crucial issue in simultaneous processing systems where the order of customers (jobs, units) upon arrival has to be preserved upon departure. In this paper stationary characteristics of M/M/3/∞ queueing system with reordering buffer of infinite capacity are being analyzed. Noticing that customer in reordering buffer may form two separate queues, focus is given to the stud...

We derive the waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic (or constant) service times. We show that the procedure for obtaining the waiting-time distribution of a multiserver queue is reduced to that of a single server queue. We present a complete solution to the waiting-time distribution of D-MAP/D/k queue together with some computa...

In this paper, we discuss a fluid queue driven by an M/M/1 queue with catastrophe and restoration. Using the continued fraction technique, we derive the Laplace transform of the transient state probability distribution of the buffer content, transient solution for this fluid queue and the corresponding steady state results explicitly. Also we analyze the queue when there are no catastrophes and...

Information about queue length is an important parameter for customers who face the decision whether to join a queue or not. In this paper, we study how optimal information disclosure policies can be used by a service provider of an M/M/1 queue to increase its revenue. Our main contribution is showing that the intuitive policy of informing customers about the current queue length when it is sho...