Implementation strategies for scheduling algorithms in integrated-services packet-switched networks
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1733-1740
- https://doi.org/10.1109/glocom.1991.188660
Abstract
A range of potential architectures that may serve as a basis for the efficient implementation of scheduling algorithms with dynamic order is presented, and the feasibility of these architectures is considered, typically through comparison with common components of communications and computer systems. In the process, possible architectures for implementing static-order algorithms, such as earliest deadline first (EDF), are proposed. Since, to facilitate implementation, some architectures involve a simplification of the desired scheduling algorithm, the resulting performance degradation is explored, and the performances achieved with different architectures are compared. Sorted architectures are discussed, followed by unsorted architectures Author(s) Peha, J.M. Dept. of Electr. Eng., Stanford Univ., CA, USA Tobagi, F.A.Keywords
This publication has 18 references indexed in Scilit:
- A shared buffer memory switch for an ATM exchangePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Rate controlled servers for very high-speed networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Analysis of a delay-dependent priority discipline in an integrated multiclass traffic fast packet switchIEEE Transactions on Communications, 1990
- The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet SwitchingIEEE Journal on Selected Areas in Communications, 1987
- Dynamic, Non-Preemptive Priority Queues with General, Linearly Increasing Priority FunctionOperations Research, 1985
- Technical Note—A Note on Linearly Decreasing, Delay-Dependent Non-Preemptive Queue DisciplinesOperations Research, 1984
- A Mixed Delay Dependent Queue DisciplineOperations Research, 1982
- A Dynamic Priority Queue with General Concave Priority FunctionsOperations Research, 1979
- A Continuation of Delay-Dependent Queue DisciplinesOperations Research, 1970
- Time Dependent Priority QueuesOperations Research, 1967