当前位置: X-MOL 学术IEEE Trans. Ind. Inform. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Incremental Flow Scheduling and Routing in Time-Sensitive Software-Defined Networks
IEEE Transactions on Industrial Informatics ( IF 11.7 ) Pub Date : 2017-12-11 , DOI: 10.1109/tii.2017.2782235
Naresh Ganesh Nayak , Frank Durr , Kurt Rothermel

Several networking architectures have been developed atop IEEE 802.3 networks to provide real-time communication guarantees for time-sensitive applications in industrial automation systems. The basic principle underlying these technologies is the precise transmission scheduling of time-triggered traffic through the network for providing deterministic and bounded latency and jitter. These transmission schedules are typically synthesized offline (computational time in the order of hours) and remain fixed thereafter, making it difficult to dynamically add or remove network applications. This paper presents algorithms for incrementally adding time-triggered flows in a time-sensitive software-defined network (TSSDN). The TSSDN is a network architecture based on software-defined networking, which provides real-time guarantees for time-triggered flows by scheduling their transmissions on the hosts (network edge) only. These algorithms exploit the global view of the control plane on the data plane to schedule and route time-triggered flows needed for the dynamic applications in the Industrial Internet of Things (Industry 4.0). The evaluations show that these algorithms can compute incremental schedules for time-triggered flows in subseconds with an average relative optimality of 68%.

中文翻译:


时间敏感的软件定义网络中的增量流调度和路由



在 IEEE 802.3 网络之上开发了多种网络架构,为工业自动化系统中的时间敏感型应用提供实时通信保证。这些技术的基本原理是通过网络对时间触发的流量进行精确的传输调度,以提供确定性和有限的延迟和抖动。这些传输时间表通常是离线合成的(计算时间以小时为单位),并且此后保持固定,这使得动态添加或删除网络应用程序变得困难。本文提出了在时间敏感的软件定义网络(TSSDN)中增量添加时间触发流的算法。 TSSDN是一种基于软件定义网络的网络架构,它通过仅在主机(网络边缘)上调度其传输来为时间触发的流提供实时保证。这些算法利用数据平面上控制平面的全局视图来调度和路由工业物联网(工业 4.0)中动态应用程序所需的时间触发流。评估表明,这些算法可以在亚秒内计算时间触发流的增量计划,平均相对最优性为 68%。
更新日期:2017-12-11
down
wechat
bug