Dynamic Scheduling of Approximate Telemetry Queries

Dynamic Scheduling of Approximate Telemetry Queries
复制标题

DOI:
--
复制
发表时间:
2022
期刊:
--
影响因子:
--
通讯作者:
Chris Misa;Walt O'Connor;Ramakrishnan Durairajan;R. Rejaie;Walter Willinger
Chris Misa;Walt O'Connor;Ramakrishnan Durairajan;R. Rejaie;Walter Willinger
中科院分区:
其他
文献类型:
--
作者:
Chris Misa;Walt O'Connor;Ramakrishnan Durairajan;R. Rejaie;Walter Willinger

文献摘要

被引文献

相似文献

网络遥测系统提供了对网络状态的关键可见性。虽然通过利用可编程交换机硬件将这些系统扩展到高和时变的流量工作负载已经取得了重大进展,但在面对动态(如流量组成以及在给定时间点运行的查询数量和类型)时,对有效利用有限的硬件资源的关注较少。这两种动态对资源需求和查询准确性都有影响。在本文中,我们认为,这个动态问题动机重构遥测系统的资源分配器-一个显着偏离国家的最先进的。更具体地说,而不是静态分区查询跨硬件和软件平台,遥测系统应该决定自己和在运行时,何时以及多久执行一组活动查询的数据平面。为此,我们提出了一种有效的近似和调度算法,该算法暴露了查询执行的准确性和延迟权衡,以减少硬件资源的使用。我们通过构建DynATOS来评估我们的算法,DynATOS是一种围绕ASIC编程的可重构方法构建的硬件原型。我们表明,我们的方法比最先进的方法更强大,可以在单个交换机上执行动态工作负载,包括多个并发和顺序查询,同时满足每个查询的准确性和延迟目标。
Network telemetry systems provide critical visibility into the state of networks. While significant progress has been made by leveraging programmable switch hardware to scale these systems to high and time-varying traffic workloads, less attention has been paid towards efficiently utilizing limited hardware resources in the face of dynamics such as the composition of traffic as well as the number and types of queries running at a given point in time. Both these dynamics have implications on resource requirements and query accuracy. In this paper, we argue that this dynamics problem moti-vates reframing telemetry systems as resource schedulers —a significant departure from state-of-the-art. More concretely, rather than statically partition queries across hardware and software platforms, telemetry systems ought to decide on their own and at runtime when and for how long to execute the set of active queries on the data plane. To this end, we propose an efficient approximation and scheduling algorithm that exposes accuracy and latency tradeoffs with respect to query execution to reduce hardware resource usage. We evaluate our algorithm by building DynATOS , a hardware prototype built around a reconfigurable approach to ASIC programming. We show that our approach is more robust than state-of-the-art methods to traffic dynamics and can execute dynamic workloads comprised of multiple concurrent and sequential queries of varied complexities on a single switch while meeting per-query accuracy and latency goals.