IP语音通信的可扩展和匿名保护覆盖

Airat D. Kabirov, I. Anikin, David Schatz, G. Schaefer
{"title":"IP语音通信的可扩展和匿名保护覆盖","authors":"Airat D. Kabirov, I. Anikin, David Schatz, G. Schaefer","doi":"10.1109/DYNAMICS.2018.8601492","DOIUrl":null,"url":null,"abstract":"Anonymous Voice over IP (VoIP) communication is an important tool to provide freedom of speech. For achieving a good trade-off between quality of service (QoS) and anonymity, connecting mixes by padded links is a promising approach. However, constructing suitable overlay topologies for establishing padded links is not easy: existing approaches are either not scalable with regard to the number of mixes because of using full meshes or impractical due to computational complexity of the algorithms used to create optimal reduced topologies. This prevents them from being deployed as volunteer-based networks like Tor. In this paper, we propose and study different heuristic strategies for reduced topology construction and path selection with low computational complexity. We evaluate our approach using latency and bandwidth estimations from the Tor network and demonstrate that we can achieve appropriate performance and anonymity metrics for VoIP. Especially, the achieved properties are similar to those of a recently proposed approach that calculates optimal topologies for small networks.","PeriodicalId":394567,"journal":{"name":"2018 Dynamics of Systems, Mechanisms and Machines (Dynamics)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Scalable and Anonymity Preserving Overlays for Voice over IP Communications\",\"authors\":\"Airat D. Kabirov, I. Anikin, David Schatz, G. Schaefer\",\"doi\":\"10.1109/DYNAMICS.2018.8601492\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Anonymous Voice over IP (VoIP) communication is an important tool to provide freedom of speech. For achieving a good trade-off between quality of service (QoS) and anonymity, connecting mixes by padded links is a promising approach. However, constructing suitable overlay topologies for establishing padded links is not easy: existing approaches are either not scalable with regard to the number of mixes because of using full meshes or impractical due to computational complexity of the algorithms used to create optimal reduced topologies. This prevents them from being deployed as volunteer-based networks like Tor. In this paper, we propose and study different heuristic strategies for reduced topology construction and path selection with low computational complexity. We evaluate our approach using latency and bandwidth estimations from the Tor network and demonstrate that we can achieve appropriate performance and anonymity metrics for VoIP. Especially, the achieved properties are similar to those of a recently proposed approach that calculates optimal topologies for small networks.\",\"PeriodicalId\":394567,\"journal\":{\"name\":\"2018 Dynamics of Systems, Mechanisms and Machines (Dynamics)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Dynamics of Systems, Mechanisms and Machines (Dynamics)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DYNAMICS.2018.8601492\",\"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 Dynamics of Systems, Mechanisms and Machines (Dynamics)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DYNAMICS.2018.8601492","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

匿名IP语音(VoIP)通信是提供言论自由的重要工具。为了在服务质量(QoS)和匿名性之间实现良好的权衡,通过填充链接连接混合是一种很有前途的方法。然而,为建立填充链接构建合适的覆盖拓扑并不容易:现有的方法要么由于使用全网格而在混合数量方面不可扩展,要么由于用于创建最佳简化拓扑的算法的计算复杂性而不切实际。这阻止了它们被部署为像Tor这样的基于志愿者的网络。在本文中,我们提出并研究了不同的启发式策略,以减少拓扑结构和路径选择的计算复杂度。我们使用Tor网络的延迟和带宽估计来评估我们的方法,并证明我们可以为VoIP实现适当的性能和匿名指标。特别是,所获得的属性与最近提出的计算小型网络最优拓扑的方法相似。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Scalable and Anonymity Preserving Overlays for Voice over IP Communications
Anonymous Voice over IP (VoIP) communication is an important tool to provide freedom of speech. For achieving a good trade-off between quality of service (QoS) and anonymity, connecting mixes by padded links is a promising approach. However, constructing suitable overlay topologies for establishing padded links is not easy: existing approaches are either not scalable with regard to the number of mixes because of using full meshes or impractical due to computational complexity of the algorithms used to create optimal reduced topologies. This prevents them from being deployed as volunteer-based networks like Tor. In this paper, we propose and study different heuristic strategies for reduced topology construction and path selection with low computational complexity. We evaluate our approach using latency and bandwidth estimations from the Tor network and demonstrate that we can achieve appropriate performance and anonymity metrics for VoIP. Especially, the achieved properties are similar to those of a recently proposed approach that calculates optimal topologies for small networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信