Parallel switching in connection-oriented networks
- 20 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 200-209
- https://doi.org/10.1109/real.1999.818843
Abstract
Packet switching in connection-oriented networksthat may have multiple parallel links between pairs ofswitches is considered. An efficient packet-schedulingalgorithm that guarantees a deterministic quality ofservicetoconnections with real-time constraints is proposed-- this algorithm is a generalization of some recentmultiprocessor scheduling algorithms, and offers realtimeperformance guarantees similar to those offeredby earlier fair-scheduling strategies such as WeightedFair Queueing ...Keywords
This publication has 7 references indexed in Scilit:
- A proportional share resource allocation algorithm for real-time, time-shared systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- WF/sup 2/Q: worst-case fair weighted fair queueingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast scheduling of periodic tasks on multiple resourcesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Proportionate progress: A notion of fairness in resource allocationAlgorithmica, 1996
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Comparison of rate-based service disciplinesACM SIGCOMM Computer Communication Review, 1991
- Virtual clock: a new traffic control algorithm for packet switching networksACM SIGCOMM Computer Communication Review, 1990