The KIPS Transactions:PartC (정보처리학회논문지C)

Korea Information Processing Society (한국정보처리학회)
권호 표지
DOI QR코드

DOI QR Code

Optimal Number of Super-peers in Clustered P2P Networks

클러스터 P2P 네트워크에서의 최적 슈퍼피어 개수

  • 김성희 (삼성전자 정보통신총괄 통신연구소 차세대단말팀) ;
  • 김주균 (숙명여자대학교 정보과학부 컴퓨터과학) ;
  • 이상규 (숙명여자대학교 정보과학부 컴퓨터과학) ;
  • 이준수 (숙명여자대학교 정보과학부 컴퓨터과학)
  • Published : 2006.08.01
Download PDF
⟨ Previous Next ⟩

Abstract

In a super-peer based P2P network, The network is clustered and each cluster is managed by a special peer, called a super-peer which has information of all peers in its cluster. This clustered P2P model is known to have efficient information search and less traffic load. In this paper, we first estimate the message traffic cost caused by peer's query, join and update actions within a cluster as well as between the clusters and with these values, we present the optimal number of super-peers that minimizes the traffic cost for the various size of super-peer based P2P networks.rks.

슈퍼피어 기반 P2P 네트워크는 전체 네트워크를 여러 개의 작은 서브 네트워크로 클러스터링하고 각 클러스터를 해당 그룹에 속한 노드들에 대한 정보를 가지고 있는 슈퍼피어라는 특정 노드가 관리하는 네트워크 모델로써 검색의 효율성과 네트워크 부하가 적다는 이점을 가지고 있다. 본 논문은 슈퍼피어기반 P2P네트워크에서 먼저 피어들의 정보검색, 새로운 노드 가입, 정보갱신 동의 동작으로 발생하는 메시지의 양을 기반으로 한 트래픽 비용을 클러스터 내의 비용과 슈퍼피어 간의 비용으로 측정하고, 이 두 비용을 바탕으로 다양한 네트워크 크기에 따라 트래픽 비용을 최소화할 수 있는 슈퍼피어의 개수를 제시한다.

Keywords

References

  1. R.Schollmeier. 'A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications,' Proc.IEEE Conference P2P 2001, Linkoping Sweden. August, 2001 https://doi.org/10.1109/P2P.2001.990434
  2. 김영진, 엄영익, 'P2P 컴퓨팅 환경 기반의 디스커버리 기법', 정보과학회지, Vol.22, pp6-7, March, 2004
  3. D.S. Milojicic, 'Peer-to-Peer Computing,' HP Technical Report, HP Labora-to-ries, March, 2002
  4. Napster. http://www.napster.com
  5. D. Tsoumakos and N. Roussopoulos, 'Adaptive Probabilistic Search for Peer-to-Peer Networks,' Proc. of the 3rd IEEE International Conference on P2P Computing, September, 2003
  6. Gnutella, www.gnutella.com
  7. I.Clarke, O. Sandberg, B.Wiley, and T, Hong. 'Freenet: A Distributed Anonymous Information Storage and Retrieval System' Lecture Notes in Computer Science, 2009:46-66, 2001 https://doi.org/10.1007/3-540-44702-4_4
  8. S.Androutsellis-Theotokis, 'A survey of peer-to-peer file sharing technologies,' Technical Report WHP-2002-03, Athens Univ.of Economics and Business, 2002
  9. U. Wieder, M.Dahlin, 'A Simple Fault tolerant distributed Hash Table', IPTPS 2003, Berkeley CA, Feburary, 2003
  10. A Rowstron and P. Druschel, 'Pastry: Scalable, Distributed object location and routing for large-scale peer-to-peer systems,' Proc. IFIP/ACM International Conference on Distributed Systems Platforms, November, 2001
  11. B.Zhao, J.Kubiatowicz, and A.Joseph, 'Tapestry: An infrastructure for fault-tolerant wide-area loation and routing,' Technical Report UCB/CSD-0l-1141, Computer Science Division, Univ. of California, Berkeley, April, 2001
  12. S.Ratnasamy, P.Francis, M.Handley, R.Karp, and S.Shenker, 'A Scalable content-addressable network,' Proc. of ACM SIGCOMM, 2001
  13. I.Stoca, R.Morris, D. Karger, F.Kaashoer and H. Balakrishnan, 'Chord: A scalable peer-to-per lookup service for Internet application,' in Proc. ACM SIGCOMM 2001
  14. Kwangwook Shin, Seunghak Lee, Geunhwi Lim, H.Yoon, Joong Soo Ma, 'Grapes : Topology-based Hierachical Virtual Network for Peer-to-peer Lookup Services,' In Proceeding of the International Conference Parallel Processing Workshops, 2002 https://doi.org/10.1109/ICPPW.2002.1039726
  15. B.Yang, H.Garcia-Molina, 'Designing a Super-Peer Network,' Proc. of IEEE International Conference on Distributed Computing Systems (ICDCS), 2002
  16. A.T.Mizrak, Y.Cheng, V.Kumar, and S.Savage 'Structured Superpeers: Leveraging Heterogeneity to Provide Constant-Time Lookup,' Computer Science and Engineering Division, Unv. of California, San Diego, 2003
  17. S.Jain, R.Mahajan, D.Wetherall, and G.Borriello, 'Scalable Self-Organizing Overlays,' Computer Science and Engineering Division, Unv. of Washington, 2001