Results 1  10
of
38
RCBR: A Simple and Efficient Service for Multiple TimeScale Traffic
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1997
"... Variable bitrate (VBR) compressed video traffic is expected to be a significant component of the traffic mix in integrated services networks. This traffic is hard to manage because it has strict delay and loss requirements while simultaneously exhibiting burstiness at multiple time scales. We show ..."
Abstract

Cited by 172 (4 self)
 Add to MetaCart
Variable bitrate (VBR) compressed video traffic is expected to be a significant component of the traffic mix in integrated services networks. This traffic is hard to manage because it has strict delay and loss requirements while simultaneously exhibiting burstiness at multiple time scales. We show that burstiness over long time scales, in conjunction with resource reservation using oneshot traffic descriptors, can substantially degrade the loss rate, endtoend delay, and statistical multiplexing gain of a connection. We use largedeviation theory to model the performance of multiple timescale traffic and to motivate the design of renegotiated constant bit rate (RCBR) service. Sources using
Squeezing the most out of ATM.
 IEEE Transactions on Communications,
, 1996
"... ..."
(Show Context)
Stochastically Bounded Burstiness for Communication Networks
 IEEE TRANSACTIONS ON INFORMATION THEORY
, 1999
"... We develop a network calculus for processes whose burstiness is stochastically bounded by general decreasing functions. This calculus enables us to prove the stability of feedforward networks and obtain statistical upper bounds on interesting performance measures such as delay, at each buffer in the ..."
Abstract

Cited by 76 (4 self)
 Add to MetaCart
We develop a network calculus for processes whose burstiness is stochastically bounded by general decreasing functions. This calculus enables us to prove the stability of feedforward networks and obtain statistical upper bounds on interesting performance measures such as delay, at each buffer in the network. Our bounding methodology is useful for a large class of input processes, including important processes exhibiting "subexponentially bounded burstiness" such as fractional Brownian motion. Moreover, it generalizes previous approaches and provides much better bounds for common models of realtime traffic, like Markov modulated processes and other multiple timescale processes. We expect that this new calculus will be of particular interest in the implementation of services providing statistical guarantees.
The Effect of Multiple Time Scales and Subexponentiality on the Behavior of a Broadband Network Multiplexer
, 1996
"... The Effect of Multiple Time Scales and Subexponentiality on the Behavior of a Broadband Network Multiplexer Predrag R. Jelenkovi'c The main theme of this dissertation is the evaluation of the capacity of broadband multimedia network multiplexers. This problem calls for the modeling of network ..."
Abstract

Cited by 65 (16 self)
 Add to MetaCart
(Show Context)
The Effect of Multiple Time Scales and Subexponentiality on the Behavior of a Broadband Network Multiplexer Predrag R. Jelenkovi'c The main theme of this dissertation is the evaluation of the capacity of broadband multimedia network multiplexers. This problem calls for the modeling of network traffic streams and the analysis of a network multiplexer that is loaded with the corresponding models. For modeling we focus on MPEG video traffic streams that are expected to be predominant in the traffic mixture of future multimedia networks. We experimentally demonstrate that realtime MPEG video traffic exhibits multiple time scale characteristics, as well as subexponential first and second order statistics. Then we construct a model of MPEG video that captures both of these characteristics and accurately predicts queueing behavior for a broad range of buffer and capacity sizes. Depending on whether a network multiplexer (loaded with MPEG) is strictly or weakly stable the dominant effect o...
Loss Probability Calculations and Asymptotic Analysis for Finite Buffer Multiplexers
, 2001
"... In this paper, we propose an approximation for the loss probability, @ A, in a finite buffer system with buffer size. Our study is motivated by the case of a highspeed network where a large number of sources are expected to be multiplexed. Hence, by appealing to Central Limit Theorem type of argum ..."
Abstract

Cited by 49 (4 self)
 Add to MetaCart
In this paper, we propose an approximation for the loss probability, @ A, in a finite buffer system with buffer size. Our study is motivated by the case of a highspeed network where a large number of sources are expected to be multiplexed. Hence, by appealing to Central Limit Theorem type of arguments, we model the input process as a general Gaussian process. Our result is obtained by making a simple mapping from the tail probability in an infinite buffer system to the loss probability in a finite buffer system. We also provide a strong asymptotic relationship between our approximation and the actual loss probability for a fairly large class of Gaussian input processes. We derive some interesting asymptotic properties of our approximation and illustrate its effectiveness via a detailed numerical investigation.
Asymptotic Buffer Overflow Probabilities in Multiclass Multiplexers: An Optimal Control Approach
 IEEE Trans. Automatic Control
, 1997
"... We consider a multiclass multiplexer with support for multiple service classes, and dedicated buffers for each service class. Under specific scheduling policies for sharing bandwidth among these classes, we seek the asymptotic (as the buffer size goes to infinity) tail of the buffer overflow probabi ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
We consider a multiclass multiplexer with support for multiple service classes, and dedicated buffers for each service class. Under specific scheduling policies for sharing bandwidth among these classes, we seek the asymptotic (as the buffer size goes to infinity) tail of the buffer overflow probability for each dedicated buffer. We assume dependent arrival and service processes as is usually the case in models of bursty traffic. In the standard large deviations methodology, we provide a lower and a matching (up to first degree in the exponent) upper bound on the buffer overflow probabilities. We introduce a novel optimal control approach to address these problems. In particular, we relate the lower bound derivation to a deterministic optimal control problem, which we explicitly solve. Optimal state trajectories of the control problem correspond to typical congestion scenarios. We explicitly and in detail characterize the most likely modes of overflow. We specialize our results to the ...
Modeling Heterogeneous Network Traffic in Wavelet Domain: Part II  NonGaussian Traffic
 IEEE/ACM Transactions on Networking
, 1999
"... Following our work described in Part I of this paper that modeled various correlation structures of Gaussian traffic in wavelet domain, we extend our previous models to heterogeneous network traffic with either a nonGaussian distribution or a periodic structure. To include a nonGaussian distributi ..."
Abstract

Cited by 25 (1 self)
 Add to MetaCart
(Show Context)
Following our work described in Part I of this paper that modeled various correlation structures of Gaussian traffic in wavelet domain, we extend our previous models to heterogeneous network traffic with either a nonGaussian distribution or a periodic structure. To include a nonGaussian distribution, we first investigate what higherorder statistics are pertinent by exploring a relationship between timescale analysis of wavelets and cumulative traffic. We then develop a novel algorithm in the wavelet domain to capture the important statistics. By utilizing local properties of wavelet basis in both space and time, we further extend such wavelet models to periodic MPEG traffic. As wavelets provide a natural fit to higherorder statistics as well as localized spatial and temporal dependence of periodic traffic at different time scales, the resulting wavelet models for both nonGaussian and periodic traffic are simple and accurate with the lowest computational complexity attainable. 1 I...
Queuing Analysis in Multichannel Cognitive Spectrum Access: A Large Deviation Approach
"... Abstract—The queueing performance of a (secondary) cognitive user is investigated for a hierarchical network where there are N independent and identical primary users. Each primary user employs a slotted transmission protocol, and its channel usage forms a twostate (busy,idle) discretetime Markov ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
(Show Context)
Abstract—The queueing performance of a (secondary) cognitive user is investigated for a hierarchical network where there are N independent and identical primary users. Each primary user employs a slotted transmission protocol, and its channel usage forms a twostate (busy,idle) discretetime Markov chain. The cognitive user employs the optimal policy to select which channel to sense (and use if found idle) at each slot. In the framework of effective bandwidths, the stationary queue tail distribution of the cognitive user is estimated using a large deviation approach for which closedform expressions are obtained when N =2. Upper and lower bounds are obtained for the general N primary user network. For positively correlated primary transmissions, the bounds are shown to be asymptotically tight. Monte Carlo simulations using importance sampling techniques are used to validate the obtained large deviation estimates. Index terms—Effective bandwidth, Queueing analysis, Cognitive radio and Dynamic spectrum access.
SMAQ: A MeasurementBased Tool for Traffic Modeling and Queueing Analysis, Part II  Network Applications
 IEEE Communications Magazine
, 1998
"... SMAQ is a measurementbased tool for integration of traffic modeling and queuing analysis. It can be used in a variety of network design areas. For instance, it can be used as a traffic generator to generate various traces for network testing. It also provides numerical solutions of the queue length ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
SMAQ is a measurementbased tool for integration of traffic modeling and queuing analysis. It can be used in a variety of network design areas. For instance, it can be used as a traffic generator to generate various traces for network testing. It also provides numerical solutions of the queue length and loss rate performance for transport of multimedia traffic. Several application modules are built into the tool for the evaluation of statistical multiplexing, buffer dimensioning, and link bandwidth allocation. Other examples include the evaluation of traffic shaping, local congestion control, and the modeling of wireless channel dynamics. As one will find, the SMAQ tool indeed provides a solution technique for network engineers to solve many of the current design issues. A trial version of the Webbased SMAQ tool can be found on our Web site at
Classspecific quality of service guarantees in multimedia communication networks
, 1999
"... An admission control approach that can provide per class packet loss and delay Quality of Service guarantees is developed. The proposed approach is based on large deviations performance analysis results. We consider the problem of qualityofservice (QoS) provisioning in modern highspeed, multimedi ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
(Show Context)
An admission control approach that can provide per class packet loss and delay Quality of Service guarantees is developed. The proposed approach is based on large deviations performance analysis results. We consider the problem of qualityofservice (QoS) provisioning in modern highspeed, multimedia, communication networks. We quantify QoS by the probabilities of loss and excessive delay of an arbitrary packet, and introduce the model of a multiclass node (switch) which provides network access to users that may belong to multiple service classes. We treat such a node as a stochastic system which we analyze and control. In particular, we develop an analytical approach to estimate both the delay and the buffer overflow probability per service class, based on ideas from large deviations and optimal control. We exploit these performance analysis results by devising a call admission control algorithm which can provide per class QoS guarantees. We compare the proposed approach to alternative worstcase and effective bandwidthbased schemes and argue that it leads to increased efficiency. Finally, we discuss extensions to the network case in order to provide endtoend QoS guarantees.