@article{01JCZC0TGH72JC7B35FQ6Q2HX4,
  abstract     = {{Next-generation Internet will require strict end-to-end delay guarantees to support upcoming latency-sensitive applications. The IEEE 802.1 Time-Sensitive Networking (TSN) standard has become the de-facto solution for Ethernet-based L2 networks to support applications with strict latency, jitter and packet loss requirements. The IETF DetNet Working Group tries to expand on TSN to support real-time applications over larger-scale L3 networks. This paper proposes control and routing strategies that provide latency guarantees in L3 networks without requiring time synchronization among nodes. The proposed strategies include a link-state routing protocol and several exploration-based protocols that exploit queue-level information and network calculus to provide latency guarantees. Additionally, the use of queueing delay budgets enables independence among flows, while enabling fine-grained routing. This allows to make better routing decisions and to support applications with diverse latency requirements. Moreover, traffic shaping is only required at the network ingress. The strategies are evaluated extensively and compared in a simulation environment in multiple large-scale scenarios, considering acceptance rate, network utilization, path dissemination time, control overhead, and memory consumption, as well as how these metrics evolve w.r.t. different network scales. Experimental results demonstrate that representative delay-constrained traffic demands can be accommodated adequately by queue-level link-state routing protocols only in smaller-scale networks. In larger-scale network scenarios, breadth-first exploration-based protocols are required to provide stable performance w.r.t. acceptance rate and path dissemination times at the cost of only linearly increasing control overhead and memory footprint.}},
  author       = {{Miserez, Jakob and Colle, Didier and Pickavet, Mario and Tavernier, Wouter}},
  issn         = {{1932-4537}},
  journal      = {{IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT}},
  keywords     = {{Routing,Delays,Synchronization,Routing protocols,Computer architecture,Calculus,Probes,Deterministic networking,DetNet,time-sensitive networking,TSN,priority queueing,network calculus}},
  language     = {{eng}},
  number       = {{5}},
  pages        = {{5260--5272}},
  title        = {{Exploiting queue information for scalable delay-constrained routing in deterministic networks}},
  url          = {{http://doi.org/10.1109/TNSM.2024.3435769}},
  volume       = {{21}},
  year         = {{2024}},
}

Altmetric

View in Altmetric

Web of Science

Times cited: