当前位置: X-MOL 学术IEEE ACM Trans. Netw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Robust Distributed Monitoring of Traffic Flows
IEEE/ACM Transactions on Networking ( IF 3.0 ) Pub Date : 2020-11-16 , DOI: 10.1109/tnet.2020.3034890
Vitalii Demianiuk , Sergey Gorinsky , Sergey I. Nikolenko , Kirill Kogan

Unrelenting traffic growth, device heterogeneity, and load unevenness create scalability challenges for traffic monitoring. In this paper, we propose Robust Distributed Computation (RoDiC), a new approach that addresses these challenges by shifting a portion of the monitoring-task execution from an overloaded network element to another element that has spare resources. Moving the entire execution of the task away from the overloaded element might be infeasible because execution on multiple elements is inherent in the task or requires at least partial participation by the designated overloaded element. Furthermore, distributed execution of a stateful task has to be resilient to network noise in the form of packet reordering and loss. The RoDiC approach relies on two main principles of packet grouping and state overlap to support exact robust distributed monitoring of traffic flows under network noise. RoDiC uses an open-loop paradigm that does not add any control packets, communicates flow state in-band by appending few control bits to packets of monitored flows, and keeps measurement latency low. We apply RoDiC to the problem of flow-size computation and discuss how to instantiate our general technique for real-time packet-loss telemetry. The paper develops robust algorithms, proves their correctness and performance properties, and reports an evaluation driven by realistic traffic traces. The RoDiC algorithms successfully distribute the monitoring-task load while keeping the memory and computation overhead low.

中文翻译:

鲁棒的分布式交通流量监控

持续的流量增长,设备异构性和负载不均匀性为流量监控带来了可扩展性挑战。在本文中,我们提出了鲁棒的分布式计算(RoDiC),这是一种通过将一部分监视任务执行从过载的网络元素转移到具有备用资源的另一元素来解决这些挑战的新方法。将整个任务的执行移离重载元素可能是不可行的,因为在任务中固有执行多个元素,或者需要指定的重载元素至少部分参与。此外,有状态任务的分布式执行必须对数据包重新排序和丢失形式的网络噪声具有弹性。RoDiC方法依赖于分组分组和状态重叠的两个主要原理,以支持在网络噪声下对流量进行精确,可靠的分布式监视。RoDiC使用一种开环范式,该范式不添加任何控制包,通过将少量控制位附加到受监视的流包中来在带内通信流状态,并保持较低的测量延迟。我们将RoDiC应用于流量大小计算问题,并讨论如何实例化用于实时丢包遥测的通用技术。本文开发了鲁棒的算法,证明了它们的正确性和性能,并报告了由实际交通跟踪驱动的评估。RoDiC算法成功地分配了监视任务负载,同时保持较低的内存和计算开销。RoDiC使用一种开环范式,该范式不添加任何控制包,通过将少量控制位附加到受监视的流包中来在带内通信流状态,并保持较低的测量延迟。我们将RoDiC应用于流量大小计算问题,并讨论如何实例化用于实时丢包遥测的通用技术。本文开发了鲁棒的算法,证明了它们的正确性和性能,并报告了由实际交通跟踪驱动的评估。RoDiC算法成功地分配了监视任务负载,同时保持较低的内存和计算开销。RoDiC使用一种开环范式,该范式不添加任何控制包,通过将少量控制位附加到受监视的流包中来在带内通信流状态,并保持较低的测量等待时间。我们将RoDiC应用于流量大小计算问题,并讨论如何实例化用于实时丢包遥测的通用技术。本文开发了鲁棒的算法,证明了它们的正确性和性能,并报告了由实际交通跟踪驱动的评估。RoDiC算法成功地分配了监视任务负载,同时保持较低的内存和计算开销。我们将RoDiC应用于流大小计算问题,并讨论如何实例化用于实时丢包遥测的通用技术。本文开发了鲁棒的算法,证明了它们的正确性和性能,并报告了由实际交通跟踪驱动的评估。RoDiC算法成功地分配了监视任务负载,同时保持较低的内存和计算开销。我们将RoDiC应用于流大小计算问题,并讨论如何实例化用于实时丢包遥测的通用技术。本文开发了鲁棒的算法,证明了它们的正确性和性能,并报告了由实际交通跟踪驱动的评估。RoDiC算法成功地分配了监视任务负载,同时保持较低的内存和计算开销。
更新日期:2020-11-16
down
wechat
bug