2026-08-11T18:44:57Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7170 2024-03-06T10:39:55Z ddc:004 open_access

A Linux Real-Time Packet Scheduler for Reliable Static SDN Routing Qian, Tao Mueller, Frank Xin, Yufeng Real-time Networks Packet Scheduling Deadline Guarantee In a distributed computing environment, guaranteeing the hard deadline for real-time messages is essential to ensure schedulability of real-time tasks. Since capabilities of the shared resources for transmission are limited, e.g., the buffer size is limited on network devices, it becomes a challenge to design an effective and feasible resource sharing policy based on both the demand of real-time packet transmissions and the limitation of resource capabilities. We address this challenge in two cooperative mechanisms. First, we design a static routing algorithm to find forwarding paths for packets to guarantee their hard deadlines. The routing algorithm employs a validation-based backtracking procedure capable of deriving the demand of a set of real-time packets on each shared network device, and it checks whether this demand can be met on the device. Second, we design a packet scheduler that runs on network devices to transmit messages according to our routing requirements. We implement these mechanisms on virtual software-defined network (SDN) switches and evaluate them on real hardware in a local cluster to demonstrate the feasibility and effectiveness of our routing algorithm and packet scheduler. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Tao Qian and Frank Mueller and Yufeng Xin 2017 Is Part Of LIPIcs, Volume 76, 29th Euromicro Conference on Real-Time Systems (ECRTS 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ECRTS.2017.25 urn:nbn:de:0030-drops-71707 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2017.25 eng https://creativecommons.org/licenses/by/3.0/legalcode