Stop-and-Go Service Using Hierarchical Round Robin
نویسنده
چکیده
The Stop-and-Go service discipline allows a rate-controlled Virtual Circuit to obtain (small) delay-jitter bounds independent of the number of hops along its path. This may prove to be desirable for isochronous applications in wide-area virtual circuit networks. We consider how to integrate the Stop-and-Go and Hierarchical Round Robin service disciplines to allow delay-jitter bounded communication in large homoge
منابع مشابه
Stability Improvement of Hydraulic Turbine Regulating System Using Round-Robin Scheduling Algorithm
The sustainability of hydraulic turbines was one of the most important issues considered by electrical energy provider experts. Increased electromechanical oscillation damping is one of the key issues in the turbines sustainability. Electromechanical oscillations, if not quickly damp, can threaten the stability of hydraulic turbines and causes the separation of different parts of the netw...
متن کاملEfficient and fair hierarchical packet scheduling using dynamic deficit round robin
This paper proposes a new hierarchical packet scheduling algorithm, HDDRR, enhanced from the existing dynamic deficit round-robin (DDRR) to provide relative differentiated service that enables support of delay-sensitive applications over the Internet. The level of service differentiation can be adjusted with parameter. The HDDRR scheduler fully utilizes the property of DDRR, therefore it can ac...
متن کاملA simple and effective scheduling mechanism using minimized cycle round robin
packet and cell switched networks. We demonstrate that MCRR exhibits optimal worst-case latency property in a certain class of weighted round robin (WRR) approaches which are currently used for packet (cell) scheduling in high-speed networks, such as ATM networks. We further present a Hierarchical MCRR (HMCRR) mechanism to maximize the efficacy of MCRR in practice and be scalable to large numbe...
متن کاملRate Controlled Servers for Very High-Speed Networks
Future high-speed networks are expected to carry traffic with a wide range of performance requirements. We describe two queue service disciplines, rate-based scheduling and hierarchical round robin scheduling, that allow some connections to receive guaranteed rate and jitter performance, while others receive best effort service. Rate-based scheduling is designed for fast packet networks, while ...
متن کاملPerformance Evaluation of Multilevel-Assignment Hierarchical Round-Robin Bandwidth Scheduling for ATM
In ATM networks, the issue of bandwidth scheduling is critical to satisfying quality-of-service requirements of individual connections. This paper discusses a modiied implementation of a previously proposed scheduler called Hierarchical Round-Robin (HRR). We show this HRR is appropriate for ATM because it can guarantee a minimum rate of service (which is critical for real-time connections), is ...
متن کامل