Results 1  10
of
95
Information Theory and Communication Networks: An Unconsummated Union
 IEEE Trans. Inform. Theory
, 1998
"... Information theory has not yet had a direct impact on networking, although there are similarities in concepts and methodologies that have consistently attracted the attention of researchers from both fields. In this paper, we review several topics that are related to communication networks and that ..."
Abstract

Cited by 133 (5 self)
 Add to MetaCart
Information theory has not yet had a direct impact on networking, although there are similarities in concepts and methodologies that have consistently attracted the attention of researchers from both fields. In this paper, we review several topics that are related to communication networks and that have an information theoretic flavor, including multiaccess protocols, timing channels, effective bandwidth of bursty data sources, deterministic constraints on datastreams, queueing theory, and switching networks. Keywords Communication networks, multiaccess, effective bandwidth, switching I. INTRODUCTION Information theory is the conscience of the theory of communication; it has defined the "playing field" within which communication systems can be studied and understood. It has provided the spawning grounds for the fields of coding, compression, encryption, detection, and modulation and it has enabled the design and evaluation of systems whose performance is pushing the limits of wha...
Notes on Effective Bandwidths
, 1996
"... This paper presents a personal view of work to date on effective bandwidths, emphasising the unifying role of the concept: as a summary of the statistical characteristics of sources over different time and space scales; in bounds, limits and approximations for various models of multiplexing unde ..."
Abstract

Cited by 131 (4 self)
 Add to MetaCart
This paper presents a personal view of work to date on effective bandwidths, emphasising the unifying role of the concept: as a summary of the statistical characteristics of sources over different time and space scales; in bounds, limits and approximations for various models of multiplexing under quality of service constraints; and as the basis for simple and robust tariffing and connection acceptance control mechanisms for poorly characterized traffic. The framework assumes only stationarity of sources, and illustrative examples include periodic streams, fractional Brownian input, policed and shaped sources, and deterministic multiplexing.
Admission Control for Statistical QoS: Theory and Practice
, 1999
"... In networks that support Quality of Service (QoS), an admission control algorithm determines whether or not a new traffic flow can be admitted to the network such that all users will receive their required performance. Such an algorithm is a key component of future multiservice networks as it deter ..."
Abstract

Cited by 105 (12 self)
 Add to MetaCart
In networks that support Quality of Service (QoS), an admission control algorithm determines whether or not a new traffic flow can be admitted to the network such that all users will receive their required performance. Such an algorithm is a key component of future multiservice networks as it determines the extent to which network resources are utilized and whether the promised QoS parameters are actually delivered. Our goals in this paper are threefold. First, we describe and classify a broad set of proposed admission control algorithms. Second, we evaluate the accuracy of these algorithms via experiments using both onoff sources and long traces of compressed video; we compare the admissible regions and QoS parameters predicted by our implementations of the algorithms with those obtained from tracedriven simulations. Finally, we identify the key aspects of an admission control algorithm necessary for achieving a high degree of accuracy and hence a high statistical multiplexing gain...
Distributed Admission Control
"... This paper describes a framework for admission control for a packetbased network where the decisions are taken by edge devices or endsystems, rather than resources within the network. The decisions are based on the results of probe packets that the endsystems send through the network, and requir ..."
Abstract

Cited by 94 (7 self)
 Add to MetaCart
This paper describes a framework for admission control for a packetbased network where the decisions are taken by edge devices or endsystems, rather than resources within the network. The decisions are based on the results of probe packets that the endsystems send through the network, and require only that resources apply a mark to packets in a way that is load dependent. One application example is the Internet, where marking information is fed back via an ECN bit, and we show howthis approach allows a rich QoS framework for ows or streams. Our approach allows networks to be explicitly analysed, and consequently engineered.
MeasurementBased Connection Admission Control
, 1997
"... ... In this paper we continue the development of a modelling approach which attempts to integrate these several timescales, and illustrate its application to the analysis of a family of simple and robust measurementbased admission controls. A subsidiary aim of the paper is to shed light on the rel ..."
Abstract

Cited by 80 (2 self)
 Add to MetaCart
... In this paper we continue the development of a modelling approach which attempts to integrate these several timescales, and illustrate its application to the analysis of a family of simple and robust measurementbased admission controls. A subsidiary aim of the paper is to shed light on the relationship between the admission control proposed for ATM networks by Gibbens et al [9] and that proposed for controlledload Internet services by Floyd [7]. We shall see that their common origin in Chernoff bounds allows the definition of a simple and general family of admission controls, capable of tailoring for several implementation scenarios.
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...
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 ...
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 60 (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.
Distributing Layered Encoded Video through Caches
, 2001
"... The efficient distribution of stored information has become a major concern in the Internet which has increasingly become a vehicle for the transport of stored video. Because of the highly heterogeneous access to the Internet, researchers and engineers have argued for layered encoded video. In this ..."
Abstract

Cited by 55 (3 self)
 Add to MetaCart
The efficient distribution of stored information has become a major concern in the Internet which has increasingly become a vehicle for the transport of stored video. Because of the highly heterogeneous access to the Internet, researchers and engineers have argued for layered encoded video. In this paper we investigate delivering layered encoded video using caches. Based on the stochastic knapsack theory we develop a model for the layered video caching problem. We propose heuristics to determine which videos and which layers in the videos should be cached in order to maximize the revenue from the streaming service. We evaluate the performance of our heuristics through extensive numerical experiments. We find that for typical scenarios, the revenue increases nearly logarithmically with the cache size and linearly with the link bandwidth that connects the cache to the origin servers. We also consider service models with request queuing and negotiations about the delivered stream quality and find that both extensions provide only small revenue increases.
Economies of Scale in Queues With Sources Having PowerLaw Large Deviation Scalings.
, 1995
"... We analyse the queue Q L at a multiplexer with L sources which may display longrange dependence. This includes, for example, sources modelled by fractional Brownian Motion (fBM). The workload processes W due to each source are assumed to have large deviation properties of the form P [W t =a(t) ? ..."
Abstract

Cited by 39 (10 self)
 Add to MetaCart
We analyse the queue Q L at a multiplexer with L sources which may display longrange dependence. This includes, for example, sources modelled by fractional Brownian Motion (fBM). The workload processes W due to each source are assumed to have large deviation properties of the form P [W t =a(t) ? x] ß e \Gammav(t)K(x) for appropriate scaling functions a and v, and ratefunction K. Under very general conditions, lim L!1 L \Gamma1 log P [Q L ? Lb] = \GammaI (b) provided the offered load is held constant, where the shape function I is expressed in terms of the cumulant generating functions of the input traffic. For powerlaw scalings v(t) = t v , a(t) = t a (such as occur in fBM) we analyse the asymptotics of the shape function: lim b!1 b \Gammau=a i I(b) \Gamma ffi b v=a j = u for some exponent u and constant depending on the sources. This demonstrates the economies of scale available through the multiplexing of a large number of such sources, by comparison with ...