An Experimental Platform for Hard TSN

Guiraud, Maël; Leclerc, Brice; Marce, Olivier

doi:10.1109/ccnc49033.2022.9700643

Cited by 5 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, a solution to pazl is more efficient when implemented in real telecommunication networks, since we do not need a contention buffer at all. A switch taking full advantage of the absence of a buffer is presented in [28]. An unusual property of assignments is that given a routed network and a deadline, we may have a (P, τ ) assignment but no (P ′ , τ ) assignment with P ′ > P : the existence of an assignment is not monotone with regard to P .…”

Section: Periodic Assignment With Zero Latency (Pazl)mentioning

confidence: 99%

See 1 more Smart Citation

Deterministic Scheduling of Periodic Messages for Low Latency in Cloud RAN

Barth¹,

Guiraud²,

Strozecki³

2023

Preprint

View full text Add to dashboard Cite

Cloud-RAN (C-RAN) is an architecture for cellular networks, where processing units, previously attached to antennas, are centralized in data centers. The main challenge, to fulfill protocol time constraints, is to minimize the latency of the periodic messages sent from the antennas to their processing units and back. We show that statistical multiplexing suffers from high logical latency, due to buffering at nodes to avoid collisions. Hence, we propose to use a deterministic scheme for sending periodic messages without collision in the network, thus saving the latency incurred by buffering. We propose several algorithms to compute such schemes for star routed networks, a common topology where one link is shared by all antennas. First, we show there exist deterministic sending schemes without any buffering when the routes are short or the load is small. When the load is high, we allow buffering in processing units, and we propose the PMLS algorithm adapted from a classical scheduling method. Experimental results show that, even under full load, PMLS finds a deterministic sending scheme with no logical latency most of the time, while using statistical multiplexing adds very large latency. Moreover, PMLS runs in polynomial time and scales well to hundreds of antennas. Building on this algorithm, we also obtain very low latency periodic sending schemes that do not disrupt additional random traffic on the network. This article is an extended version of previous work presented at ICT[1].

show abstract

Section: Periodic Assignment With Zero Latency (Pazl)mentioning

confidence: 99%

“…The mutualization of links going to the data center is a low-cost solution for a fronthaul network for C-RAN. A Hard-TSN switch taking full advantage of the absence of buffers inside a star routed network guarantees zero jitters on flows [28]. Several patents on this technology have been already published, see for example [29,30].…”

Section: Introductionmentioning

confidence: 99%