用Snappy抓住Microburst罪犯

Xiaoqi Chen, Shir Landau Feibish, Yaron Koral, J. Rexford, Ori Rottenstreich
{"title":"用Snappy抓住Microburst罪犯","authors":"Xiaoqi Chen, Shir Landau Feibish, Yaron Koral, J. Rexford, Ori Rottenstreich","doi":"10.1145/3229584.3229586","DOIUrl":null,"url":null,"abstract":"Short-lived traffic surges, known as microbursts, can cause periods of unexpectedly high packet delay and loss on a link. Today, preventing microbursts requires deploying switches with larger packet buffers (incurring higher cost) or running the network at low utilization (sacrificing efficiency). Instead, we argue that switches should detect microbursts as they form, and take corrective action before the situation gets worse. This requires an efficient way for switches to identify the particular flows responsible for a microburst, and handle them automatically (e.g., by pacing, marking, or rerouting the packets). However, collecting fine-grained statistics about queue occupancy in real time is challenging, even with emerging programmable data planes. We present Snappy, which identifies the flows responsible for a microburst in real time. Snappy maintains multiple snapshots of the occupants of the queue over time, where each snapshot is a compact data structure that makes eicient use of data-plane memory. As each new packet arrives, Snappy updates one snapshot and also estimates the fraction of the queue occupied by the associated flow. Our simulations with data-center packet traces show that Snappy can target the flows responsible for microbursts at the sub-millisecond level.","PeriodicalId":326661,"journal":{"name":"Proceedings of the Afternoon Workshop on Self-Driving Networks","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"55","resultStr":"{\"title\":\"Catching the Microburst Culprits with Snappy\",\"authors\":\"Xiaoqi Chen, Shir Landau Feibish, Yaron Koral, J. Rexford, Ori Rottenstreich\",\"doi\":\"10.1145/3229584.3229586\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Short-lived traffic surges, known as microbursts, can cause periods of unexpectedly high packet delay and loss on a link. Today, preventing microbursts requires deploying switches with larger packet buffers (incurring higher cost) or running the network at low utilization (sacrificing efficiency). Instead, we argue that switches should detect microbursts as they form, and take corrective action before the situation gets worse. This requires an efficient way for switches to identify the particular flows responsible for a microburst, and handle them automatically (e.g., by pacing, marking, or rerouting the packets). However, collecting fine-grained statistics about queue occupancy in real time is challenging, even with emerging programmable data planes. We present Snappy, which identifies the flows responsible for a microburst in real time. Snappy maintains multiple snapshots of the occupants of the queue over time, where each snapshot is a compact data structure that makes eicient use of data-plane memory. As each new packet arrives, Snappy updates one snapshot and also estimates the fraction of the queue occupied by the associated flow. Our simulations with data-center packet traces show that Snappy can target the flows responsible for microbursts at the sub-millisecond level.\",\"PeriodicalId\":326661,\"journal\":{\"name\":\"Proceedings of the Afternoon Workshop on Self-Driving Networks\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"55\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the Afternoon Workshop on Self-Driving Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3229584.3229586\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the Afternoon Workshop on Self-Driving Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3229584.3229586","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 55

摘要

短暂的流量激增,称为微突发,可能导致链路上出现意外的高数据包延迟和丢失。今天,防止微突发需要部署具有更大数据包缓冲区的交换机(导致更高的成本)或以低利用率运行网络(牺牲效率)。相反,我们认为开关应该在微脉冲形成时检测到它们,并在情况变得更糟之前采取纠正措施。这需要一种有效的方法,让交换机识别负责微突发的特定流,并自动处理它们(例如,通过调整、标记或重新路由数据包)。然而,即使使用新兴的可编程数据平面,实时收集关于队列占用的细粒度统计数据也是具有挑战性的。我们提出了Snappy,它可以实时识别导致微爆流的流。Snappy在一段时间内维护队列占用者的多个快照,其中每个快照都是一个紧凑的数据结构,可以有效地利用数据平面内存。当每个新数据包到达时,Snappy更新一个快照,并估计相关流占用的队列比例。我们对数据中心数据包跟踪的模拟表明,Snappy可以在亚毫秒级别针对导致微突发的流。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Catching the Microburst Culprits with Snappy
Short-lived traffic surges, known as microbursts, can cause periods of unexpectedly high packet delay and loss on a link. Today, preventing microbursts requires deploying switches with larger packet buffers (incurring higher cost) or running the network at low utilization (sacrificing efficiency). Instead, we argue that switches should detect microbursts as they form, and take corrective action before the situation gets worse. This requires an efficient way for switches to identify the particular flows responsible for a microburst, and handle them automatically (e.g., by pacing, marking, or rerouting the packets). However, collecting fine-grained statistics about queue occupancy in real time is challenging, even with emerging programmable data planes. We present Snappy, which identifies the flows responsible for a microburst in real time. Snappy maintains multiple snapshots of the occupants of the queue over time, where each snapshot is a compact data structure that makes eicient use of data-plane memory. As each new packet arrives, Snappy updates one snapshot and also estimates the fraction of the queue occupied by the associated flow. Our simulations with data-center packet traces show that Snappy can target the flows responsible for microbursts at the sub-millisecond level.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信