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

Approaching long-tailed distribution by increasing the process complexity

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)

We propose to model network traffic using a probabilistic context-free grammar, which is based on the multi-type branching process. Since this research is in its very early stages, the purpose of this paper is merely to suggest a justification for this model. This paper demonstrates how the lengths of the strings generated by one simple example of a probabilistic context-free grammar have first-order statistics with the characteristic “long tail” that is observed in real network traffic. The paper also shows that the lengths of the strings generated by corresponding Poisson or Markov models fall short of having this long tailed distribution

Published in:

Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE  (Volume:1 )

Date of Conference:

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.