Abstract

An efficient fair queueing scheme which is feasible for broadband implementation is proposed and its performance is analyzed. The author defines fairness in a self-contained manner, eliminating the need for the hypothetical fluid-flow reference system used in the present state of art and thereby removing the associated computational complexity. The scheme is based on the adoption of an internally generated virtual time as the index of work progress, hence the name self-clocked fair queueing. The author proves that the scheme possesses the desired fairness property and is nearly optimal, in the sense that the maximum permissible disparity among the normalized services offered to the backlogged sessions is never more than two times the corresponding figure in any packet-based queueing system. >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.