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.
| Original language | English |
|---|---|
| Pages | 200-209 |
| Number of pages | 10 |
| State | Published - 1999 |
| Event | Proceedings of the 1999 20th IEEE Real-Time Systems Symposium (RTSS'99) - Phoenix, AZ, USA Duration: Dec 1 1999 → Dec 3 1999 |
Conference
| Conference | Proceedings of the 1999 20th IEEE Real-Time Systems Symposium (RTSS'99) |
|---|---|
| City | Phoenix, AZ, USA |
| Period | 12/1/99 → 12/3/99 |