A cost-optimized dynamic group peering mechanism in P2P gridP2P 그리드에서의 최적비용 기반 동적 그룹 구성 기법에 관한 연구

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 439
  • Download : 0
DC FieldValueLanguage
dc.contributor.advisorYoun, Chan-Hyun-
dc.contributor.advisor윤찬현-
dc.contributor.authorMoon, Yong-Hyuk-
dc.contributor.author문용혁-
dc.date.accessioned2011-12-30-
dc.date.available2011-12-30-
dc.date.issued2006-
dc.identifier.urihttp://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=392622&flag=dissertation-
dc.identifier.urihttp://hdl.handle.net/10203/55442-
dc.description학위논문(석사) - 한국정보통신대학교 : 공학부, 2006, [ vii, 78 p. ]-
dc.description.abstractWith the increasing number of computers on the Internet, there is a growing interest in harnessing the unused and inexpensive computational resources over the Internet. However, current approaches such as the Grid computing paradigm are not sufficient. We present our research work that uses extends of Peer-to-Peer (P2P) computing with a framework that allows Grid computing over the Internet. Our study describes important considerations to the design of P2P Grid computing system based on redundant group peer concept. Moreover, we introduce the detailed system architecture which is designed in order to provide some enhancement points with respect to Grid service reliability through the proposed scheme and algorithm. Currently, there are many system requirements to guarantee the scalability, fault-tolerance, and high performance in the rapidly evolving research fields such as Grid and P2P technologies. Due to the dynamic nature of the Grid computing and P2P in networks, the behavior of system might be very unpredictable in respect of reliability. As the first step, we make a probabilistic model for system reliability in redundant group peer based P2P Grid. With the considerations to system cost and adjusted redundancy level of group peer, we can obtain optimum level of group peer and reduce the instability of system (Redundancy Optimization). The estimation of system load is the second step to indicate current status of a particular system for example system utilization, availability, and instability. With analytical model for load distribution, we determine the SLA-constrained load scheduling policy (SCLSP) in order to fairly schedule and distribute offered load among group peers and resources. Thus we can reduce the execution time and loss rate of loads need to be handled by computing elements. Finally through the theoretical analysis and simulation, we found that SCLSP has quite good performance comparing with existing algorithm such as RLB (Random Load B...eng
dc.languageeng-
dc.publisher한국정보통신대학교-
dc.subjectRedundancy System Optimization-
dc.subjectReliability Analysis-
dc.subjectPeer-to-Peer-
dc.subjectGrid Computing-
dc.subjectLoad Scheduling Policy-
dc.subject로드 스케줄링 정책-
dc.subject잉여 시스템 최적화-
dc.subject신뢰성 분석-
dc.subject피어투피어-
dc.subject그리드 컴퓨팅-
dc.titleA cost-optimized dynamic group peering mechanism in P2P grid-
dc.title.alternativeP2P 그리드에서의 최적비용 기반 동적 그룹 구성 기법에 관한 연구-
dc.typeThesis(Master)-
dc.identifier.CNRN392622/225023-
dc.description.department한국정보통신대학교 : 공학부, -
dc.identifier.uid020044593-
dc.contributor.localauthorYoun, Chan-Hyun-
dc.contributor.localauthor윤찬현-
Appears in Collection
School of Engineering-Theses_Master(공학부 석사논문)
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