Load-Balanced and Sybil-Resilient File Search in P2P Networks

  • Hyeong S. Kim
  • Eunjin (EJ) Jung
  • Heon Y. Yeom
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5401)


We present a file search algorithm that is not only Sybil-resilient, but also load-balanced among users. We evaluate our algorithm in terms of bandwidth consumption and the likelihood of bad downloads. In both metrics, our algorithms show balanced overhead among users and small chances of bad download with low bandwidth consumption.


File sharing peer-to-peer networks Sybil attack load balancing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Schulze, H., Mochalski, K.: iPoque internet study (2007),
  2. 2.
    Kamvar, S.D., Scholosser, M.T., Garcia-Molina, H.: The eigenTrust algorithm for reputation management in p2p networks. In: Proceedings of the 12th international conference on World Wide Web. ACM Press, New York (2003)Google Scholar
  3. 3.
    Douceur, J.: The sybil attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Yu, H., Kaminsky, M., Gibbons, P.B., Flaxman, A.: SybilGuard: Defending against sybil attacks via social networks. In: ACM SIGCOMM (2006)Google Scholar
  5. 5.
    Schlosser, M.T., Condie, T.E., Kamvar, S.D.: Simulating a file-sharing p2p network. In: Proceedings of Workshop in Semantics in Peer-to-Peer and Grid computing (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Hyeong S. Kim
    • 1
  • Eunjin (EJ) Jung
    • 2
  • Heon Y. Yeom
    • 1
  1. 1.School of Computer Science and EngineeringSeoul National UniversitySeoulKorea
  2. 2.Department of Computer ScienceUniversity of IowaIowa CityUSA

Personalised recommendations