Global stability of Peer-to-Peer file sharing systems

Qiu, Dongyu; Sang, Weiqian

doi:10.1016/j.comcom.2007.08.012

Cited by 26 publications

(23 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As long as it obtains one fragment of the file, the new peer can start to serve other peers by uploading fragments. Since peers are downloading and uploading at the same time, when the network becomes large, although the demands increase, the service provided by the network also increases [50]. Given N peers, a graph G = (V , E)…”

Section: Metricsmentioning

confidence: 99%

Multi swarms for neighbor selection in peer-to-peer overlay networks

2010

View full text Add to dashboard Cite

Peer-to-peer (P2P) topology has a significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we investigate a multi-swarm approach to the problem of neighbor selection (NS) in P2P networks. Particle swarm share some common characteristics with P2P in the dynamic socially environment. Each particle encodes the upper half of the peer-connection matrix through the undirected graph, which reduces the search space dimension. The portion of the adjustment to the velocity influenced by the individual's cognition, the group cognition from multi-swarms, and the social cognition from the whole swarm, makes an important influence on the particles' ergodic and synergetic performance. We also attempt to theoretically prove that the multiswarm optimization algorithm converges with a probability of 1 towards the global optima. The performance of our This work is supported partially by NSFC Grant 60873054.A. Abraham ( ) Machine Egypt approach is evaluated and compared with other two different algorithms. The results indicate that it usually required shorter time to obtain better results than the other considered methods, specially for large scale problems.

show abstract

Section: Metricsmentioning

confidence: 99%

Multi swarms for neighbor selection in peer-to-peer overlay networks

2010

View full text Add to dashboard Cite

show abstract

“…Both should vary with time and in rush hours [9]. Peers are homogeneous in resources capacities (in practice, peers are homogeneous; here we consider a meanfield hypothesis [35]). The exchange effectiveness is constant.…”

Section: Sequential Fluid Models For On-demand Video Servicesmentioning

confidence: 99%

Lyapunov stability and performance of user-assisted Video-on-Demand services

et al. 2015

View full text Add to dashboard Cite

“…Their model describes the time-evolution of the system by differential equations. The global stability of this fluid model is proved in [9]. Extension of [8] to heterogeneous users has been given in [10], [11].…”

Section: Related Workmentioning

confidence: 99%

Segmented P2P video-on-demand: Modeling and performance

Aalto¹,

Lassila²,

Savolainen

et al. 2010

2010 22nd International Teletraffic Congress (lTC 22)

View full text Add to dashboard Cite

Abstract-In a segmented peer-to-peer video-on-demand system the video file is split into a number of segments and the downloading of the video file proceeds in a more or less sequential manner from one segment to another (i.e., in stages). We present an analytical fluid model for such systems. Notably, for this model we derive an explicit condition when the system has a unique positive steady-state solution and that the viewing quality is acceptable. The analytical results are complemented with extensive simulations from the corresponding stochastic model, as well as traces from a more realistic BitTorrent simulator.

show abstract

Global stability of Peer-to-Peer file sharing systems

Cited by 26 publications

References 18 publications

Multi swarms for neighbor selection in peer-to-peer overlay networks

Multi swarms for neighbor selection in peer-to-peer overlay networks

Lyapunov stability and performance of user-assisted Video-on-Demand services

Segmented P2P video-on-demand: Modeling and performance

Contact Info

Product

Resources

About