Full metadata record
DC FieldValueLanguage
dc.contributor.authorCheng, Chien-Fuen_US
dc.contributor.authorWang, Shu-Chingen_US
dc.contributor.authorLiang, Tyneen_US
dc.date.accessioned2014-12-08T15:07:26Z-
dc.date.available2014-12-08T15:07:26Z-
dc.date.issued2010-02-01en_US
dc.identifier.issn1349-4198en_US
dc.identifier.urihttp://hdl.handle.net/11536/5864-
dc.description.abstractIn this paper, file consistency problem of file-sharing with malicious processors in Peer-to-Peer (P2P) networks is investigated. We propose a novel hybrid approach integrating the clustering algorithm and consensus protocol to provide better Quality of Service (QoS) and solve the file consistency problem in the P2P file-sharing system. First, the clustering algorithm is introduced in our approach to provide better QoS. After clustering, we use consistent hash Junction to assign each processor and key to the corresponding processor in the de-Bruijn network. The de-Bruijn graph is nearly optimal and feature very short average routing distances. Finally, We use the consensus protocol to reach the consistent file information.en_US
dc.language.isoen_USen_US
dc.subjectPeer-to-peer systemsen_US
dc.subjectConsensusen_US
dc.subjectClusteringen_US
dc.subjectDe-Bruijn graphsen_US
dc.subjectFile consistency problemen_US
dc.subjectFile-sharing and malicious faultsen_US
dc.titleFILE CONSISTENCY PROBLEM OF FILE-SHARING IN PEER-TO-PEER ENVIRONMENTen_US
dc.typeArticleen_US
dc.identifier.journalINTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROLen_US
dc.citation.volume6en_US
dc.citation.issue2en_US
dc.citation.spage601en_US
dc.citation.epage613en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000275222300016-
dc.citation.woscount3-
Appears in Collections:Articles