WARP: On-the-fly Program Synthesis for Agile, Real-time, and Reliable Wireless Networks

WARP: On-the-fly Program Synthesis for Agile, Real-time, and Reliable Wireless Networks
复制标题

DOI:
10.1145/3412382.3458270
复制
发表时间:
2021-05
期刊:
Proceedings of the 20th International Conference on Information Processing in Sensor Networks (co-located with CPS-IoT Week 2021)
影响因子:
--
通讯作者:
Ryan Brummet;Md. Kowsar Hossain;Octav Chipara;T. Herman;S. Goddard
Ryan Brummet;Md. Kowsar Hossain;Octav Chipara;T. Herman;S. Goddard
中科院分区:
其他
文献类型:
--
作者:
Ryan Brummet;Md. Kowsar Hossain;Octav Chipara;T. Herman;S. Goddard

文献摘要

被引文献

相似文献

新兴的工业物联网系统需要无线解决方案来连接传感器、执行器和控制器,作为实时流上的高数据速率反馈控制环路的一部分。一个关键的挑战是提供可预测的性能和灵活性,以响应链路质量的波动、可变的工作负载和拓扑变化。我们提出WARP来应对这一挑战。WARP使用程序来指定网络的行为,并包括一个综合过程,以自动生成这样的程序,从系统的工作负载和拓扑结构的高级规范。WARP有三个独特的功能:(1)WARP使用特定于域的语言来指定有状态的程序,这些程序包括条件语句来控制何时传输流的数据包。程序的执行路径取决于在运行时观察到的数据包丢失模式,从而使WARP能够容易地适应由于链路质量的短期变化而导致的数据包丢失。(2)我们的合成技术使用的算法,以提高网络性能,考虑多个数据包丢失模式和相关的执行路径时,确定节点执行的传输。此外,所生成的程序确保流在其截止日期之前传递其分组的可能性超过用户指定的阈值。(3)WARP可以适应工作负载和拓扑结构的变化,而无需显式地重建网络的程序,基于这样的观察:当节点共享相同的工作负载和拓扑信息时,它们可以独立地合成相同的程序。模拟表明,WARP提高了两种现实拓扑上数据收集、传播和混合工作负载的网络吞吐量。测试床实验表明,WARP减少了5倍的时间,以增加新的流量比一个国家的最先进的集中式控制平面,并保证所有流的实时性和可靠性。
Emerging Industrial Internet-of-Things systems require wireless solutions to connect sensors, actuators, and controllers as part of high data rate feedback-control loops over real-time flows. A key challenge is to provide predictable performance and agility in response to fluctuations in link quality, variable workloads, and topology changes. We propose WARP to address this challenge. WARP uses programs to specify a network's behavior and includes a synthesis procedure to automatically generate such programs from a high-level specification of the system's workload and topology. WARP has three unique features: (1) WARP uses a domain-specific language to specify stateful programs that include conditional statements to control when a flow's packets are transmitted. The execution paths of programs depend on the pattern of packet losses observed at runtime, thereby enabling WARP to readily adapt to packet losses due to short-term variations in link quality. (2) Our synthesis technique uses heuristics to improve network performance by considering multiple packet loss patterns and associated execution paths when determining the transmissions performed by nodes. Furthermore, the generated programs ensure that the likelihood of a flow delivering its packets by its deadline exceeds a user-specified threshold. (3) WARP can adapt to workload and topology changes without explicitly reconstructing a network's program based on the observation that nodes can independently synthesize the same program when they share the same workload and topology information. Simulations show that WARP improves network throughput for data collection, dissemination, and mixed workloads on two realistic topologies. Testbed experiments show that WARP reduces the time to add new flows by 5 times over a state-of-the-art centralized control plane and guarantees the real-time and reliability of all flows.