Enhanced WFQ algorithm with (m,k)-firm guarantee

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3605 LNCS, Issue , 2005, Pages 339-346

  Yin, Hongxia ^a   Wang, Zhi ^a   Sun, Youxian ^a  

^a ZHEJIANG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTER ARCHITECTURE; INFORMATION SERVICES; PROGRAM PROCESSORS; QUALITY OF SERVICE; QUEUEING NETWORKS;

GENERALIZED PROCESSOR SHARING (GPS); QOS ARCHITECTURE; SCHEDULING ALGORITHM; VIDEO TRANSMISSION;

LEARNING ALGORITHMS;

EID: 33646005179     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11535409_48     Document Type: Conference Paper

References (7)

1. Parekh, A. and Gallager, R.: A generalized processor sharing approach to flow control-The single node case. ACM/IEEE Transactions on Networking. 6 (1993) 344-357
2. Chronopoulos, A.T., Yaprak, C.Tang, E.: An Efficient ATM Network Switch Scheduling. IEEE Transactions on Broadcasting, 9 (2003) 110-117
3. Koubaa, A. and Song, Y.Q.: Loss-Tolerant QoS using Firm Constraints in Guaranteed Rate Networks. IEEE RTAS'04, (2004) 526-535
4. Bennett, J.C.R. and Zhang, H.: WF2Q: Worst-case fair weighted fair queuing. IEEE INFOCOM'96. (1996) 120-128
5. Hamdaoui, M. and Ramanathan, P.: A Dynamic Priority Assignment Technique for Streams with (m,k)-Firm Deadlines. IEEE Transactions on Computers. 12 (1995) 1443-1451
6. Lindsay, W. and Ramanathan, P.: DBP-M: A technique for meeting the end-to-end (m,k)-firm guarantee requirements in point-to-point networks. Proceedings of Conference on Local Computer Networks. (1997) 294-303
7. Yin, H.X., Wang, Z., Sun, Y.X.: A weighted Fair Queuing Scheduling Algorithm with (m,k)-Firm Guarantee. IEEE IECON'04. (2004)