
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Ming Zhong, Kai Shen, Joel Seiferas, "The ConvergenceGuaranteed Random Walk and Its Applications in PeertoPeer Networks," IEEE Transactions on Computers, vol. 57, no. 5, pp. 619633, May, 2008.  
BibTex  x  
@article{ 10.1109/TC.2007.70837, author = {Ming Zhong and Kai Shen and Joel Seiferas}, title = {The ConvergenceGuaranteed Random Walk and Its Applications in PeertoPeer Networks}, journal ={IEEE Transactions on Computers}, volume = {57}, number = {5}, issn = {00189340}, year = {2008}, pages = {619633}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2007.70837}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  The ConvergenceGuaranteed Random Walk and Its Applications in PeertoPeer Networks IS  5 SN  00189340 SP619 EP633 EPD  619633 A1  Ming Zhong, A1  Kai Shen, A1  Joel Seiferas, PY  2008 KW  Distributed networks KW  Distributed applications KW  Distributed systems VL  57 JA  IEEE Transactions on Computers ER   
[1] L. Adamic, B. Huberman, R. Lukose, and A. Puniyani, “Search in Power Law Networks,” Physical Rev., vol. 64, pp. 4613546143, 2001.
[2] M. Adler, E. Halperin, R.M. Karp, and V. Vazirani, “A Stochastic Process on the Hypercube with Applications to PeertoPeer Networks,” Proc. 35th ACM Symp. Theory of Computing, pp. 575584, June 2003.
[3] Y. Azar, A. Broder, A. Karlin, N. Linial, and S. Phillips, “Biased Random Walks,” Proc. 24th ACM Symp. Theory of Computing, pp. 19, 1992.
[4] A. Barabási, Linked: How Everything Is Connected to Everything Else and What It Means. Plume, 2003.
[5] A. Barabási and R. Albert, “Emergence of Scaling in Random Networks,” Science, vol. 286, pp. 509512, 1999.
[6] A.R. Bharambe, M. Agrawal, and S. Seshan, “Mercury: Supporting Scalable MultiAttribute Range Queries,” Proc. ACM SIGCOMM '04, pp. 353366, Aug. 2004.
[7] B. Bollobás, Random Graphs. Academic Press, 1985.
[8] B. Bollobás and O. Riordan, “The Diameter of a ScaleFree Random Graph,” Combinatorica, vol. 24, no. 1, pp. 534, 2004.
[9] B. Bollobás, O. Riordan, J. Spencer, and G. Tusnady, “The Degree Sequence of a ScaleFree Random Graph Process,” Random Structures and Algorithms, vol. 18, no. 3, pp. 279290, 2001.
[10] Y. Chawathe, S. Ratnasamy, L. Breslau, N. Lanham, and S. Shenker, “Making GnutellaLike P2P Systems Scalable,” Proc. ACM SIGCOMM '03, Aug. 2003.
[11] E. Cohen and S. Shenker, “Replication Strategies in Unstructured PeertoPeer Networks,” Proc. ACM SIGCOMM '02, Aug. 2002.
[12] B.F. Cooper, “Quickly Routing Searches without Having to Move Content,” Proc. Fourth Int'l Workshop PeertoPeer Systems, Feb. 2005.
[13] P. Diaconis and D. Stroock, “Geometric Bounds for Eigenvalues of Markov Chains,” Annals of Applied Probability, vol. 1, pp. 3661, 1991.
[14] W. Doeblin, “Exposé de la Théorie des Chaînes Simples Constantes de Markov á un Nombre Fini d'États,” Mathématique de l'Union Interbalkanique, vol. 2, pp. 77105, 1938.
[15] P.T. Eugster, R. Guerraoui, S.B. Handurukande, P. Kouznetsov, and A.M. Kermarrec, “Lightweight Probabilistic Broadcast,” ACM Trans. Computer Systems, vol. 21, no. 4, pp. 341374, Nov. 2003.
[16] A.J. Ganesh, A. Kermarrec, and L. Massoulié, “SCAMP: PeertoPeer Lightweight Membership Service for LargeScale Group Communication,” Proc. Third Int'l Workshop Networked Group Comm., pp. 4455, Nov. 2001.
[17] C. Gkantsidis, M. Mihail, and A. Saberi, “Conductance and Congestion in Power Law Graphs,” Proc. ACM SIGMETRICS '03, pp. 148159, June 2003.
[18] C. Gkantsidis, M. Mihail, and A. Saberi, “Random Walks in PeertoPeer Networks,” Proc. IEEE INFOCOM '04, pp. 120130, Mar. 2004.
[19] C. Gkantsidis, M. Mihail, and A. Saberi, “Hybrid Search Schemes for Unstructured PeertoPeer Networks,” Proc. IEEE INFOCOM '05, pp. 15261537, Mar. 2005.
[20] C. Gkantsidis, M. Mihail, and E. Zegura, “The Markov Chain Simulation Method for Generating Connected Power Law Random Graphs,” Proc. Fifth Workshop Algorithm Eng. and Experiments, 2003.
[21] W.K. Hastings, “Monte Carlo Sampling Methods Using Markov Chains and Their Applications,” Biometrika, vol. 57, pp. 97109, 1970.
[22] M. Jelasity, R. Guerraoui, A. Kermarrec, and M.V. Steen, “The Peer Sampling Service: Experimental Evaluation of Unstructured GossipBased Implementations,” Proc. Fifth ACM/IFIP/Usenix Int'l Middleware Conf., 2004.
[23] D. Karger and M. Ruhl, “Simple Efficient Load Balancing Algorithms for PeertoPeer Systems,” Proc. 16th ACM Symp. Parallelism in Algorithms and Architectures, pp. 3643, June 2004.
[24] V. King and J. Saia, “Choosing a Random Peer,” Proc. 23rd ACM Symp. Principles of Distributed Computing, pp. 125130, 2004.
[25] D. Kostić, A. Rodriguez, J. Albrecht, A. Bhirud, and A. Vahdat, “Using Random Subsets to Build Scalable Network Services,” Proc. Fourth Usenix Symp. Internet Technologies and Systems, Mar. 2003.
[26] C. Law and K. Siu, “Distributed Construction of Random Expander Networks,” Proc. IEEE INFOCOM '03, pp. 21332143, Mar. 2003.
[27] D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, “GraphTheoretic Analysis of Structured PeertoPeer Systems: Routing Distances and Fault Resilience,” Proc. ACM SIGCOMM '03, pp. 395406, Aug. 2003.
[28] Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and Replication in Unstructured PeertoPeer Networks,” Proc. ACM Int'l Conf. Supercomputing, pp. 8495, June 2002.
[29] Q. Lv, S. Ratnasamy, and S. Shenker, “Can Heterogeneity Make Gnutella Scalable?” Proc. First Int'l Workshop PeertoPeer Systems, 2002.
[30] G.S. Manku, “Balanced Binary Trees for ID Management and Load Balance in Distributed Hash Tables,” Proc. 23rd ACM Symp. Principles of Distributed Computing, pp. 197205, July 2004.
[31] G.S. Manku, M. Naor, and U. Wieder, “Know Thy Neighbor's Neighbor: The Power of Lookahead in Randomized P2P Networks,” Proc. 36th ACM Symp. Theory of Computing, 2004.
[32] N. Metropolis, A.W. Rosenbluth, M.N. Rosenbluth, A.H. Teller, and E. Teller, “Equation of State Calculations by Fast Computing Machines,” J. Chemical Physics, vol. 21, pp. 10871092, 1953.
[33] Planetlab, http:/www.planetlab.org, 2008.
[34] A. Rao, K. Lakshminarayanan, S. Surana, R. Karp, and I. Stoica, “Load Balancing in Structured P2P Systems,” Proc. Second Int'l Workshop PeertoPeer Systems, Feb. 2003.
[35] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable ContentAddressable Network,” Proc. ACM SIGCOMM '01, pp. 161172, Aug. 2001.
[36] S. Rhea and J. Kubiatowicz, “Probabilistic Location and Routing,” Proc. IEEE INFOCOM '02, pp. 12481257, 2002.
[37] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for LargeScale PeertoPeer Systems,” Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms, pp. 329350, Nov. 2001.
[38] K. Shen, “Structure Management for Scalable Overlay Service Construction,” Proc. First Usenix/ACM Symp. Networked Systems Design and Implementation, pp. 281294, Mar. 2004.
[39] A. Sinclair, “Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow,” Combinatorics, Probability and Computing, vol. 1, pp. 351370, 1992.
[40] A. Sinclair and M. Jerrum, “Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains,” Information and Computation, vol. 82, pp. 93133, 1989.
[41] K. Sripanidkulchai, “The Popularity of Gnutella Queries and Its Implications on Scalability,” Proc. O'Reilly PeertoPeer and Web Services Conf., 2001.
[42] A.O. Stauffer and V.C. Barbosa, “Probabilistic Heuristics for Disseminating Information in Networks,” IEEE/ACM Trans. Networking, vol. 15, no. 2, pp. 425435, Apr. 2007.
[43] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable PeertoPeer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM '01, pp. 149160, Aug. 2001.
[44] D. Tsoumakos and N. Roussopoulos, “Adaptive Probabilistic Search for PeertoPeer Networks,” Proc. Third IEEE Int'l Conf. P2P Computing, 2003.
[45] X. Wang, Y. Zhang, X. Li, and D. Loguinov, “On ZoneBalancing of PeertoPeer Networks: Analysis of Random Node Join,” Proc. ACM SIGMETRICS '04, June 2004.
[46] B. Yang and H. GarciaMolina, “Improving Search in PeertoPeer Networks,” Proc. 22nd Int'l Conf. Distributed Computing Systems, pp. 514, July 2002.
[47] M. Zhong, K. Shen, and J. Seiferas, “Dynamic Load Balancing in Unstructured PeertoPeer Networks: Finding Hotspots, Eliminating Them,” unpublished manuscript, http://www.cs.rochester. edu/u/zhong/papers hotspots.pdf, May 2007.