2011 IEEE 11th International Conference on Computer and Information Technology 2011
DOI: 10.1109/cit.2011.95
|View full text |Cite
|
Sign up to set email alerts
|

A Poisson Based Bursty Model of Internet Traffic

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 7 publications
0
2
0
Order By: Relevance
“…Its main limitation is that it imposes strong assumptions on the packet arrival process, which typically do not hold in real networks [2]. Internet traffic has been extensively analyzed in the past two decades [3], [4], [5], [6], [7] and, despite the community has not agreed on a universal model, there is consensus that in general aggregated traffic shows strong autocorrelation and a heavy-tail [8].…”
Section: Introductionmentioning
confidence: 99%
“…Its main limitation is that it imposes strong assumptions on the packet arrival process, which typically do not hold in real networks [2]. Internet traffic has been extensively analyzed in the past two decades [3], [4], [5], [6], [7] and, despite the community has not agreed on a universal model, there is consensus that in general aggregated traffic shows strong autocorrelation and a heavy-tail [8].…”
Section: Introductionmentioning
confidence: 99%
“…Such optimizations have been studied successfully when analyzing bit-errors in telecommunication systems (e.g. wireless systems) (Wilhelm, 1976;Wilhelm, 2018) as well as packet arrivals in Ethernet-based data networks (Kessler et al, 2000) or when analyzing the internet traffic (Kresch and Kulkarni, 2011;Zuckermann, Neame and Addie, 2003), where data packets arrive in bursts as well.…”
Section: Introductionmentioning
confidence: 99%