Tor网络的最优令牌桶填充

K. K, Ankit Rathore, V. B, P. D. Shenoy, V. R., Vignesh T Prabhu
{"title":"Tor网络的最优令牌桶填充","authors":"K. K, Ankit Rathore, V. B, P. D. Shenoy, V. R., Vignesh T Prabhu","doi":"10.1109/CONECCT.2018.8482389","DOIUrl":null,"url":null,"abstract":"The infrastructure of the Tor network is completely dependent on the relays voluntarily contributing their bandwidth for the community. Although the network provides a very high level of anonymity to the end user, it is designed such that the anonymity comes at the cost of very high latency. Hence, improving the performance of Tor network is always a very important aspect of the Tor project. Token Bucket algorithm is used in relays to ensure that the packets sent by clients are not lost and the bandwidth limits configured by the relay administrator is respected. In Token bucket algorithm, an important aspect is the Token Bucket Refill Interval which decides on how often the tokens are added to the bucket. In the Tor network, a default value of 100ms is used. This value is vindictive for a network where the majority of the clients are web clients with small download size. But as the bulk clients increase, it is important to understand how the value of Token Bucket Refill Interval impacts the performance of the network. In this paper, we continue on the previous work done to find the optimum value for Token Bucket Refill Interval for different scenarios of Tor network. Based on the simulations, we have found that download size of the clients is inversely related to the Token Bucket Refill Interval for the overall performance of the network. A larger value of Token Bucket Refill Interval gives a much better performance in Tor network when download size is small. However, as the download size increases, lower values of Token Bucket Refill Interval show better performance in Tor network.","PeriodicalId":430389,"journal":{"name":"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal Token Bucket Refilling for Tor network\",\"authors\":\"K. K, Ankit Rathore, V. B, P. D. Shenoy, V. R., Vignesh T Prabhu\",\"doi\":\"10.1109/CONECCT.2018.8482389\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The infrastructure of the Tor network is completely dependent on the relays voluntarily contributing their bandwidth for the community. Although the network provides a very high level of anonymity to the end user, it is designed such that the anonymity comes at the cost of very high latency. Hence, improving the performance of Tor network is always a very important aspect of the Tor project. Token Bucket algorithm is used in relays to ensure that the packets sent by clients are not lost and the bandwidth limits configured by the relay administrator is respected. In Token bucket algorithm, an important aspect is the Token Bucket Refill Interval which decides on how often the tokens are added to the bucket. In the Tor network, a default value of 100ms is used. This value is vindictive for a network where the majority of the clients are web clients with small download size. But as the bulk clients increase, it is important to understand how the value of Token Bucket Refill Interval impacts the performance of the network. In this paper, we continue on the previous work done to find the optimum value for Token Bucket Refill Interval for different scenarios of Tor network. Based on the simulations, we have found that download size of the clients is inversely related to the Token Bucket Refill Interval for the overall performance of the network. A larger value of Token Bucket Refill Interval gives a much better performance in Tor network when download size is small. However, as the download size increases, lower values of Token Bucket Refill Interval show better performance in Tor network.\",\"PeriodicalId\":430389,\"journal\":{\"name\":\"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-03-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CONECCT.2018.8482389\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE International Conference on Electronics, Computing and Communication Technologies (CONECCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CONECCT.2018.8482389","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

Tor网络的基础设施完全依赖于自愿为社区贡献带宽的中继。尽管网络为最终用户提供了非常高的匿名性,但它的设计使得匿名以非常高的延迟为代价。因此,提高Tor网络的性能一直是Tor项目的一个非常重要的方面。在中继中使用令牌桶算法,以确保客户端发送的数据包不丢失,并遵守中继管理员配置的带宽限制。在令牌桶算法中,一个重要的方面是令牌桶重新填充间隔,它决定了令牌多长时间被添加到桶中。在Tor网络中,使用默认值100ms。对于大多数客户端都是下载大小较小的web客户端的网络来说,这个值是报复性的。但是随着批量客户端的增加,了解令牌桶重新填充间隔的值如何影响网络性能是很重要的。在本文中,我们继续之前所做的工作,以找到针对Tor网络不同场景的令牌桶填充间隔的最佳值。基于模拟,我们发现客户端的下载大小与网络整体性能的令牌桶重新填充间隔成反比。在Tor网络中,当下载大小较小时,令牌桶重新填充间隔的值越大,性能越好。然而,随着下载大小的增加,令牌桶重新填充间隔的值越小,在Tor网络中性能越好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal Token Bucket Refilling for Tor network
The infrastructure of the Tor network is completely dependent on the relays voluntarily contributing their bandwidth for the community. Although the network provides a very high level of anonymity to the end user, it is designed such that the anonymity comes at the cost of very high latency. Hence, improving the performance of Tor network is always a very important aspect of the Tor project. Token Bucket algorithm is used in relays to ensure that the packets sent by clients are not lost and the bandwidth limits configured by the relay administrator is respected. In Token bucket algorithm, an important aspect is the Token Bucket Refill Interval which decides on how often the tokens are added to the bucket. In the Tor network, a default value of 100ms is used. This value is vindictive for a network where the majority of the clients are web clients with small download size. But as the bulk clients increase, it is important to understand how the value of Token Bucket Refill Interval impacts the performance of the network. In this paper, we continue on the previous work done to find the optimum value for Token Bucket Refill Interval for different scenarios of Tor network. Based on the simulations, we have found that download size of the clients is inversely related to the Token Bucket Refill Interval for the overall performance of the network. A larger value of Token Bucket Refill Interval gives a much better performance in Tor network when download size is small. However, as the download size increases, lower values of Token Bucket Refill Interval show better performance in Tor network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Strain Dependent Carrier Mobility in 8 − Pmmn Borophene: ab-initio study Diameter Scaling in III-V Gate-All-Around Transistor for Different Cross-Sections Atomistic Study of Acoustic Phonon Limited Mobility in Extremely Scaled Si and Ge Films Optimal Token Bucket Refilling for Tor network Traffic Pattern Analysis from GPS Data: A Case Study of Dhaka City
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1