Browse > Article
http://dx.doi.org/10.6109/jkiice.2007.11.8.1535

Object Replication Methods for High Availability in DHT based P2P Computing System  

Son, Young-Sung (한국전자통신연구원 디지털홈연구단)
Jung, Il-Dong (LG전자 디지털플라이언스 사업본부 연구소)
Kim, Kyong-Sok (부산대학교 컴퓨터공학과)
Abstract
Recently, there are many researches for P2P network. P2P network technologies are a good solution about making a wide spread distributed computing in the internet environment. The recent algorithms developed by several research groups for the lookup problem present a simple and general interface, a distributed hash table (DHT). In this paper, we also introduce new schemes that enhance the available rate of an object in the MagicSquare network. Replication scheme is to replicate an object with many replicas and save them to several nodes. Fragmentation scheme is to divide an object into several fragments and save them to several nodes. Replicated Fragmentation scheme is to mix replication scheme and fragmentation scheme. We will show result of simulation for our the proposed scheme.
Keywords
P2P 네트워크;분산 해쉬 테이블;유비쿼터스 네트워크;
Citations & Related Records
연도 인용수 순위
  • Reference
1 William Pugh, 'Skip Lists: A Probabilistic Alternative to Balanced Trees', Communications of the ACM, Vol. 33, Jun 1990
2 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
3 A. Oram, 'Peer-to-Peer', O'Reilly, Mar, 2001
4 ThinkStream, 'A Technical Review of the Next Generation Internet Architecture'
5 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 2001
6 C. Shirky, 'What is PZP... and what Isn't', http://www.openp2p.com/pub/a/472