Priority-Based Network Access with Strict-Priority Scheduling in PLCA Multidrop Networks
THE QUICK READ
This paper addresses Physical Layer Collision Avoidance (PLCA) in 10BASE-T1S multidrop Ethernet, arguing that PLCA's node-based cyclic access ignores traffic priority, raising latency for time-sensitive traffic and limiting scalability. The authors propose priority-based network access and scheduling that decouples medium access from node ordering, enables class-based prioritization, and can emulate Strict Priority scheduling, with analytical worst-case latency bounds.
KEY POINTS
- Argues PLCA's node-based cyclic access does not account for traffic priority, causing high latency for time-sensitive traffic and limited scalability
- Proposes class-based prioritization decoupled from node ordering, letting high-priority traffic from any device precede lower-priority traffic
- Authors report emulated Strict Priority scheduling, derived worst-case latency bounds, and over 65% lower maximum high-priority latency than PLCA
READING LIMITS
Based only on the title and abstract; the full method, derivation assumptions, and evaluation setup were not reviewed, so the bounds and reported results were not independently verified.
Source abstract [EN]
Shared-medium Ethernet is gaining renewed attention across industrial domains, driven by the adoption of 10BASE-T1S. In such multidrop networks, collision-free and deterministic medium access is achieved through Physical Layer Collision Avoidance (PLCA). However, PLCA follows a node-based cyclic access structure that does not account for traffic priority, leading to high access latency for time-sensitive traffic and limited scalability with increasing network size. Existing PLCA extensions improve latency for selected devices but remain restricted to node-based access and do not support network-wide traffic differentiation. To address these limitations, this paper introduces a priority-based network access and scheduling mechanism for multidrop networks. The proposed approach decouples medium access from node-based ordering and enables class-based prioritization, allowing high-priority traffic from any device to be transmitted ahead of lower-priority traffic. It further supports a configuration that emulates Strict Priority (SP) scheduling, providing low and bounded access latency for highest-priority traffic. Analytical bounds on the worst-case access latency are derived, validated, and shown to be tight. Performance evaluation demonstrates that the proposed mechanism reduces the maximum observed access latency for high-priority traffic by over 65% compared to PLCA, with latency increasing by less than 1% as the network grows from 8 to 40 devices.
AI summaries use public titles and abstracts only. Research claims belong to the authors; consult the original paper.