By Topic

A discrete map model for self-similar traffic generated by network protocols

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)
Ashwin, S. ; Dept. of Electr. Eng., Indian Inst. of Technol., Chennai, India ; Prabhakar, A.

Self-similarity has been observed in various traffic measurements and can be attributed in some instances to the effect of network protocols. We have developed a discrete map for packet transmission using the stop-and-wait protocol under the limitations of a finite size buffer at the receiver. We have shown that the resultant traffic is self-similar under Poisson distributed input. We then generalized the discrete map for buffer overflow by using it to simulate the self-similarity in TCP traffic. A map of total packets transmitted in a given time interval versus that transmitted in the previous interval provides an easy visualization of self-similarity. The map from a simulation with 10 transmitters captured the salient features of a map from experimental data.

Published in:

TENCON 2003. Conference on Convergent Technologies for the Asia-Pacific Region  (Volume:1 )

Date of Conference:

15-17 Oct. 2003