Search

In [13], real-time measurements from LANs, variable-bit-rate video sources, ISDN control-channels, the World Wide Web and other communication systems have shown that traffic exhibits a behaviour of self-similar nature. In this paper, we give new lower bounds to buffer-overflow and cell-loss probabilities for an ATM queue system with a self-similar cell input traffic and finite buffer. The bounds are better than those obtained in [20], in an important region of parameters. As in [20], they decay hyperbolically with buffer size, when the latter goes to infinity. However, in some region, a factor which accompanies the decay is higher in this paper than in [20]. [ABSTRACT FROM AUTHOR]

A discrete-time, two-server queueing system is studied in this paper. The service time of a customer (cell) is fixed and equal to one time unit. Server 1 provides for periodic service of the queue (period T). Server 2 provides for service only when server 1 is unavailable and provided that the associated service credit is nonzero. The resulting system is shown to model the queueing behavior of a network user which is subject to traffic regulation for congestion avoidance in high speed ATM networks. A general methodology is developed for the study of this queueing system, based on renewal theory. The dimensionality of the developed model is independent of T; T increases with the network speed. The cell loss probabilities are computed in the case of finite capacity queue. [ABSTRACT FROM AUTHOR]

Consider an ATM multiplexer where M input links contend for time slots on an output link which transmits C cells per second. Each input link has its own queue of size B cells. The traffic is delay sensitive so B is small (e.g., B=20). We assume that each of the M input links carries Constant Bit Rate (CBR) traffic from a large number of independent Virtual Connections (VCs) which are subject to jitter. The fluctuations of the aggregate traffic arriving at queue i, i=1,..., M, is modeled by a Poisson process with rate λi. The Quality of Service (QoS) of one connection is determined in part by the queueing delay across the multiplexer and the Cell Loss Ratio (CLR) or proportion of cells from this connection lost because the buffer is full. The Oldest Customer(Cell) First (OCF) discipline is a good compromise between competing protocols like round robin queueing or serving the longest queue. The OCF discipline minimizes the total cell delay among all cells arriving at the contending queues. Moreover, the CLR is similar to that obtained by serving the longest queue. We develop QoS formulae for this protocol that can be calculated on line for Connection Admission Control (CAC). These formulae follow from a simple new expression for the exact asymptotics of a M/ D/1 queue. [ABSTRACT FROM AUTHOR]