اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدReconfiguration Algorithms for High Precision Communications in Time Sensitive Networks: Time-Aware Shaper Configuration with IEEE 802.1Qcc (Extended Version)
46
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
As new networking paradigms emerge for different networking applications, e.g., cyber-physical systems, and different services are handled under a converged data link technology, e.g., Ethernet, certain applications with mission critical traffic cannot coexist on the same physical networking infrastructure using traditional Ethernet packet-switched networking protocols. The IEEE 802.1Q Time Sensitive Networking (TSN) task group is developing protocol standards to provide deterministic properties on Ethernet based packet-switched networks. In particular, the IEEE 802.1Qcc, centralized management and control, and the IEEE 802.1Qbv, Time-Aware Shaper, can be used to manage and control scheduled traffic streams with periodic properties along with best-effort traffic on the same network infrastructure. In this paper, we investigate the effects of using the IEEE 802.1Qcc management protocol to accurately and precisely configure TAS enabled switches (with transmission windows governed by gate control lists (GCLs) with gate control entries (GCEs)) ensuring ultra-low latency, zero packet loss, and minimal jitter for scheduled TSN traffic. We examine both a centralized network/distributed user model (hybrid model) and a fully-distributed (decentralized) 802.1Qcc model on a typical industrial control network with the goal of maximizing scheduled traffic streams.
قيم البحث
اقرأ أيضاً
Next generation Wi-Fi networks are expected to support real-time applications that impose strict requirements on the packet transmission delay and packet loss ratio. Such applications form an essential target for the future Wi-Fi standard, namely IEE
E 802.11be, the development process of which started in 2019. A promising way to provide efficient real-time communications in 802.11be networks requires some modification of the uplink OFDMA feature originally introduced in the IEEE 802.11ax amendment to the Wi-Fi standard. This feature allows the access point to reserve channel resources for upcoming urgent transmissions. The paper explains why uplink OFDMA random access of 802.11ax does not perfectly fit the requirements of real-time applications and proposes an easy-to-implement modification of the channel access rules for future 802.11be networks. With extensive simulation, it is shown that this modification together with a new resource allocation algorithm outperforms the existing ways to support real-time applications, especially for a heavy load and a high number of users. In particular, they provide extremely low delays for real-time traffic, while the throughput for non-real-time traffic is reduced insignificantly.
Support of real-time applications that impose strict requirements on packet loss ratio and latency is an essential feature of the next generation Wi-Fi networks. Initially introduced in the 802.11ax amendment to the Wi-Fi standard, uplink OFDMA seems
to be a promising solution for supported low-latency data transmission from the numerous stations to an access point. In this paper, we study how to allocate OFDMA resources in an 802.11ax network and propose an algorithm aimed at providing the delay less than one millisecond and reliability up to 99.999% as required by numerous real-time applications. We design a resource allocation algorithm and with extensive simulation, show that it decreases delays for real-time traffic by orders of magnitude, while the throughput for non-real-time traffic is reduced insignificantly.
This paper describes TARDIS (Traffic Assignment and Retiming Dynamics with Inherent Stability) which is an algorithmic procedure designed to reallocate traffic within Internet Service Provider (ISP) networks. Recent work has investigated the idea of
shifting traffic in time (from peak to off-peak) or in space (by using different links). This work gives a unified scheme for both time and space shifting to reduce costs. Particular attention is given to the commonly used 95th percentile pricing scheme. The work has three main innovations: firstly, introducing the Shapley Gradient, a way of comparing traffic pricing between different links at different times of day; secondly, a unified way of reallocating traffic in time and/or in space; thirdly, a continuous approximation to this system is proved to be stable. A trace-driven investigation using data from two service providers shows that the algorithm can create large savings in transit costs even when only small proportions of the traffic can be shifted.
In the Internet of Things scenarios, it is crucially important to provide low energy consumption of client devices. To address this challenge, new Wi-Fi standards introduce the Target Wake Time (TWT) mechanism. With TWT, devices transmit their data a
ccording to a schedule and move to the doze state afterwards. The main problem of this mechanism is the clock drift phenomenon, because of which the devices cease to strictly comply with the schedule. As a result, they can miss the scheduled transmission time, which increases active time and thus power consumption. The paper investigates uplink transmission with two different TWT operation modes. With the first mode, a sensor transmits a packet to the access point (AP) after waking up, using the random channel access. With the second mode, the AP polls stations and they can transmit a packet only after receiving a trigger frame from the AP. For both modes, the paper studies how the average transmission time, the packet loss rate and the average energy consumption depend on the different TWT parameters. It is shown that when configured to guarantee the given packet loss rate, the first mode provides lower transmission time, while the second mode provides lower energy consumption.
In 5G and beyond systems, the notion of latency gets a great momentum in wireless connectivity as a metric for serving real-time communications requirements. However, in many applications, research has pointed out that latency could be inefficient to
handle applications with data freshness requirements. Recently, the notion of Age of Information (AoI) that can capture the freshness of the data has attracted a lot of attention. In this work, we consider mixed traffic with time-sensitive users; a deadline-constrained user, and an AoI-oriented user. To develop an efficient scheduling policy, we cast a novel optimization problem formulation for minimizing the average AoI while satisfying the timely throughput constraints. The formulated problem is cast as a Constrained Markov Decision Process (CMDP). We relax the constrained problem to an unconstrained Markov Decision Process (MDP) problem by utilizing Lyapunov optimization theory and it can be proved that it is solved per frame by applying backward dynamic programming algorithms with optimality guarantees. Simulation results show that the timely throughput constraints are satisfied while minimizing the average AoI. Also, simulation results show the convergence of the algorithm for different values of the weighted factor and the trade-off between the AoI and the timely throughput.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
