Browse > Article

A Scalable Resource-Lookup Protocol for Internet File System Considering the Computing Power of a Peer  

Jung Il-dong (LG전자 DAC연구소)
You Young-ho (부산대학교 컴퓨터및정보통신연구소)
Lee Jong-hwan (오토파워 부설연구소)
Kim Kyongsok (부산대학교 전자전기정보컴퓨터공학부)
Publication Information
Journal of KIISE:Information Networking / v.32, no.1, 2005 , pp. 89-99 More about this Journal
Abstract
Advances of Internet and rC accelerate distribution and sharing of information, which make P2P(Peer-to-Peer) computing paradigm appear P2P computing Paradigm is the computing paradigm that shares computing resources and services between users directly. A fundamental problem that confronts Peer-to-Peer applications is the efficient location of the node that stoles a desired item. P2P systems treat the majority of their components as equivalent. This purist philosophy is useful from an academic standpoint, since it simplifies algorithmic analysis. In reality, however, some peers are more equal than others. We propose the P2P protocol considering differences of capabilities of computers, which is ignored in previous researches. And we examine the possibility and applications of the protocol. Simulating the Magic Square, we estimate the performances of the protocol with the number of hop and network round time. Finally, we analyze the performance of the protocol with the numerical formula. We call our p2p protocol the Magic Square. Although the numbers that magic square contains have no meaning, the sum of the numbers in magic square is same in each row, column, and main diagonal. The design goals of our p2p protocol are similar query response time and query path length between request peer and response peer, although the network information stored in each peer is not important.
Keywords
P2P; Internet computing; Internet File System;
Citations & Related Records
연도 인용수 순위
  • Reference
1 C. Shirky, 'What is P2P... and what Isn't,' http://www.openp2p.comlpub/a/472
2 I. Stoica, R. Morris, D.Liben-Nowell, D. R. Karger, M. Frans Kaashoek, F. Dabek, H. Balakrshinan, 'Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,' IEEE/ACM Transactions on Networking, Vol. 11, Feb 2003   DOI   ScienceOn
3 R. Wolski, 'Experiences with predicting resource performance on-line in computational grid settings,' ACM SIGMETRICS Performance Evaluation Review, Vol. 30 Issue 4, Mar. 2003   DOI
4 J. Kubiatowicz. 'Extracting Guarantees from Chaos,' Communications of the ACM Vol. 46, Feb 2003   DOI   ScienceOn
5 C. A. Lee, J. Stepanek, R. Wolski, C. Kesslman, 1. Foster. 'A Network Performance Tool for Grid Environments,' Proceedings of the 1999 ACM/IEEE conference on Supercomputing, Jan 1999   DOI
6 S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Shenker. 'A Scalable Content-Addressable Network.' Proceedings of ACM SIGCOMM, Aug. 2001
7 H. Balakrishnan, M. F. Kaashoek, D. Karger, R. Morris, I. Stoica, 'Looking Up Data in P2P Systems,' Communications of the ACM Vol. 46, Feb 2003   DOI   ScienceOn
8 William Pugh. 'Skip Lists: A Probabilistic Alternative to Balanced Trees,' Communications of the ACM, Vol. 33, Jun 1990   DOI
9 A. Rowstron, P. Druschel, 'Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,' Proceedings of the 18th IFIP/ ACM Int'l Conf. on distributed Systems Platforms, Nov. 2001
10 V. A. Mesaros, B. Carton, P. V. Roy, 'S-Chord: Using Symmerty to Improve Lookup Efficiency in Chord,' Proceedings of PDPTA03, Jun 2003
11 A. Oram, 'Peer-to-Peer,' O'Reilly, Mar, 2001
12 ThinkStream, 'A Technical Review of the Next Generation Internet Architecture.'