On fairness, optimal download performance and proportional replication in peer-to-peer networks

19Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Each peer in a peer-to-peer network, by definition, is both a consumer and a provider of the service. As a consumer, a peer wants to obtain its objects of interest as quickly as possible. However, as a service provider, the peer wants to serve no more than an equitable portion of the total workload. Our first observation in this paper is that if one satisfies the latter criterion of fairness in workload distribution, then one also minimizes the average download time when the delay at the server is convex in the utilization factor of the server. We had previously observed that controlled flooding search in unstructured networks is optimized when the number of replicas of a file is proportional to the request rate for that file. Here we show that such a replica distribution also ensures fairness in the workload distribution and, at the same time, minimizes the average download time seen by a download request. © IFIP International Federation for Information Processing 2005.

Cite

CITATION STYLE

APA

Tewari, S., & Kleinrock, L. (2005). On fairness, optimal download performance and proportional replication in peer-to-peer networks. In Lecture Notes in Computer Science (Vol. 3462, pp. 709–717). Springer Verlag. https://doi.org/10.1007/11422778_57

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free