Journal of the Korea Society of Computer and Information (한국컴퓨터정보학회논문지)

Korean Society of Computer Information (한국컴퓨터정보학회)
권호 표지
DOI QR코드

DOI QR Code

False Data Reduction Strategy for P2P Environment

P2P 환경을 위한 허위 데이터 감축 정책

  • Kim, Seung-Yun (Samsung Electronics ICAD Group, CAE Team, Semiconductor R&D Center) ;
  • Lee, Won-Joo (Dept. of Computer Science, Inha Technical College) ;
  • Jeon, Chang-Ho (School of Electrical and Computer Engineering, Hanyang University)
  • 김승연 (삼성전자반도체 연구소 CAE Team ICAD Group) ;
  • 이원주 (인하공업전문대학 컴퓨터정보과) ;
  • 전창호 (한양대 전자컴퓨터공학부)
  • Received : 2011.02.07
  • Accepted : 2011.02.21
  • Published : 2011.05.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we propose a FDR(False Data Reduction) strategy for P2P environment that reduces false data. The key idea of our strategy is that we use FDR algorithm to stop transmitting of false data and to delete that. If a user recognizes false data in downloaded-data and the user's peer requests the others to stop the transmission of the false data immediately. Also, the FDR algorithm notifies the other peers to prohibit spreading of the false data in the environment. All this procedure is possible to be executed in each peer without any lookup server. The FDR algorithm needs only a little data exchange among peers. Through simulation, we show that it is more effective to reduce the network traffic than the previous P2P strategy. We also show that the proposed strategy improves the performance of network compared to previous P2P strategy. As a result, The FDR strategy is decreased 9.78 ~ 16.84% of mean true data transmission time.

본 논문에서는 P2P 환경에서 허위 데이터를 감축할 수 있는 FDR(False Data Reduction) 정책을 제안한다. 이 정책의 특징은 사용자가허위 데이터를 인지하게 되면 그 파일을 다운로드중인 다른 피어 들에게 그 데이터 삭제를 요청한다. 또한 허위 데이터를 다운로드 중인 피어 들에게 이를 통보함으로써 허위 데이터를 다운로드하지 않도록 하고, P2P환경에 퍼지지 않도록 허위 데이터를 삭제한다. 또한 이러한 모든 과정은 어떠한 검색 서버도 요구되지 않고 오직 피어들 간에 정보 교환으로 이루어지기 때문에 검색 서버가 필요하지 않은 순수 P2P모델에 적용할 수 있다는 장점이 있다. 본 논문에서는 시뮬레이션을 통하여 FDR 정책이 네트워크 트래픽을 줄이는데 효과적임을 보인다. 임으로써 유효 데이터의 평균전송시간을 단축할 수 있음을 보인다. 그 결과 허위 데이터 비율에 따른 유효 데이터의 평균전송시간을 9.78~16.84% 단축함을 알 수 있었다.

Keywords

References

  1. Young-Jin Kim, Young Ik Eom, "Discovery Mechanisms for P2P Computing Environments," Communications of Korean Institute of Information Scientists and Engineers, Vol. 22, No. 3, pp. 6-17, Mar. 2004.
  2. Lan Quan, Kyung Geun Lee, "File Sharing in Unstructured Peer-to-Peer Net works," Communications of Korean Institute of Information Scientists and Engineers, Vol. 22, No. 3, pp. 35-44, Mar. 2004.
  3. Minho Shin, William A. Arbaugh, "Efficient Peer-to-Peer Lookup in Multi-hop Wireless Networks," KSII Transactions on Internet and Information Systems, Vol. 3, No. 1, pp. 5-25, Feb. 2009. https://doi.org/10.3837/tiis.2009.01.001
  4. Sang Won Oh, Won Joo Lee, Chang Ho Jeon, "An Efficient Peer-to-Peer Based Replication Strategy for Data Grid," Journal of the Institute Electronics Engineers of Korea, Vol. 45, Computer and Information, No. 2, pp. 10-17, Mar. 2008.
  5. http://www.napster.com/
  6. Ripeanu, M., "Peer-to-peer architecture case study: Gnutella network," Peer-to-Peer Computing, 2001. Proceedings First International Conference on 27-29 Aug. 2001.
  7. http://soribada.com/
  8. http://www.edonkey2000.com/
  9. Dreamtech Software Team "Cracking the Code : Peer to Peer Application Development," 2001 Hungry Minds Inc.
  10. http://messenger.msn.com/
  11. http://www.icq.com/
  12. Clarke, I., Sandberg, O., Wiley, B., and Hong, T.W., "Freenet: A distributed anonymous information storage and retrieval system," in International Workshop on Designing Privacy Enhancing Technologies, Berkeley, CA. Springer-verlag, Heidelberg, 2000.
  13. http://www.pruna.com/