LL-DRR:一种有效的用于高速分组网络的调度算法

Abstract
Figure/Table
References
Related Citation (15)

Download: PDF (1125 KB)
Export: BibTeX | EndNote (RIS)

Abstract A novel fair queuing algorithm LL-DRR(Low Latency Deficit Round Robin)is proposed in this paper, which is based on DRR (Deficit Round Robin) algorithm and suitable to schedule variable length packets. The simulation and theoretical analysis show that the delay performance of LL-DRR is much better than DRR, and the maximum packet delay of a session in LL-DRR is independent of the number of sessions. LL-DRR can support real time service. LL-DRR inherits the fairness of DRR on average throughput. LL-DRR is simple to implement and applicable to high speed networks.

Key words： Packet fair queuing Deficit round robin Low latency deficit round robin

Received: 28 August 2000

PACS:

TN919.3

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors


	Tu Xiaodong
	Li Lemin

Cite this article:

Tu Xiaodong,Li Lemin. LL-DRR: An efficient scheduling algorithm for packet networks[J]. , 2002, 24(3): 361-369 .

URL:

http://jeit.ie.ac.cn/EN/ OR http://jeit.ie.ac.cn/EN/Y2002/V24/I3/361