Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0996.90016
Starobinski, David; Sidi, Moshe
Stochastically bounded burstiness for communication networks. (English)
[J] IEEE Trans. Inf. Theory 46, No.1, 206-212 (2000). ISSN 0018-9448

Summary: A network calculus is developed for processes whose burstiness is stochastically bounded by general decreasing functions. This calculus is useful for a large class of input processes, including important processes exhibiting ``subexponentially bounded burstiness'' such as fractional Brownian motion. Moreover, it allows judicions capture of the salient features of real-time traffic, such as the ``cell'' and ``burst'' characteristics of multiplexed traffic. This accurate characterization is achieved by setting the bounding function as a sum of exponentials.

MSC 2000:: *90B18 Communication networks

Keywords: multiple time-scale traffic; network calculus; statistical bounds

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]