基于协议和连通性的P2P网络覆盖层容量计算

Kasim Oztoprak, H. Kiliç
{"title":"基于协议和连通性的P2P网络覆盖层容量计算","authors":"Kasim Oztoprak, H. Kiliç","doi":"10.1109/WI-IATW.2006.108","DOIUrl":null,"url":null,"abstract":"In this paper, we proposed a metric for P2P networks based on Shannon's L-channel capacity calculation idea. The metric calculates the maximum rate of information (in bits per second) that can be transmitted over P2P network (a.k.a. combinatorial capacity) caused by protocol and overlay-level connectivity. We suggest P2P systems to be modeled as a discrete noiseless channel on which the protocol together with dynamically changing overlay-level instant connectivity topology defines a Shannon language. In experimental works, we applied the metric first to the Gnutella 0.6 protocol for which message traffic explosion is a known problem and then to its time-based clustering version. The obtained results are compared with other two known metrics' namely, number of query hits and unit query-hit response time, results and potential correlations among them are discussed","PeriodicalId":358971,"journal":{"name":"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Protocol and Connectivity Based Overlay Level Capacity Calculation of P2P Networks\",\"authors\":\"Kasim Oztoprak, H. Kiliç\",\"doi\":\"10.1109/WI-IATW.2006.108\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we proposed a metric for P2P networks based on Shannon's L-channel capacity calculation idea. The metric calculates the maximum rate of information (in bits per second) that can be transmitted over P2P network (a.k.a. combinatorial capacity) caused by protocol and overlay-level connectivity. We suggest P2P systems to be modeled as a discrete noiseless channel on which the protocol together with dynamically changing overlay-level instant connectivity topology defines a Shannon language. In experimental works, we applied the metric first to the Gnutella 0.6 protocol for which message traffic explosion is a known problem and then to its time-based clustering version. The obtained results are compared with other two known metrics' namely, number of query hits and unit query-hit response time, results and potential correlations among them are discussed\",\"PeriodicalId\":358971,\"journal\":{\"name\":\"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-12-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WI-IATW.2006.108\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI-IATW.2006.108","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

本文基于香农的l通道容量计算思想,提出了一种P2P网络容量度量方法。该指标计算了由协议和覆盖级连接引起的P2P网络上可以传输的最大信息速率(以每秒比特数为单位)(又称组合容量)。我们建议将P2P系统建模为一个离散的无噪声信道,在该信道上,协议与动态变化的覆盖级即时连接拓扑一起定义了香农语言。在实验工作中,我们首先将度量应用于Gnutella 0.6协议,该协议的消息流量爆炸是一个已知的问题,然后应用于其基于时间的集群版本。将得到的结果与其他两个已知指标(即查询命中次数和单位查询命中响应时间)进行比较,并讨论了结果和它们之间的潜在相关性
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Protocol and Connectivity Based Overlay Level Capacity Calculation of P2P Networks
In this paper, we proposed a metric for P2P networks based on Shannon's L-channel capacity calculation idea. The metric calculates the maximum rate of information (in bits per second) that can be transmitted over P2P network (a.k.a. combinatorial capacity) caused by protocol and overlay-level connectivity. We suggest P2P systems to be modeled as a discrete noiseless channel on which the protocol together with dynamically changing overlay-level instant connectivity topology defines a Shannon language. In experimental works, we applied the metric first to the Gnutella 0.6 protocol for which message traffic explosion is a known problem and then to its time-based clustering version. The obtained results are compared with other two known metrics' namely, number of query hits and unit query-hit response time, results and potential correlations among them are discussed
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信