Minimizing File Download Time over Stochastic Channels in Peer-to-Peer Networks

Chiu, Yu‐Ting; Eun, Do Young

doi:10.1109/ciss.2006.286454

Cited by 11 publications

(35 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, even if all peers in the network are altruistic, we are still far away from enjoying the performance predicted by [5], [14]. Results in [15] suggest that both the stochastic temporal fluctuation and the heterogeneity in service capacity of each peer can make the average download time significantly longer than expected, even when all peers in the network are willing to share. Although some other earlier studies have also noticed the impact of stochastic fluctuation and the heterogeneity in service capacity of each peer, those studies often have more limited viewpoints.…”

Section: Introductionmentioning

confidence: 79%

On the Performance of Content Delivery under Competition in a Stochastic Unstructured Peer-to-Peer Network

Chiu¹,

Eun

2010

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

Abstract-Peer-to-peer (P2P) network is widely used for transferring large files nowadays. Measurement results show that most downloading peers are patient as the average download session is usually very long. It is sometimes even longer than downloading from a dedicated server using a modem. Existing results in the literature indicate that the stochastic fluctuation and the heterogeneity in the service capacity of each peer are two of the major reasons that make the average download time far longer than expected. In those studies, it has been often assumed that there is only one downloading peer in the network, ignoring the interaction and competition among peers. In this paper, we investigate the impact of the interaction and competition among peers on downloading performance under stochastic, heterogeneous, unstructured P2P settings, thereby greatly extending the existing results on stochastic P2P networks made only under a single downloading peer in the network. To analyze the average download time in a P2P network with multiple competing downloading peers, we first introduce the notion of system utilization tailored to a P2P network. We investigate the relationship between the average download time, system utilization and the level of competition among downloading peers in a stochastic P2P network. We then derive an achievable lower bound on the average download time and propose algorithms to give the peers the minimum average download time. Our result can much improve the download performance compared to earlier results in the literature. The performance of the different algorithms is compared under NS-2 simulations. Our results also provide theoretical explanation to the inconsistency of performance improvement by using parallel connections (parallel connections sometimes do not outperform a single connection) observed in some measurement studies.

show abstract

Section: Introductionmentioning

confidence: 79%

On the Performance of Content Delivery under Competition in a Stochastic Unstructured Peer-to-Peer Network

Chiu¹,

Eun

2010

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…A subset of results reported in this paper has appeared in the proceedings of Conference in Information Science and Systems (CISS) 2006 [1] However, the measurement results in [4] show that a file download session in a P2P network is rather long and varies a lot from user to user. For instance, downloading an 100MB file in a Gnutella network can range from several hours to a whole week.…”

Section: Introductionmentioning

confidence: 83%

“…Suppose that there are two source peers with service capacities of c 1 = 100kbps and c 2 = 150kbps, respectively, and there is only one downloading peer in the network. Because the downloading peer does not know the service capacity of each source peer 1 prior to its connection, the best choice that the downloading peer can make to minimize the risk is to choose the source peers with equal probability. In such a setting, the average capacity that the downloading peer expects from the network is (100 + 150)/2 = 125kbps.…”

Section: A Limitations Of Approach Via Average Service Capacitymentioning

confidence: 99%

Minimizing File Download Time in Stochastic Peer-to-Peer Networks

Chiu

Eun

2008

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-The peer-to-peer (P2P) file-sharing applications are becoming increasingly popular and account for more than 70% of the Internet's bandwidth usage. Measurement studies show that a typical download of a file can take from minutes up to several hours depending on the level of network congestion or the service capacity fluctuation. In this paper, we consider two major factors that have significant impact on average download time, namely, the spatial heterogeneity of service capacities in different source peers and the temporal fluctuation in service capacity of a single source peer. We point out that the common approach of analyzing the average download time based on average service capacity is fundamentally flawed. We rigorously prove that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks and then analyze a simple, distributed algorithm to effectively remove these negative factors, thus minimizing the average download time. We show through analysis and simulations that it outperforms most of other algorithms currently used in practice under various network configurations.

show abstract

“…The average service capacity of the network, Ĉ is given by Ĉ = ∑ Intuitively, the average download time, T, for a file of size F would be T = F/Ĉ. (1) In reality, however, (1) is far different from the true average download time for each user in the network. The two main reasons to cause the difference are (i) the spatial heterogeneity in the available service capacities of different end-to-end paths and (ii) the temporal correlations in the service capacity of a given source peer.…”

Section: Limitations Of Average Service Capacitymentioning

confidence: 99%

Analysis of Distributed Algorithms to Remove Correlations for Reducing Average Download Time in Peer-to-Peer Networks

Satheesh¹,

Srinivas²,

Narayana³

2012

IJCA

View full text Add to dashboard Cite

The Peer-to-Peer (P2P) networks are widely used for internet file sharing. In general the file download can take minutes or hours depending on the level of network congestion or the service capacity fluctuations. In this paper, we consider two major factors that have significant impact on average download time, namely, the spatial heterogeneity of service capacities in different source peers and the temporal fluctuations in service capacities of a single source peer. We show that both spatial heterogeneity and temporal correlations in service capacity increase the average download time in P2P networks and then analyze a simple, distributed algorithm to reduce the file download time. Here, we analyzes a new algorithms called that effectively remove the negative factors of the existing systems i.e. Parallel downloading, Chunk based switching, periodic switching, thus reduce the average download time. Our algorithm removes correlations in the capacity fluctuations and the heterogeneity in space, thus greatly reducing the average download time. General TermsNetwork performance, spatial heterogeneity, average download time, Peers.

show abstract

Minimizing File Download Time over Stochastic Channels in Peer-to-Peer Networks

Cited by 11 publications

References 14 publications

On the Performance of Content Delivery under Competition in a Stochastic Unstructured Peer-to-Peer Network

On the Performance of Content Delivery under Competition in a Stochastic Unstructured Peer-to-Peer Network

Minimizing File Download Time in Stochastic Peer-to-Peer Networks

Analysis of Distributed Algorithms to Remove Correlations for Reducing Average Download Time in Peer-to-Peer Networks

Contact Info

Product

Resources

About