Results 1  10
of
150
A measurementbased admission control algorithm for integrated services packet networks
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1997
"... Many designs for integrated service networks offer a bounded delay packet delivery service to support realtime applications. To provide bounded delay service, networks must use admission control to regulate their load. Previous work on admission control mainly focused on algorithms that compute the ..."
Abstract

Cited by 299 (10 self)
 Add to MetaCart
Many designs for integrated service networks offer a bounded delay packet delivery service to support realtime applications. To provide bounded delay service, networks must use admission control to regulate their load. Previous work on admission control mainly focused on algorithms that compute the worst case theoretical queueing delay to guarantee an absolute delay bound for all packets. In this paper we describe a measurementbased admission control algorithm for predictive service, which allows occasional delay violations. We have tested our algorithm through simulations on a wide variety of network topologies and driven with various source models, including some that exhibit longrange dependence, both in themselves and in their aggregation. Our simulation results suggest that, at least for the scenarios studied here, the measurementbased approach combined with the relaxed service commitment of predictive service enables us to achieve a high
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 187 (14 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.
Stability, queue length and delay of deterministic and stochastic queueing networks
 IEEE Transactions on Automatic Control
, 1994
"... Motivated by recent development in high speed networks, in this paper we study two types of stability problems: (i) conditions for queueing networks that render bounded queue lengths and bounded delay for customers, and (ii) conditions for queueing networks in which the queue length distribution of ..."
Abstract

Cited by 171 (20 self)
 Add to MetaCart
Motivated by recent development in high speed networks, in this paper we study two types of stability problems: (i) conditions for queueing networks that render bounded queue lengths and bounded delay for customers, and (ii) conditions for queueing networks in which the queue length distribution of a queue has an exponential tail with rate `. To answer these two types of stability problems, we introduce two new notions of traffic characterization: minimum envelope rate (MER) and minimum envelope rate with respect to `. Based on these two new notions of traffic characterization, we develop a set of rules for network operations such as superposition, inputoutput relation of a single queue, and routing. Specifically, we show that (i) the MER of a superposition process is less than or equal to the sum of the MER of each process, (ii) a queue is stable in the sense of bounded queue length if the MER of the input traffic is smaller than the capacity, (iii) the MER of a departure process from a stable queue is less than or equal to that of the input process (iv) the MER of a routed process from a departure process is less than or equal to the MER of the departure process multiplied by the MER of the routing process. Similar results hold for MER with respect to ` under a further assumption of independence. These rules provide a natural way to analyze feedforward networks with multiple classes of customers. For single class networks with nonfeedforward routing, we provide a new method to show that similar stability results hold for such networks under the FCFS policy. Moreover, when restricting to the family of twostate Markov modulated arrival processes, the notion of MER with respect to ` is shown to be
Logarithmic Asymptotics For SteadyState Tail Probabilities In A SingleServer Queue
, 1993
"... We consider the standard singleserver queue with unlimited waiting space and the firstin firstout service discipline, but without any explicit independence conditions on the interarrival and service times. We find conditions for the steadystate waitingtime distribution to have smalltail asympt ..."
Abstract

Cited by 150 (14 self)
 Add to MetaCart
We consider the standard singleserver queue with unlimited waiting space and the firstin firstout service discipline, but without any explicit independence conditions on the interarrival and service times. We find conditions for the steadystate waitingtime distribution to have smalltail asymptotics of the form x  1 logP(W > x)  q * as x for q * > 0. We require only stationarity of the basic sequence of service times minus interarrival times and a Ga .. rtnerEllis condition for the cumulant generating function of the associated partial sums, i.e., n  1 log Ee qS n y(q) as n , plus regularity conditions on the decay rate function y. The asymptotic decay rate q * is the root of the equation y(q) = 0. This result in turn implies a corresponding asymptotic result for the steadystate workload in a queue with general nondecreasing input. This asymptotic result covers the case of multiple independent sources, so that it provides additional theoretical support for a concept of effective bandwidths for admission control in multiclass queues based on asymptotic decay rates.
Scheduling Algorithms for Inputqueued Cell Switches
, 1995
"... The algorithms described in this thesis are designed to schedule cells in a very highspeed, parallel, inputqueued crossbar switch. We present several novel scheduling algorithms that we have devised, each aims to match the set of inputs of an inputqueued switch to the set of outputs more effici ..."
Abstract

Cited by 137 (4 self)
 Add to MetaCart
The algorithms described in this thesis are designed to schedule cells in a very highspeed, parallel, inputqueued crossbar switch. We present several novel scheduling algorithms that we have devised, each aims to match the set of inputs of an inputqueued switch to the set of outputs more efficiently, fairly and quickly than existing techniques. In Chapter 2 we present the simplest and fastest of these algorithms: SLIP  a parallel algorithm that uses rotating priority ("roundrobin") arbitration. SLIP is simple: it is readily implemented in hardware and can operate at high speed. SLIP has high performance: for uniform i.i.d. Bernoulli arrivals, SLIP is stable for any admissible load, because the arbiters tend to desynchronize. We present analytical results to model this behavior. However, SLIP is not always stable and is not always monotonic: adding more traffic can actually make the algorithm operate more efficiently. We present an approximate analytical model of this behavior. SLIP prevents starvation: all contending inputs are eventually served. We present simulation results, indicating SLIP's performance. We argue that SLIP can be readily implemented for a 32x32 switch on a single chip. In Chapter 3 we present iSLIP, an iterative algorithm that improves upon SLIP by converging on a maximal size match. The performance of iSLIP improves with up to log 2 N iterations. We show that although it has a longer running time than SLIP, an iSLIP scheduler is little more complex to implement. In Chapter 4 we describe maximum or maximal weight matching algorithms based on the occupancy of queues, or waiting times of cells. These algorithms are stabl...
A New Approach to Service Provisioning in ATM Networks
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1993
"... We formulate and solve a problem of allocating resources among competing services differentiated by user traffic characteristics and maximum endtoend delay. The solution leads to an alternative approach to service provisioning in an ATM network, in which the network offers directly for rent its ba ..."
Abstract

Cited by 78 (8 self)
 Add to MetaCart
We formulate and solve a problem of allocating resources among competing services differentiated by user traffic characteristics and maximum endtoend delay. The solution leads to an alternative approach to service provisioning in an ATM network, in which the network offers directly for rent its bandwidth and buffers and users purchase freely resources to meet their desired quality. Users make their decisions based on their own traffic parameters and delay requirements and the network sets prices for those resources. The procedure is iterative in that the network periodically adjusts prices based on monitored user demand, and is decentralized in that only local information is needed for individual users to determine resource requests. We derive network's adjustment scheme and users' decision rule and establish their optimality. Since our approach does not require the network to know user traffic and delay parameters, it does not require traffic policing on the part of the network.
Squeezing The Most Out Of ATM
, 1996
"... Even though ATM seems to be clearly the wave of the future, one performance analysis indicates that the combination of stringent performance requirements (e.g., 10  9 cell blocking probabilities), moderatesize buffers and highly bursty traffic will require that the utilization of the network be ..."
Abstract

Cited by 72 (10 self)
 Add to MetaCart
Even though ATM seems to be clearly the wave of the future, one performance analysis indicates that the combination of stringent performance requirements (e.g., 10  9 cell blocking probabilities), moderatesize buffers and highly bursty traffic will require that the utilization of the network be quite low. That performance analysis is based on asymptotic decay rates of steadystate distributions used to develop a concept of effective bandwidths for connection admission control. However, we have developed an exact numerical algorithm that shows that the effectivebandwidth approximation can overestimate the target small blocking probabilities by several orders of magnitude when there are many sources that are more bursty than Poisson. The bad news is that the appealing simple connectionadmissioncontrol algorithm using effective bandwidths based solely on tailprobability asymptotic decay rates may actually not be as effective as many have hoped. The good news is that the statistical multiplexing gain on ATM networks may actually be higher than some have feared. For one example, thought to be realistic, our analysis indicates that the network actually can support twice as many sources as predicted by the effectivebandwidth approximation. That discrepancy occurs because for a large number of bursty sources the asymptotic constant in the tail probability exponential asymptote is extremely small. That in turn can be explained by the observation that the asymptotic constant decays exponentially in the number of sources when the sources are scaled to keep the total arrival rate fixed. We also show that the effectivebandwidth approximation is not always conservative. Specifically, for sources less bursty than Poisson, the asymptotic constant grows exponentially in the numbe...
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.
Call Admission Control Schemes: A Review
"... Over the last few years, a substantial number of call admission control (CAC) schemes have been proposed for ATM networks. In this article, we review the salient features of some of these algorithms. Also, we quantitatively compare the performance of three of these schemes. ..."
Abstract

Cited by 62 (1 self)
 Add to MetaCart
Over the last few years, a substantial number of call admission control (CAC) schemes have been proposed for ATM networks. In this article, we review the salient features of some of these algorithms. Also, we quantitatively compare the performance of three of these schemes.
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 ...