Behavior-aware p2p protocol for high data availability높은 데이터 유효성을 보장하기 위한 행동-인지 피어-투-피어 프로토콜

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 472
  • Download : 0
A lot of research papers discussed the Distributed Hash Table (DHT) based p2p systems to promise that idle resources may be efficiently harvested. However, p2p systems are composed of components with extremely heterogeneous availabilities and to handle churn, the system will generate the heavy information maintenance traffic to keep the efficiency of the DHT. Moreover, the previous researches concentrate on the efficient lookup of the p2p system and they fails to keep high data availability effectively. This dissertation presents the behavior-aware p2p protocol for high data availability. By using this protocol, the p2p system can reduce the overhead by exploiting the heterogeneous behavior of participant nodes efficiently. Unlike the DHT based p2p which use the static nodeID which is obtained by wellbalanced hashing function, the behavior-aware p2p ignores this static nodeID and uses the dynamic nodeID. This dynamic nodeID is composed of the Load Balanced ID which balance the loads of the reliable and powerful nodes and the Load Free ID which reduce the responsibility of normal and weak nodes and eliminate the compulsory maintenance overhead when the churn of them occurs. The assignment of nodeID performs without any central management server. The new nodeID is assigned according to the current network state and the node which processes the join message. After assigning the new nodeID, this nodeID of a node changes on the fly according to its behavior on the p2p system. Finally, every node gets its proper nodeID with its characteristics and each nodes takes the different responsibility in accordance with its nodeID to support p2p system effectively. The reliable and powerful nodes mainly guarantee the data availability and the correctness of lookup. The normal and weak nodes assist them and the churn of them can not harm the data availability and the efficiency of the lookup. I examine the efficiency of behavior-aware p2p via a event driven simulation...
Advisors
Park, Dae-Yeonresearcher박대연researcher
Description
한국과학기술원 : 전기및전자공학전공,
Publisher
한국과학기술원
Issue Date
2007
Identifier
263495/325007  / 020015030
Language
eng
Description

학위논문(박사) - 한국과학기술원 : 전기및전자공학전공, 2007.2, [ ix, 74 p. ]

Keywords

Node Heterogeneity; Data availability; Peer-to-Peer; Data Replication; 데이터 복제; 노드 다양성; 데이터 유효성; 피어투피어

URI
http://hdl.handle.net/10203/35392
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=263495&flag=dissertation
Appears in Collection
EE-Theses_Ph.D.(박사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0