Enabling TSN Scheduled Traffic on Ethernet Multidrop In- Vehicle Networks

• Ano de defesa: 2024
• Autor(a) principal: NASCIMENTO, David Alain do
• Orientador(a): CAMPELO, Divanilson Rodrigo de Sousa
• Tipo de documento: Tese
• Tipo de acesso: Acesso aberto
• Idioma: eng
• Instituição de defesa: Universidade Federal de Pernambuco
• Programa de Pós-Graduação: Programa de Pos Graduacao em Ciencia da Computacao
• País: Brasil
• Palavras-chave em Inglês: Automotive Ethernet; In-Vehicle Networking; Time- Sensitive Networking; Network Calculus; Timing Analysis; Latency
• Link de acesso: https://repositorio.ufpe.br/handle/123456789/70886

In recent years, there has been interest from the automotive industry in a novel single-pair, half-duplex Ethernet multidrop bus provision (i.e., 10BASE-T1S), which relies on a coordinated channel access method provided by Physical Layer Collision Avoidance (PLCA). PLCA avoids Ethernet frame collisions and provides bounded latency while guaranteeing fairness among nodes and optimal bandwidth utilization. However, despite these advantageous features, PLCA is unaware of flow priorities and does not provide prioritybased Quality of Service (QoS). Thus, there is an opportunity for integrating QoS-aware schemes into PLCA, such as the Time-Sensitive Networking (TSN)-based Time-Aware Shaper (TAS) algorithm which governs one of the most relevant TSN standards, the IEEE 802.1Qbv. While TAS was initially designed for full-duplex point-to-point Ethernet links, an appropriate integration of TAS with PLCA can enable stringent deterministic latency with very low jitter in half-duplex multidrop provisions. In this work, we present modeling and analysis strategies using Network Calculus for integrating TAS with PLCA to support scheduled traffic, and we compare our modeling and analysis with a baseline work that previously modeled TAS for full-duplex point-to-point Ethernet only. We provide modeling and analysis approaches using Network Calculus for the Time-Aware Shaper (TAS) protocol in full-duplex Ethernet networks as well as Ethernet multidrop networks that employ Physical Layer Collision Avoidance (PLCA). Also, our analysis utilizes an enhanced Network Calculus method as an alternative approach to most stateof- the-art studies. Our solution reduces the worst-case delay bound in most Gate-Control List (GCL) scheduling cases in a full-duplex point-to-point network scenario, i.e., the same network of the baseline work. However, in contrast to the baseline work, we provide alternative modeling and analysis, in which we can reduce delay bounds by using simple curves with accurate analysis rather than accurate curves with an archaic analysis. Also, we show that replacing full-duplex point-to-point links with half-duplex PLCA multidrop links still complies with end-to-end delay deadlines while leading to a reduction of system costs due to the fewer number of Ethernet transceivers in a PLCA multidrop. Moreover, we also show that our results for TAS, when applied only on full-duplex point-to-point links, outperform the results of the baseline work in most use cases. We provide models and tools for analyzing TAS scheduling on distinct link types. The modeling and analysis techniques outlined in this research can assist network engineers in effectively integrating TAS and PLCA to solve real-time application GCL scheduling demands.