Abstract | ||
---|---|---|
Recent studies have shown that the majority of today's internet traffic is
related to Peer to Peer (P2P) traffic. The study of bandwidth in P2P networks
is very important. Because it helps us in more efficient capacity planning and
QoS provisioning when we would like to design a large scale computer networks.
In this paper motivated by the behavior of peers (sources or seeds) that is
modeled by Ornstein Uhlenbeck (OU) process, we propose a model for bandwidth in
P2P networks. This model is represented with a stochastic integral. We also
model the bandwidth when we have multiple downloads or uploads. The
autocovariance structure of bandwidth in either case is studied and the
statistical parameters such as mean, variance and autocovariance are obtained.
We then study the queue length behavior of the bandwidth model. The methods for
generating synthetic bandwidth process and estimation of the bandwidth
parameters using maximum likehood estimation are presented. |
Year | DOI | Venue |
---|---|---|
2010 | 10.5121/ijcnc.2010.2306 | International Journal of Computer Networks & Communications |
Keywords | Field | DocType |
ornstein uhlenbeck,computer network,internet traffic,p2p | Autocovariance,Peer-to-peer,Computer science,Queue,Upload,Computer network,Capacity planning,Bandwidth (signal processing),Dynamic bandwidth allocation,Internet traffic,Distributed computing | Journal |
Volume | Issue | ISSN |
abs/1005.1 | 3 | International Journal of Computer Networks & Communications 2.3
(2010) 65-83 |
Citations | PageRank | References |
2 | 0.93 | 5 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Kiarash Mizanian | 1 | 8 | 3.06 |
Mehdi Vasef | 2 | 6 | 2.41 |
Morteza Analoui | 3 | 124 | 24.94 |