{"title":"Reputation Management for DHT-Based Collaborative Environments","authors":"N. Fedotova, L. Veltri","doi":"10.1109/NGI.2008.49","DOIUrl":null,"url":null,"abstract":"This article addresses a problem of integration of reputation management mechanisms and lookup processes in (distributed hash table) DHT-based peer-to-peer (P2P) networks with collaborative nature. We present a possible scenario of application of some reputation techniques to lookup and data retrieval processes in a P2P network based on the popular Kademlia algorithm. Unlike most of existing reputation management systems for DHT-based P2P environments, we don't use a number of successful downloads as the main instrument to evaluate a trustworthiness of peers, but we propose to consider any type of interactions between nodes. This choice is motivated by the fact that file sharing is not a unique service supported by DHT-based P2P systems. There are other application areas for P2P (e.g. collaborative and distributed computing) where it is important to consider such aspects as a risk factor, a \"stay on-line\" time or a number of requests without reply.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Next Generation Internet Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGI.2008.49","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
This article addresses a problem of integration of reputation management mechanisms and lookup processes in (distributed hash table) DHT-based peer-to-peer (P2P) networks with collaborative nature. We present a possible scenario of application of some reputation techniques to lookup and data retrieval processes in a P2P network based on the popular Kademlia algorithm. Unlike most of existing reputation management systems for DHT-based P2P environments, we don't use a number of successful downloads as the main instrument to evaluate a trustworthiness of peers, but we propose to consider any type of interactions between nodes. This choice is motivated by the fact that file sharing is not a unique service supported by DHT-based P2P systems. There are other application areas for P2P (e.g. collaborative and distributed computing) where it is important to consider such aspects as a risk factor, a "stay on-line" time or a number of requests without reply.