Responsive aperiodic services in high-speed networks
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A fast packet-switched network is considered that transmits fixed-sized packets or cells and provides connection-oriented services. A number of rate-based service disciplines that offer timing guarantees have recently been proposed. These disciplines work well for connections which exhibit low burstiness or whose burstiness can be managed by admission control. However, some messages have irregular arrival patterns, but must be delivered with low delay. These aperiodic messages include connection set-up/tear-down messages, link-slate updates, and other status or alarm messages. The authors propose techniques that significantly minimize aperiodic message delay without jeopardizing guarantees made to existing connections. Simple hardware implementations of these techniques that can be embedded in output queues of fast packet-switches are also describedKeywords
This publication has 8 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished 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
- VirtualClockACM Transactions on Computer Systems, 1991
- Guaranteed Performance Communication in High Speed NetworksPublished by Defense Technical Information Center (DTIC) ,1991
- A stop-and-go queueing framework for congestion managementPublished by Association for Computing Machinery (ACM) ,1990
- A scheme for real-time channel establishment in wide-area networksIEEE Journal on Selected Areas in Communications, 1990
- Analysis and simulation of a fair queueing algorithmPublished by Association for Computing Machinery (ACM) ,1989
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973