Abstract
Some real-time networked applications, such as video transmission, allow a few misses. To better transmit these applications with large burst size or average rate (m, k)-firm guarantee is integrated in QoS architecture. Because WFQ is one of the most popular scheduling algorithms implemented in commercial routers, a weighted fair queuing scheduling algorithm based on (m, k)-firm, (m, k)-WF/sup 2/Q, is proposed. In this paper, a fluid scheduling model, (m, k)-GPS, is proposed firstly. Then, (m, k)-WF/sup 2/Q (a packet-by-packet scheduling algorithm) is showed. Moreover, the worst-case delay bound of (m, k)-WF/sup 2/Q is derived using Network Calculus, and (m, k)-patterns appropriate to (m, k)-WF/sup 2/Q are discussed. Simulation results show that (m, k)-WF/sup 2/Q can provide lower delay than WFQ and (m, k)-WF/sup 2/Q is a fair and feasible queuing scheduling algorithm.
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 callDisclaimer: 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.
