Echelon: Peer-to-Peer Network Diagnosis with Network Coding

Chuan Wu, Baochun Li
{"title":"Echelon: Peer-to-Peer Network Diagnosis with Network Coding","authors":"Chuan Wu, Baochun Li","doi":"10.1109/IWQOS.2006.250447","DOIUrl":null,"url":null,"abstract":"It is critical to monitor the performance and \"health\" of large-scale peer-to-peer applications. As an example, operators of peer-to-peer live streaming applications may be interested in observing performance bottlenecks, peer failures, and network topologies. In most cases, such observations are used to diagnose potential problems in the protocol design, to troubleshoot network outage, or to improve the Quality of Service of the peer-to-peer network in general. They are not time sensitive in nature, as delayed observations up to minutes or even hours are still valuable. However, such historical and delay-tolerant observations should include measurements of peers that have already failed or departed, as peer dynamics significantly affect the health of peer-to-peer applications. Such a delay-tolerant observation of peer-to-peer applications over a historical period of time is referred to as a diagnosis. In this paper, we present Echelon, a time-insensitive way to construct the diagnosis of a large-scale peer-to-peer application. Replacing the traditional wisdom of logging servers, we leverage the power of network coding to collect application-specific measurements on each peer, and disseminate them to other peers in a coded form. Over time, measurements of departed peers can still be recovered, simply by probing a small subset of peers in the network. Simulation studies have shown that Echelon is highly configurable, bandwidth efficient, and extremely tolerant of peer dynamics, thanks to the advantages of randomized network coding","PeriodicalId":248938,"journal":{"name":"200614th IEEE International Workshop on Quality of Service","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"200614th IEEE International Workshop on Quality of Service","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQOS.2006.250447","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 24

Abstract

It is critical to monitor the performance and "health" of large-scale peer-to-peer applications. As an example, operators of peer-to-peer live streaming applications may be interested in observing performance bottlenecks, peer failures, and network topologies. In most cases, such observations are used to diagnose potential problems in the protocol design, to troubleshoot network outage, or to improve the Quality of Service of the peer-to-peer network in general. They are not time sensitive in nature, as delayed observations up to minutes or even hours are still valuable. However, such historical and delay-tolerant observations should include measurements of peers that have already failed or departed, as peer dynamics significantly affect the health of peer-to-peer applications. Such a delay-tolerant observation of peer-to-peer applications over a historical period of time is referred to as a diagnosis. In this paper, we present Echelon, a time-insensitive way to construct the diagnosis of a large-scale peer-to-peer application. Replacing the traditional wisdom of logging servers, we leverage the power of network coding to collect application-specific measurements on each peer, and disseminate them to other peers in a coded form. Over time, measurements of departed peers can still be recovered, simply by probing a small subset of peers in the network. Simulation studies have shown that Echelon is highly configurable, bandwidth efficient, and extremely tolerant of peer dynamics, thanks to the advantages of randomized network coding
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
梯队:点对点网络诊断与网络编码
监视大规模点对点应用程序的性能和“运行状况”至关重要。例如,点对点直播应用程序的运营商可能对观察性能瓶颈、点对点故障和网络拓扑感兴趣。在大多数情况下,这些观察结果用于诊断协议设计中的潜在问题,排除网络中断的故障,或者总体上提高对等网络的服务质量。它们对时间不敏感,因为延迟几分钟甚至几小时的观测仍然是有价值的。然而,这种历史和延迟容忍观察应该包括已经失败或离开的对等的测量,因为对等动态会显著影响对等应用程序的健康。这种对点对点应用程序在一段历史时间内的延迟容忍观察被称为诊断。在本文中,我们提出了一种构建大规模点对点应用诊断的时间不敏感方法Echelon。我们利用网络编码的力量来收集每个节点上特定于应用程序的测量值,并以编码的形式将它们分发给其他节点,从而取代了传统的日志服务器智慧。随着时间的推移,仍然可以通过探测网络中的一小部分对等体来恢复离开对等体的测量值。仿真研究表明,由于随机网络编码的优势,Echelon具有高度可配置性、带宽效率和对对等动态的极大容忍度
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Variation of Route Flap Damping to Improve BGP Routing Convergence Dynamic Resource Reservation in IEEE 802.16 Broadband Wireless Networks On the Performance of Error-resilient End-point-based Multicast Streaming Dynamic Adaptation of Temporal Event Correlation for QoS Management in Distributed Systems Flow-Cookies: Using Bandwidth Amplification to Defend Against DDoS Flooding Attacks
×
引用
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