Parallel Switching in Connection-Oriented Networks

Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An e cient packet-scheduling algorithm that guarantees a deterministic quality of service to connections with real-time constraints is proposed { this algorithm is a generalization of some recent multiprocessor scheduling algorithms, and o ers realtime performance guarantees similar to those o ered by earlier fair-scheduling strategies such as Weighted Fair Queueing and proportional-share schemes.

• Type: Conference
• Year: 1999
• Where: RTSS
• Authors: James H. Anderson, Sanjoy K. Baruah, Kevin Jeffay
• Keywords: Cient Packet-scheduling Algorithm, Control Systems, Multiprocessor Scheduling Algorithms, RTSS 1999, Weighted Fair Queueing