Parallel Switching in Connection-Oriented Networks

J.H. Anderson, S. Baruah, and K. Jeffay
Proceedings of the 20th IEEE Real-Time Systems Symposium
Phoenix, AZ, December 1999
pages 200-209.

Abstract: Packet switching in connection-oriented networks that may have multiple parallel links between pairs of switches is considered. An efficient 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 offers real-time performance guarantees similar to those offered by earlier fair-scheduling strategies such as Weighted Fair Queueing and proportional-share schemes.

Get a PostScript - or - PDF copy of this paper.

Back to Real-Time Systems Research at UNC page.