{"title":"Consistency preservation of replicas based on access frequency for content sharing in hybrid peer-to-peer networks","authors":"Ryota Yoichi, S. Sugawara","doi":"10.1504/IJSSC.2017.10010828","DOIUrl":null,"url":null,"abstract":"Various consistency maintenance strategies of content sharing in pure peer-to-peer (P2P) networks have been researched recently. However, the ones applied in hybrid P2P networks have not been investigated enough. In hybrid P2P networks, when an update of a content item happens on a peer, it is necessary to propagate the update to all the peers which have obsolete replicas of the same content item. In this paper, we propose a method which maintains consistency among the replicas of content items in a practical way when a content item is updated. In this method, the peers which have the replicas of frequently accessed content items are previously selected, and when an update occurs, the updating data is propagated to the peers on a priority basis. Furthermore, we discuss the effectiveness of the proposal by using computer simulations.","PeriodicalId":43931,"journal":{"name":"International Journal of Space-Based and Situated Computing","volume":"21 1","pages":"197-206"},"PeriodicalIF":0.0000,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Space-Based and Situated Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJSSC.2017.10010828","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
Various consistency maintenance strategies of content sharing in pure peer-to-peer (P2P) networks have been researched recently. However, the ones applied in hybrid P2P networks have not been investigated enough. In hybrid P2P networks, when an update of a content item happens on a peer, it is necessary to propagate the update to all the peers which have obsolete replicas of the same content item. In this paper, we propose a method which maintains consistency among the replicas of content items in a practical way when a content item is updated. In this method, the peers which have the replicas of frequently accessed content items are previously selected, and when an update occurs, the updating data is propagated to the peers on a priority basis. Furthermore, we discuss the effectiveness of the proposal by using computer simulations.