Sciweavers

Share
RTSS
1999
IEEE

Parallel Switching in Connection-Oriented Networks

9 years 10 months ago
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.
James H. Anderson, Sanjoy K. Baruah, Kevin Jeffay
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where RTSS
Authors James H. Anderson, Sanjoy K. Baruah, Kevin Jeffay
Comments (0)
books