
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
HungChang Hsiao, Hao Liao, ChengChyun Huang, "Resolving the Topology Mismatch Problem in Unstructured PeertoPeer Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 11, pp. 16681681, November, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2009.24, author = {HungChang Hsiao and Hao Liao and ChengChyun Huang}, title = {Resolving the Topology Mismatch Problem in Unstructured PeertoPeer Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {11}, issn = {10459219}, year = {2009}, pages = {16681681}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.24}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Resolving the Topology Mismatch Problem in Unstructured PeertoPeer Networks IS  11 SN  10459219 SP1668 EP1681 EPD  16681681 A1  HungChang Hsiao, A1  Hao Liao, A1  ChengChyun Huang, PY  2009 KW  Unstructured peertopeer systems KW  Gnutella KW  topology mismatch KW  location awareness. VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A Scalable ContentAddressable Network,” Proc. ACM SIGCOMM, pp. 161172, Aug. 2001.
[2] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, “Chord: A Scalable PeertoPeer Lookup Service for Internet Applications,” Proc. ACM SIGCOMM, pp. 149160, Aug. 2001.
[3] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for LargeScale PeertoPeer Systems,” Lecture Notes in Computer Science (LNCS), vol. 2218, pp. 161172, Nov. 2001.
[4] B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J.D. Kubiatowicz, “Tapestry: A Resilient GlobalScale Overlay for Service Deployment,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 4153, Jan. 2004.
[5] Gnutella, http://rfcgnutella.sourceforge.net, 2009.
[6] M. Ripeanu, I. Foster, and A. Iamnitchi, “Mapping the Gnutella Network,” IEEE Internet Computing, vol. 6, no. 1, pp. 5057, Jan./Feb. 2002.
[7] S. Sen and J. Wang, “Analyzing PeertoPeer Traffic across Large Networks,” IEEE/ACM Trans. Networking, vol. 12, no. 2, pp. 219232, Apr. 2004.
[8] Y. Liu, “A TwoHop Solution to Solving Topology Mismatch,” IEEE Trans. Parallel Distribution Systems, vol. 19, no. 11, pp. 15911600, Nov. 2008.
[9] Y. Liu, L. Xiao, X. Liu, L.M. Ni, and X. Zhang, “Location Awareness in Unstructured PeertoPeer Systems,” IEEE Trans. Parallel Distributed Systems, vol. 12, no. 2, pp. 163174, Feb. 2005.
[10] Y. Liu, L. Xiao, and L.M. Ni, “Building a Scalable Bipartite P2P Overlay Network,” IEEE Trans. Parallel Distributed Systems, vol. 18, no. 9, pp. 12961306, Sept. 2007.
[11] C. Law and K.Y. Siu, “Distributed Construction of Random Expander Networks,” Proc. IEEE INFOCOM, pp. 21332143, Mar. 2003.
[12] G. Pandurangan, P. Raghavan, and E. Upfal, “Building LowDiameter PeertoPeer Networks,” IEEE J. Selected Areas in Comm., vol. 21, no. 6, pp. 9951002, Aug. 2003.
[13] M.K. Reiter, A. Samar, and C. Wang, “Distributed Construction of a FaultTolerant Network from a Tree,” Proc. 24th IEEE Symp. Reliable Distributed Systems (SRDS '05), pp. 155165, Oct. 2005.
[14] X. Zhang, Q. Zhang, Z. Zhang, G. Song, and W. Zhu, “A Construction of LocalityAware Overlay Network: mOverlay and Its Performance,” IEEE J. Selected Areas in Comm., vol. 18, no. 28, pp. 9951002, Jan. 2004.
[15] B. Bollobás, Random Graphs, second ed. Cambridge Univ. Press, 2001.
[16] B. Bollobás and W.F. de la Vega, “The Diameter of Random Regular Graphs,” Combinatorica, vol. 2, no. 2, pp. 125134, June 1982.
[17] J.M. Kleinberg, “The SmallWorld Phenomenon: An Algorithm Perspective,” Proc. 32nd ACM Ann. Symp. Theory Computing (STOC '00), pp. 163170, May 2000.
[18] S. Milgram, “The SmallWorld Problem,” Psychology Today, vol. 2, pp. 6067, 1967.
[19] D.J. Watts and S.H. Strogatz, “Collective Dynamics of SmallWorld Networks,” Nature, vol. 393, pp. 440442, June 1998.
[20] S. Merugu, S. Srinivasan, and E. Zegura, “Adding Structure to Unstructured PeertoPeer Networks: The Use of SmallWorld Graphs,” J. Parallel and Distributed Computing, vol. 65, no. 2, pp.142153, Feb. 2005.
[21] Y.K. Hui, C.S. Lui, and K.Y. Yau, “SmallWorld Overlay P2P Networks: Construction and Handling Dynamic Flash Crowd,” Computer Networks, vol. 50, no. 15, pp. 27272746, Oct. 2006.
[22] S. Wang, D. Xuan, and W. Zhao, “Analyzing and Enhancing the Resilience of Structured PeertoPeer Systems,” J. Parallel Distributed Computing, vol. 65, no. 2, pp. 207219, Feb. 2005.
[23] L. Xiao, Y. Liu, and L.M. Ni, “Improving Unstructured PeertoPeer Systems by Adaptive Connection Establishment,” IEEE Trans. Computers, vol. 54, no. 9, pp. 10911103, Sept. 2005.
[24] S. Jiang, L. Guo, X. Zhang, and H. Wang, “LightFlood: Minimizing Redundant Messages and Maximizing Scope of PeertoPeer Search,” IEEE Trans. Parallel Distributed Systems, vol. 19, no. 5, pp. 601614, May 2008.
[25] T. Qiu, G. Chen, M. Ye, E. Chan, and B.Y. Zhao, “Towards LocationAware Topology in Both Unstructured and Structured P2P Systems,” Proc. 36th Int'l Conf. Parallel Processing (ICPP '07), Sept. 2007.
[26] L. Lovász, “Random Walks on Graphs: A Survey,” Combinatorics, Paul Erds Is Eighty, vol. 2, pp. 146, 1993.
[27] M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge Univ. Press, 2005.
[28] V. King and J. Saia, “Choosing a Random Peer,” Proc. 23rd ACM Symp. Principles Distributed Computing (PODC '03), pp. 125130, July 2004.
[29] M. Zhong, K. Shen, and J. Seiferas, “The ConvergenceGuaranteed Random Walk and Its Applications in PeertoPeer Networks,” IEEE Trans. Computers, vol. 57, no. 5, pp. 619633, May 2008.
[30] H. Zhang, A. Goel, and R. Govindan, “Improving Lookup Latency in Distributed Hash Table Systems Using Random Sampling,” IEEE/ACM Trans. Networking, vol. 13, no. 5, pp. 11211134, Oct. 2005.
[31] D.R. Karger and M. Ruhl, “Finding Nearest Neighbors in GrowthRestricted Metrics,” Proc. 34th ACM Ann. Symp. Theory of Computing (STOC '02), pp. 741750, May 2002.
[32] PlanetLab, http://www.planetlab.org, 2009.
[33] J.C. Chu, K.S. Labonte, and B.N. Levine, “Availability and Locality Measurements of PeertoPeer File Systems,” Proc. SPIE—ITCom Conf. Scalability and Traffic Control in IP Networks, pp. 310321, July 2002.
[34] S. Saroiu, P.K. Gummadi, and S.D. Gribble, “Measurement Study of PeertoPeer File Sharing Systems,” Proc. Ninth SPIE/ACM Conf. Multimedia Computing and Networking (MMCN '02), Jan. 2002.
[35] Napster, http:/www.napster.com/, 2009.
[36] K.P. Gummadi, R.J. Dunn, S. Saroiu, S.D. Gribble, H.M. Levy, and J. Zahorjan, “Measurement, Modeling, and Analysis of a PeertoPeer FileSharing Workload,” Proc. 19th ACM Symp. Operating Systems Principles (SOSP '03), pp. 314329, Oct. 2003.
[37] E. Aarts and J.K. Lenstra, Local Search in Combinatorial Optimization. Princeton Univ. Press, 2003.
[38] S. Jin and H. Jiang, “Novel Approaches to Efficient Flooding Search in PeertoPeer Networks,” Computer Networks, vol. 51, no. 10, pp. 28182832, July 2007.
[39] W. Aiello, F.R.K. Chung, and L. Lu, “A Random Graph Model for Massive Graphs,” Proc. 32nd ACM Ann. Symp. Theory of Computing (STOC '00), pp. 171180, May 2000.
[40] D. Stutzbach, “The Ion P2P Project: Empirical Characterizations of P2P Systems,” http://mirage.cs.uoregon.edu/P2Pinfo.cgi , 2009.