Stochastically bounded burstiness for communication networks

  • Authors:
  • D. Starobinski;M. Sidi

  • Affiliations:
  • Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2000

Quantified Score

Hi-index 754.84

Visualization

Abstract

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 judicious 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