一个信誉度量的计算复杂度

Workshop of the 1st International Conference on Security and Privacy for Emerging Areas in Communication Networks, 2005. Pub Date : 2005-09-05 DOI:10.1109/SECCMW.2005.1588305

V. Grishchenko

{"title":"一个信誉度量的计算复杂度","authors":"V. Grishchenko","doi":"10.1109/SECCMW.2005.1588305","DOIUrl":null,"url":null,"abstract":"This article addresses a problem of practical computation of a previously defined (Grischenko, 2004) reputation metric in P2P (peer-to-peer) environments. This problem turns out to be identical to a very generic all-pairs-shortest-paths problem (APSP) calculated in a distributed environment. An algorithm of practically acceptable computational cost is introduced and analyzed.","PeriodicalId":382662,"journal":{"name":"Workshop of the 1st International Conference on Security and Privacy for Emerging Areas in Communication Networks, 2005.","volume":"78 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Computational complexity of one reputation metric\",\"authors\":\"V. Grishchenko\",\"doi\":\"10.1109/SECCMW.2005.1588305\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article addresses a problem of practical computation of a previously defined (Grischenko, 2004) reputation metric in P2P (peer-to-peer) environments. This problem turns out to be identical to a very generic all-pairs-shortest-paths problem (APSP) calculated in a distributed environment. An algorithm of practically acceptable computational cost is introduced and analyzed.\",\"PeriodicalId\":382662,\"journal\":{\"name\":\"Workshop of the 1st International Conference on Security and Privacy for Emerging Areas in Communication Networks, 2005.\",\"volume\":\"78 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop of the 1st International Conference on Security and Privacy for Emerging Areas in Communication Networks, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SECCMW.2005.1588305\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop of the 1st International Conference on Security and Privacy for Emerging Areas in Communication Networks, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SECCMW.2005.1588305","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

本文解决了在P2P(点对点)环境中对先前定义的(Grischenko, 2004)声誉度量进行实际计算的问题。这个问题与在分布式环境中计算的非常通用的全对最短路径问题(APSP)相同。介绍并分析了一种计算成本实际可接受的算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Computational complexity of one reputation metric

This article addresses a problem of practical computation of a previously defined (Grischenko, 2004) reputation metric in P2P (peer-to-peer) environments. This problem turns out to be identical to a very generic all-pairs-shortest-paths problem (APSP) calculated in a distributed environment. An algorithm of practically acceptable computational cost is introduced and analyzed.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Workshop of the 1st International Conference on Security and Privacy for Emerging Areas in Communication Networks, 2005.

自引率

0.00%

发文量