Fair queueing has been an important issue in the multimedia networks where resources are shared among nodes both wired and wireless. Most fair queuing algorithms based on the generalized processor sharing (GPS) emphasize fairness and bounded delay guarantee, while overlooking service differentiation for different service classes of their own delay bounds. In this paper, we propose a new fair queueing scheme, delay guaranteed fair queueing (DGFQ), which guarantees bounded delay for the classes of flows according to their individual delay requirements for multimedia services in the wireless packet networks. © IFIP International Federation for Information Processing 2003.
CITATION STYLE
Yang, H., & Kim, K. (2003). Delay guaranteed fair queueing(DGFQ) in multimedia packet networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2839, 170–182. https://doi.org/10.1007/978-3-540-39404-4_13
Mendeley helps you to discover research relevant for your work.