2003 · 32 citations · 9 references
ComputingComputer ScienceComputer SystemsComputer NetworksDigital CommunicationProbability TheoryCommunication NetworksNetwork Performance AnalysisNetwork ProtocolsPeer-to-peer NetworkingPeer-to-peer NetworksPeer-to-peer SystemsComputer Simulation FrameworksExponential GrowthLower Bound ComputationPeer-to-peer Protocols
Recently peer-to-peer (P2P) configurations have found considerable interest in the Internet community. At the same time P2P has often been criticized for poor scaling behavior. We analyze P2P signaling traffic, both via analytic estimates and via computer simulation. With the help of two probabilistic approaches, we can derive an upper as well as a lower bound for the growth of P2P-signaling traffic, according to a pure peer-to-peer protocol as given e.g. in the Gnutella protocol. With the help of a simulation we are able to verify our mathematical derivations. As a result it appears, that P2P actually scales much better than predicted by more conventional theory relying on simplifying assumptions, and thus exponential growth of the messaging load in pure peer-to-peer networks must not be assumed.
9
Emergence of Scaling in Random Networks
Albert-Ĺaszló Barabási, Réka Albert · Science · 1999 · 36.4K citations · Full text
Ion Stoica, Robert Morris, David R. Karger et al. · 2001 · 9.7K citations
Eytan Adar, Bernardo A. Huberman · First Monday · 2000 · 1.5K citations · Full text