Abstract
Weighted Fair Queuing (WFQ) is a good approximation of Generalized Processor Sharing (GPS) service principle, and can provide the delay guarantee when the bandwidth and the burst size are assured. Thus, WFQ can not satisfy the stringent delay requirement of some realtime networked applications with large burst size, such as video transmission. In order to better serve these applications, (m,k)-firm guarantee is integrated in QoS architecture. A fluid scheduling algorithm, (m,k)-GPS, and its packet approximating scheduling algorithm, (m,k)-WF2Q, are proposed. Dropping some optional packets, they guarantee low delay to flows with large burst size. Moreover, the fairness and computing complexity of (m,k)-WF2Q are the same as WF 2Q. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Yin, H., Wang, Z., & Sun, Y. (2005). Enhanced WFQ algorithm with (m,k)-firm guarantee. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3605 LNCS, pp. 339–346). Springer Verlag. https://doi.org/10.1007/11535409_48
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
