Results 1 
9 of
9
Effective Bandwidths for Multiclass Markov Fluids and Other ATM Sources
, 1993
"... We show the existence of effective bandwidths for multiclass Markov fluids and other types of sources that are used to model ATM traffic. More precisely,we show that when such sources share a buffer with deterministic service rate, a constraint on the tail of the buffer occupancy distribution is a l ..."
Abstract

Cited by 193 (15 self)
 Add to MetaCart
We show the existence of effective bandwidths for multiclass Markov fluids and other types of sources that are used to model ATM traffic. More precisely,we show that when such sources share a buffer with deterministic service rate, a constraint on the tail of the buffer occupancy distribution is a linear constraint on the number of sources. That is, for a small loss probability one can assume that each source transmits at a fixed rate called its effective bandwidth. When traffic parameters are known, effective bandwidths can be calculated and may be used to obtain a circuitswitched style call acceptance and routing algorithm for ATM networks. The important feature of the effective bandwidth of a source is that it is a characteristic of that source and the acceptable loss probability only.Thus, the effective bandwidth of a source does not depend on the number of sources sharing the buffer nor on the model parameters of other types of sources sharing the buffer.
Qualityofservice in packet networks: Basic mechanisms and directions
 COMPUTER NETWORKS
, 1999
"... In this paper, we review the basic mechanisms used in packet networks to support QualityofService QoS guarantees. We outline the various approaches that have been proposed, and discuss some of the tradeoffs they involve. Specifically, the paper starts by introducing the different scheduling and ..."
Abstract

Cited by 68 (4 self)
 Add to MetaCart
In this paper, we review the basic mechanisms used in packet networks to support QualityofService QoS guarantees. We outline the various approaches that have been proposed, and discuss some of the tradeoffs they involve. Specifically, the paper starts by introducing the different scheduling and buffer management mechanisms that can be used to provide service differentiation in packet networks. The aim is not to provide an exhaustive review of existing mechanisms, but instead to give the reader a perspective on the range of options available and the associated tradeoff between performance, functionality, and complexity. This is then followed by a discussion on the use of such mechanisms to provide specific endtoend performance guarantees. The emphasis of this second part is on the need for adapting mechanisms to the different environments where they are to be deployed. In particular, fine grain buffer management and scheduling mechanisms may be neither necessary nor cost effective in high speed backbones, where "aggregate" solutions are more appropriate. The paper discusses issues and possible approaches to allow coexistence of different mechanisms in delivering endtoend guarantees.
Effective bandwidths: call admission, traffic policing, and filtering for ATM networks
, 1994
"... In this paper we review and extend the effective bandwidth results of Kelly [28], and Kesidis, Walrand and Chang [29, 6]. These results provide a framework for call admission schemes which are sensitive to constraints on the mean delay or the tail distribution of the workload in buffered queues. We ..."
Abstract

Cited by 61 (9 self)
 Add to MetaCart
In this paper we review and extend the effective bandwidth results of Kelly [28], and Kesidis, Walrand and Chang [29, 6]. These results provide a framework for call admission schemes which are sensitive to constraints on the mean delay or the tail distribution of the workload in buffered queues. We present results which are valid for a wide variety of traffic streams and discuss their applicability for traffic management in ATM networks. We discuss the impact of traffic policing schemes, such as thresholding and ltering, on the effective bandwidth of sources. Finally we discuss effective bandwidth results for Brownian traffic models for which explicit results reveal the interaction arising in finite buffers.
Resource Management in WideArea ATM Networks using Effective Bandwidths
 IEEE J. SELECT. AREAS COMMUN
, 1995
"... This paper is principally concerned with resource allocation for connections tolerating statistical qualityof service (QoS) guarantees in a public widearea ATM network. Our aim is to sketch a framework, based on effective bandwidths, for call admission schemes that are sensitivetoindividual QoS r ..."
Abstract

Cited by 60 (3 self)
 Add to MetaCart
This paper is principally concerned with resource allocation for connections tolerating statistical qualityof service (QoS) guarantees in a public widearea ATM network. Our aim is to sketch a framework, based on effective bandwidths, for call admission schemes that are sensitivetoindividual QoS requirements and account for statistical multiplexing. We begin by describing recent results approximating the effective bandwidth required by heterogeneous streams sharing buffered links, including results for the packetized generalized processor sharing service discipline. Extensions to networks follow via the concept of decoupling bandwidths  motivated by a study of the inputoutput properties of queues. Based on these results we claim that networks with sufficient routing diversity will inherently satisfy nodal decoupling. We then discuss online methods for estimating the effective bandwidth of a connection. Using this type of traffic monitoring we propose an approach to usage parameter ...
Decoupling bandwidths for networks: A decomposition approach to resource management for networks
 In Proceedings of INFOCOM’94, IEEE
, 1994
"... We consider large buffer asymptotics for feedforward networks of discretetime queues with deterministic service rate shared by multiple classes of streams subject to work conserving service policies. First we review the concept of effective bandwidths for traffic streams sharing a common buffer su ..."
Abstract

Cited by 58 (3 self)
 Add to MetaCart
We consider large buffer asymptotics for feedforward networks of discretetime queues with deterministic service rate shared by multiple classes of streams subject to work conserving service policies. First we review the concept of effective bandwidths for traffic streams sharing a common buffer subject to subject to tail constraints on the workload distribution. Next, we obtain the effective bandwidth of the departure process from such a queue, proving that in fact the effective bandwidth of the output is at worst equal to that of the input, and depending on the service rate, strictly less than that of the input. We then define the notion of a decoupling bandwidth and the associated constraints, guaranteeing that asymptotics within the network are decoupled. These results provide a framework for call admission schemes which are sensitive to constraints on the tail distribution of the workload or approximate cell loss probabilities. Our results require relatively weak assumptions on both the traffic streams and service policies. We consider the problem of “optimal ” traffic shaping (via buffering) subject to a loss constraint. Finally, we discuss our results in the context of resource management for ATM networks. 1
Modelling communication networks, present and future
 THE CLIFFORD PATTERSON LECTURE
, 1995
"... Modern communication networks are able to respond to randomly uctuating demands and failures by allowing bu ers to ll, by rerouting tra c and by reallocating resources. They are able to do this so well that, in many respects, largescale networks appear as coherent, almost intelligent, organisms. The ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
Modern communication networks are able to respond to randomly uctuating demands and failures by allowing bu ers to ll, by rerouting tra c and by reallocating resources. They are able to do this so well that, in many respects, largescale networks appear as coherent, almost intelligent, organisms. The design and control of such networks present challenges of a mathematical, engineering and economic nature. In this lecture I describe some of the models that have proved useful in the analysis of stability, statistical sharing and pricing, in systems ranging from the telephone networks of today to the information superhighways of tomorrow.
Quick simulation of ATM buffers with onoff multiclass Markov fluid sources
 ACM Transactions on Modeling and Computer Simulations
, 1993
"... The problem we address is how to quickly estimate by simulation the loss in a buffer with multiclass onoff Markov fluid sources. We generate the Markov fluids with the altered rate matrices given in [11], instead of the originals, to speed up the simulation. Likelihood ratios are used to recover an ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
The problem we address is how to quickly estimate by simulation the loss in a buffer with multiclass onoff Markov fluid sources. We generate the Markov fluids with the altered rate matrices given in [11], instead of the originals, to speed up the simulation. Likelihood ratios are used to recover an estimate of the loss for the original traffic parameters.
Techniques for Adaptive Estimation of Effective Bandwidth in ATM Networks
 IN IEEE GLOBECOM
, 1997
"... This paper examines the effectiveness of adaptive algorithms for estimation of effective bandwidth in ATM networks. Large deviations results for constant capacity single server queues are used to derive a basic effective bandwidth result which is applied to a linear representation of the input proce ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This paper examines the effectiveness of adaptive algorithms for estimation of effective bandwidth in ATM networks. Large deviations results for constant capacity single server queues are used to derive a basic effective bandwidth result which is applied to a linear representation of the input process giving the effective bandwidth as a function of the cumulant generating function of the innovations, QoS, mean arrival rate and buffer size. The algorithm is tested by simulation using the least squares lattice algorithm for estimating the linear process coe#cients for a range of input processes. The effectiveness of blocking and truncation of the input process on the algorithm is investigated.