#### DMCA

## Modeling and performance analysis of bittorrentlike peer-to-peer networks (2004)

Venue: | In SIGCOMM |

Citations: | 563 - 2 self |

### Citations

5090 |
Convergence of Probability Measures
- Billingsley
- 1968
(Show Context)
Citation Context ...ochastic process converges to the deterministic and stochastic differential equation limits when the arrival rate goes to ∞. This can be established using weakconvergence theorems such as the ones in =-=[5, 12, 23]-=-. 4 Incentive Mechanism In this section, we discuss the algorithm in BitTorrent which is intended to discourage free-riding. We first describe the algorithm and then study the optimal selfish behavior... |

2192 | Data Networks
- Bertsekas, Gallager
- 1992
(Show Context)
Citation Context ... combined to yield ¯x = ¯y = 1 1 1 = ( − η µ γ ). 1 − γ )}, then (3) and (4) λ β(1 + θ β ) λ γ(1 + θ (5) β ). To calculate the average downloading time for a peer in steady state, we use Little’s law =-=[4]-=- as follows: ¯x = (λ − θ¯x)T, where T is the average downloading time and λ − θ¯x is the average rate at which downloads are completed. Using (5), it is now easy to see that T = 1 β = max{1 c 1 1 , ( ... |

1012 | Incentives build robustness in BitTorrent
- Cohen
- 2003
(Show Context)
Citation Context ...re are many P2P file sharing programs, such as Kazza, Gnuttella, eDonkey/overnet, BitTorrent, to name a few. In this paper, we develop simple models to understand and study the behavior of BitTorrent =-=[8]-=- which is proving to be one of the more popular P2P applications today. For a BitTorrent network (or a general P2P file sharing network), several issues have to be addressed in order to understand the... |

990 | Wide-area cooperative storage with CFS
- Dabek, Kaashoek, et al.
- 2001
(Show Context)
Citation Context ...the system is expected to scale well even when the network is very large. Besides file sharing, P2P overlays have also been deployed in distributed directory service [18, 21], web cache [15], storage =-=[9]-=-, and grid computation [1] etc. While early work on P2P systems has mainly focused on system design and traffic measurement [19, 20, 17], some recent research has emphasized performance analysis. In [... |

787 | Chord: a scalable peer-to-peer lookup protocol for Internet applications
- Stoica, Morris, et al.
- 2003
(Show Context)
Citation Context ...buted to all participating peers, the system is expected to scale well even when the network is very large. Besides file sharing, P2P overlays have also been deployed in distributed directory service =-=[18, 21]-=-, web cache [15], storage [9], and grid computation [1] etc. While early work on P2P systems has mainly focused on system design and traffic measurement [19, 20, 17], some recent research has emphasiz... |

356 |
Stochastic differential equations: Theory and applications
- Arnold
- 1974
(Show Context)
Citation Context ... γ ) which is unlikely to occur in practice. From (12), it is easy to compute the steady-state covariance of ˆ X, i.e, Σ = limt→∞ E( ˆ X(t) ˆ XT (t)). This is given by the so-called Lyapunov equation =-=[3]-=- AΣ + ΣA T + BB T = 0. (14) The steady-state variance of ˆx is then given by (1, 1) element of Σ and the steady-state variance of ˆy is given by the (2, 2) element of Σ. The above result essentially s... |

356 | Basic problems in stability and design of switched systems
- Liberzon, Morse
- 1999
(Show Context)
Citation Context ...analyze because of the fact that the dynamics of the system changes depending upon whether cx > µ(ηx + y) or not. Such systems are called switched linear systems; we refer the reader to the survey in =-=[16]-=- for the stability issues associated with such models. 3.4 Characterizing Variability When the request arrival rate is large (which also means a large number of downloaders and seeds), the fluid model... |

356 | Mapping the gnutella network: Properties of largescale peer-to-peer systems and implications for system design,” arXiv preprint cs/0209028
- Ripeanu, Foster, et al.
- 2002
(Show Context)
Citation Context ...loyed in distributed directory service [18, 21], web cache [15], storage [9], and grid computation [1] etc. While early work on P2P systems has mainly focused on system design and traffic measurement =-=[19, 20, 17]-=-, some recent research has emphasized performance analysis. In [13], a closed queueing system is used to model a general P2P file sharing system and basic insights on the stationary performance are pr... |

266 | Peer-to-peer architecture case study: Gnutella network
- Ripeanu
(Show Context)
Citation Context ...loyed in distributed directory service [18, 21], web cache [15], storage [9], and grid computation [1] etc. While early work on P2P systems has mainly focused on system design and traffic measurement =-=[19, 20, 17]-=-, some recent research has emphasized performance analysis. In [13], a closed queueing system is used to model a general P2P file sharing system and basic insights on the stationary performance are pr... |

210 | Squirrel: A decentralized, peer-to-peer web cache
- Iyer, Rowstron, et al.
- 2002
(Show Context)
Citation Context ...pating peers, the system is expected to scale well even when the network is very large. Besides file sharing, P2P overlays have also been deployed in distributed directory service [18, 21], web cache =-=[15]-=-, storage [9], and grid computation [1] etc. While early work on P2P systems has mainly focused on system design and traffic measurement [19, 20, 17], some recent research has emphasized performance a... |

155 |
Service capacity of peer to peer networks
- Yang, Veciana
- 2004
(Show Context)
Citation Context ...tionary performance are provided. In [6, 7], a stochastic fluid model is used to study the performance of P2P web cache (SQUIRREL) and cache clusters. A part of our work is motivated by the models in =-=[11, 24]-=-, where a branching process is used to study the service capacity of BitTorrent-like P2P file sharing in the transient regime and a simple Markovian model is presented to study the steady-state proper... |

117 | Modeling peer-peer file sharing systems
- Ge, Figueiredo, et al.
- 2003
(Show Context)
Citation Context ...], and grid computation [1] etc. While early work on P2P systems has mainly focused on system design and traffic measurement [19, 20, 17], some recent research has emphasized performance analysis. In =-=[13]-=-, a closed queueing system is used to model a general P2P file sharing system and basic insights on the stationary performance are provided. In [6, 7], a stochastic fluid model is used to study the pe... |

61 | Measurement-based optimization techniques for bandwidth-demanding peer-to-peer systems
- Ng, Chu, et al.
- 2003
(Show Context)
Citation Context ...loyed in distributed directory service [18, 21], web cache [15], storage [9], and grid computation [1] etc. While early work on P2P systems has mainly focused on system design and traffic measurement =-=[19, 20, 17]-=-, some recent research has emphasized performance analysis. In [13], a closed queueing system is used to model a general P2P file sharing system and basic insights on the stationary performance are pr... |

37 |
Stochastic process limits
- Whitt
- 2002
(Show Context)
Citation Context ...ochastic process converges to the deterministic and stochastic differential equation limits when the arrival rate goes to ∞. This can be established using weakconvergence theorems such as the ones in =-=[5, 12, 23]-=-. 4 Incentive Mechanism In this section, we discuss the algorithm in BitTorrent which is intended to discourage free-riding. We first describe the algorithm and then study the optimal selfish behavior... |

31 | incentives and performance in peer-to-peer networks
- Veciana, Yang, et al.
- 2003
(Show Context)
Citation Context ...tionary performance are provided. In [6, 7], a stochastic fluid model is used to study the performance of P2P web cache (SQUIRREL) and cache clusters. A part of our work is motivated by the models in =-=[11, 24]-=-, where a branching process is used to study the service capacity of BitTorrent-like P2P file sharing in the transient regime and a simple Markovian model is presented to study the steady-state proper... |

24 | A Simple Fluid Model for the Analysis of the Squirrel Peerto-Peer Caching System
- Clevenot, Nain
- 2004
(Show Context)
Citation Context ...nt research has emphasized performance analysis. In [13], a closed queueing system is used to model a general P2P file sharing system and basic insights on the stationary performance are provided. In =-=[6, 7]-=-, a stochastic fluid model is used to study the performance of P2P web cache (SQUIRREL) and cache clusters. A part of our work is motivated by the models in [11, 24], where a branching process is used... |

20 |
On the heavy-traffic limit theorem for GI/G/∞ queues
- Whitt
- 1982
(Show Context)
Citation Context ...l interval δ is given by min(cx, µ(ηx + y))δ. These assumptions can be easily relaxed to allow more general distributions for all the random variables involved by using phase-type distributions as in =-=[14, 22, 10]-=-. Under these assumptions, the number of downloaders and seeds at any time t can be described by x(t) + √ λˆx(t), y(t) + √ λˆy(t), respectively, where ˆ X = (ˆx, ˆy) T is the solution to the following... |

18 | A Scalable Content-Addressable Network - Shenker - 2001 |

13 | applications (bytes) for subinterface: SD-NAP traffic - Top - 2002 |

11 | Stochastic Fluid Models for Cache Clusters
- Clevenot, Nain, et al.
- 2003
(Show Context)
Citation Context ...nt research has emphasized performance analysis. In [13], a closed queueing system is used to model a general P2P file sharing system and basic insights on the stationary performance are provided. In =-=[6, 7]-=-, a stochastic fluid model is used to study the performance of P2P web cache (SQUIRREL) and cache clusters. A part of our work is motivated by the models in [11, 24], where a branching process is used... |

11 | Diffusion approximations for a single node accessed by congestion-controlled sources
- Das, Srikant
- 1998
(Show Context)
Citation Context ...l interval δ is given by min(cx, µ(ηx + y))δ. These assumptions can be easily relaxed to allow more general distributions for all the random variables involved by using phase-type distributions as in =-=[14, 22, 10]-=-. Under these assumptions, the number of downloaders and seeds at any time t can be described by x(t) + √ λˆx(t), y(t) + √ λˆy(t), respectively, where ˆ X = (ˆx, ˆy) T is the solution to the following... |

7 |
On the Markov property of the GI/G/∞ Gaussian limit
- Glynn
- 1982
(Show Context)
Citation Context ...l interval δ is given by min(cx, µ(ηx + y))δ. These assumptions can be easily relaxed to allow more general distributions for all the random variables involved by using phase-type distributions as in =-=[14, 22, 10]-=-. Under these assumptions, the number of downloaders and seeds at any time t can be described by x(t) + √ λˆx(t), y(t) + √ λˆy(t), respectively, where ˆ X = (ˆx, ˆy) T is the solution to the following... |

1 |
applications (bytes) for subin- [18
- Top
- 2001
(Show Context)
Citation Context ...on Peer-to-Peer (P2P) applications have become immensely popular in the Internet. Traffic measurements shows that P2P traffic is starting to dominate the bandwidth in certain segments of the Internet =-=[2]-=-. Among P2P applications, file sharing is perhaps the most popular application. Compared to traditional client/sever file sharing (such as FTP, WWW), P2P file sharing has one big advantage, namely, sc... |