Can Heterogeneity Make Gnutella Scalable? (2002)
Cached
Download Links
- [www.icir.org]
- [www.cs.kent.edu]
- [www.cs.princeton.edu]
- [www.cs.rice.edu]
- [www.cs.wisc.edu]
- [berkeley.intel-research.net]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the first International Workshop on Peer-to-Peer Systems |
| Citations: | 94 - 1 self |
BibTeX
@INPROCEEDINGS{Lv02canheterogeneity,
author = {Qin Lv and Sylvia Ratnasamy and Scott Shenker},
title = {Can Heterogeneity Make Gnutella Scalable?},
booktitle = {In Proceedings of the first International Workshop on Peer-to-Peer Systems},
year = {2002},
pages = {94--103}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
this paper, we assume that c i denotes the maximum number of messages node i is willing/able to process over a given time interval T . A node i is connected, at the application-level, to a set of neighbor nodes, denoted nbr(i). For each of j 2 nbr(i) a node i maintains the following information: in[j; i]: the number of incoming messages from node j to i in the last time interval T . Every node i reports its total incoming rate (in[; i] = j2nbr(i) in[j; i]) to all its neighbors
