B. Yang and H. Garcia-Molina. Improving efficiency of p2p search. In Proceedings of the 28th Conference on Distributed Computing Systems, July 2002.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Simulating a P2P File-Sharing Network - Schlosser, Condie, Kamvar (2002) (Correct)
....is a daunting task. In some cases, measurements are easier to carry out due to some easily accessible central control entity in the network that manages node joins and departures [14] Also, some algorithms may be tested by deploying them on one or a few controlled nodes in the network (as in [15]) However, for a wide range of P2P related algorithms and protocols, simply deploying and testing them on existing P2P networks is not possible. For example, most algorithms require each peer in the network to implement the algorithm. Today s popular peer to peer networks [5] have over 20,000 ....
B. Yang and H. Garcia-Molina. Improving efficiency of p2p search. In Proceedings of the 28th Conference on Distributed Computing Systems, July 2002.
Simulating a P2P File-Sharing Network - Schlosser, Kamvar (2002) (Correct)
....is a daunting task. In some cases, measurements are easier to carry out due to some easily accessible central control entity in the network that manages node joins and departures [14] Also, some algorithms may be tested by deploying them on one or a few controlled nodes in the network (as in [15]) However, for a wide range of P2P related algorithms and protocols, simply deploying and testing them on existing P2P networks is not possible. For example, most algorithms require each peer in the network to implement the algorithm. Today s popular peer to peer networks [5] have over 20,000 ....
B. Yang and H. Garcia-Molina. Improving efficiency of p2p search. In Proceedings of the 28th Conference on Distributed Computing Systems, July 2002.
Simulating A File-Sharing P2P Network - Schlosser, Kamvar (Correct)
....task. In some cases, measurements are easier to carry out due to some easily accessible central control entity in the network which, for example, manages node joins and departures [14] Also, some algorithms may be tested by deploying them on one or a few controlled nodes in the network (as in [15]) However, for a wide range of P2P related algorithms and protocols, simply deploying and testing them on existing P2P networks is not possible. For example, most algorithms require each peer in the network to implement the algorithm. Today s popular peer to peer networks [6] have over 20,000 ....
B. Yang and H. Garcia-Molina. Improving Efficiency of P2P Search. In Proceedings of the 28th Confi, rence on Distributed Computing Systems, July 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC