A Self-Clocked Fair Queueing Scheme for Broadband Applications
نویسنده
چکیده
A n ef ic ient fa i r queueing scheme which is feasible f o r broadband implementation i s proposed and i ts performance i s analyzed. W e define fairness in a selfcontained manner, eliminating the need f o r the hypothetical fluid-flow reference sys tem used in the present state of art and thereby removing the associated computational complexity. The scheme i s based on the adoption of an internally generated virtual time as the index of work progress, hence the name self-clocked fair queueing. W e prove that the scheme possesses the desired fairness property and i s nearly optimal, in the sense that the maximum permissible disparity among the normalized services offered to the backlogged sessions is newer more than two t imes the corresponding figure in any packet-based queueing system.
منابع مشابه
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...
متن کاملChannel condition self-clocked packet scheduling scheme for wireless networks
Since mobile hosts suffer from burst and location-dependent channel errors in wireless networks, packet fair queueing algorithm in wireline networks cannot be applied directly to wireless networks. Generally, a fair scheduler in a wireless network retains the virtual time of flow when the flow encounters channel errors. This results to the flow having higher priority when it exits from errors, ...
متن کاملLeap Forward Virtual Clock : A New Fair Queuing Scheme
We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglog N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the...
متن کاملLeap Forward Virtual Clock : A New Fair
We describe an eecient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds similar to WFQ, along with throughput fairness. Our scheme can be implemented with a worst-case time O(loglog N) per packet (inclusive of sorting costs), which improves upon all previously known schemes that guarantee delay and throughput fairness similar to WFQ. Interestingly, both the...
متن کامل