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.
A Linux Real-Time Packet Scheduler for Reliable Static SDN Routing
2017-01-01
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
A Scalable Grid Scheduler for Real-Time Applications
British Library Online Contents | 2009
|Real-time simulation using Linux
AIAA | 2001
|A Real-Time Kernel Integrated with an Off-Line Scheduler
British Library Conference Proceedings | 1995
|Robust Scheduler Design for Automatic Mechanical Transmission Real-time Control
SAE Technical Papers | 2006
|