A Kind of Schedule Table Based Fair Round Robin Scheduling Algorithms

TU Xiao-dong; LI Le-min

您当前的位置：

首页 >

文章列表页 >

A Kind of Schedule Table Based Fair Round Robin Scheduling Algorithms

更新时间：2025-07-16

- A Kind of Schedule Table Based Fair Round Robin Scheduling Algorithms
- Acta Electronica Sinica Vol. 29, Issue 9, Pages: 1290-1293(2001)
- 作者机构：
  
  电子科技大学光纤通信国家重点实验室,四川,成都,610054
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN915.2
- Published：2001
- 稿件说明：
移动端阅览
TU Xiao-dong, LI Le-min. A Kind of Schedule Table Based Fair Round Robin Scheduling Algorithms[J]. Acta Electronica Sinica, 2001, 29(9): 1290-1293.
DOI：

TU Xiao-dong, LI Le-min. A Kind of Schedule Table Based Fair Round Robin Scheduling Algorithms[J]. Acta Electronica Sinica, 2001, 29(9): 1290-1293. DOI：

摘要

本文研究了一类利用时标在调度表中安排信元发送时隙的公平轮循(Fair Round Robin

FRR)调度算法.对其中三种算法的性能进行了分析比较.FRR能够保证连接的带宽和时延

同时实现复杂性低于一些分组公平排队算法

例如WF

Q+.

Abstract

A kind of fair round robin(FRR) scheduling algorithms

which schedule the cell transmission slot in the schedule table by timestamps

are studied in this paper.The performance of three algorithms belonging to FRR are analyzed and compared.FRR can guarantee the bandwidth and delay of a connection

and the implementation complexity of FRR is lower than some of packet fair queuing(PFQ) algorithms

such as WF

Q+.

关键词

Keywords

references

Views

918

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

The Study and Perspective of Queue Scheduling Algorithms in Packet Switching Networks

Related Author

WANG Chong-gang

LONG Ke-ping

GONG Xiang-yang

CHENG Shi-duan

Related Institution

北京邮电大学程控交换技术与通信网国家实验室

⁰