Cart (Loading....) | Create Account
Close category search window
 

Stochastically bounded burstiness for communication networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Starobinski, D. ; Dept. of Electr. Eng., Technion-Israel Inst. of Technol., Haifa, Israel ; Sidi, M.

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

Published in:

Information Theory, IEEE Transactions on  (Volume:46 ,  Issue: 1 )

Date of Publication:

Jan 2000

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.