DC Field | Value | Language |
---|---|---|
dc.contributor.author | Moon, Yong-Hyuk | ko |
dc.contributor.author | Kim, Byung-Sang | ko |
dc.contributor.author | Youn, Chan-Hyun | ko |
dc.date.accessioned | 2013-03-07T22:39:06Z | - |
dc.date.available | 2013-03-07T22:39:06Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2005 | - |
dc.identifier.citation | INTERNET AND NETWORK ECONOMICS, PROCEEDINGS BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE, v.3828, pp.748 - 757 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/91517 | - |
dc.description.abstract | Currently, there are many system requirements to guarantee the sealability, 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. In this paper, we propose the Group Peer based P2P Grid system architecture with k-Redundancy Scheme(1) that can satisfy these requirements. With respect to load balancing, this P2P Grid system clearly shows that redundancy scheme of group peer guarantees the reliability for resource or service discovery. Through the theoretical analysis and simulation, we discuss the performance of the proposed scheme. | - |
dc.language | English | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.title | Design of P2P grid networking architecture using k-redundancy scheme based group peer concept | - |
dc.type | Article | - |
dc.identifier.wosid | 000234851600075 | - |
dc.identifier.scopusid | 2-s2.0-33744916256 | - |
dc.type.rims | ART | - |
dc.citation.volume | 3828 | - |
dc.citation.beginningpage | 748 | - |
dc.citation.endingpage | 757 | - |
dc.citation.publicationname | INTERNET AND NETWORK ECONOMICS, PROCEEDINGS BOOK SERIES: LECTURE NOTES IN COMPUTER SCIENCE | - |
dc.contributor.localauthor | Youn, Chan-Hyun | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.