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.
@InProceedings{qian_et_al:LIPIcs.ECRTS.2017.25, author = {Qian, Tao and Mueller, Frank and Xin, Yufeng}, title = {{A Linux Real-Time Packet Scheduler for Reliable Static SDN Routing}}, booktitle = {29th Euromicro Conference on Real-Time Systems (ECRTS 2017)}, pages = {25:1--25:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-037-8}, ISSN = {1868-8969}, year = {2017}, volume = {76}, editor = {Bertogna, Marko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2017.25}, URN = {urn:nbn:de:0030-drops-71707}, doi = {10.4230/LIPIcs.ECRTS.2017.25}, annote = {Keywords: Real-time Networks, Packet Scheduling, Deadline Guarantee} }
Feedback for Dagstuhl Publishing