Advanced Search
Volume 29 Issue 4
Jan.  2011
Turn off MathJax
Article Contents
ZHAO Bin, WANG Gang, WANG Donglei. Research on the Resonant Current of the LCLC Resonant Converters[J]. Journal of Electronics & Information Technology, 2017, 39(6): 1479-1486. doi: 10.11999/JEIT160752
Citation: Yang Fan, Liu Zeng-ji, Qiu Zhi-liang, Liu Huan-feng. A Fair Round Robin Scheduling Algorithm with Low Latency[J]. Journal of Electronics & Information Technology, 2007, 29(4): 785-788. doi: 10.3724/SP.J.1146.2006.00152

A Fair Round Robin Scheduling Algorithm with Low Latency

doi: 10.3724/SP.J.1146.2006.00152
  • Received Date: 2006-02-16
  • Rev Recd Date: 2006-08-14
  • Publish Date: 2007-04-19
  • A new round robin scheduling algorithm named LFRR(Large weight First Round Robin) is proposed in this paper. In order to achieve good delay property and low implementation complexity, several methods are taken in LFRR. Firstly, when slots are allocated for flows in the schedule table, LFRR refers to the ideal situation where the slots of each flow are uniformly distributed in the schedule table to prevent flows slots from appearing too early or too late. Secondly, in LFRR system flows which weights are the same and larger than 1 are aggregated into a virtual flow. LFRR deals with virtual flows instead of actual flows. This deceases the flow number that scheduling algorithm deals with. Thirdly, when a slot can be allocated to several virtual flows, flows with larger weight have high priority to posses this slot. Theoretical and simulation results show the delay property of LFRR is much better than that of WRR(Weighted Round Robin) and the fairness of LFRR can be guaranteed.
  • [1] Parekh A and Gallager R. A generalized processor sharing approach to flow control: The single node case[J].IEEE/ACM Trans. on Networking.1993, 1(3):344-357 [2] Katevenis M and Sidiropoulos S. Weighted round-robin cell multiplexing in a general purpose ATM switch chip[J].IEEE Journal on Selected Areas on Communication.1991, 9(8):1265-1279 [3] Matsufuru N and Aibara R. Efficient fair queueing for ATM networks using uniform round robin. In Proc. IEEE INFOCOM 1999, New York: 389-397. [4] Saha D and Mukherjee S. Carry-over round robin : A simple cell scheduling mechanism for ATM networks[J].IEEE/ACM Trans. on Networking.1998, 6(6):779-795 [5] Onur, Yukio, and Teruaki. Urgency-based round robin: A new scheduling discipline for packet switching networks. in Proc. IEEE INFOCOM 1998, San Francisco: 1179-1184. [6] Dimitrios Stiliadis and Nnujan Varma. Latency-rate servers: A general model for analysis of traffic scheduling algorithms[J].IEEE/ACM Trans. on Networking.1998, 6(5):611-624
  • Cited by

    Periodical cited type(6)

    1. 李云飞,冯珂珂,张飞,陈斌,车延超,金岩. 基于频谱细化算法的超声多普勒流量计设计. 传感器与微系统. 2024(10): 79-83 .
    2. 邢涛,马春铭,冯亮,李爽,韦立登,李军. 一种用于距离维复杂空变多普勒SAR成像的改进运动补偿方法. 电子与信息学报. 2022(03): 1059-1066 . 本站查看
    3. 姚山峰,贺青,欧阳鑫信,杨宇翔. 一种低轨双星高脉冲重复频率雷达信号的定位模糊消除算法. 电子与信息学报. 2021(03): 598-605 . 本站查看
    4. 赵晨,乔钢,周锋. 基于正交移动双水下自主潜航器的水下合作目标定位方法. 电子与信息学报. 2021(03): 834-841 . 本站查看
    5. 张轶,翟盛华,陶海红. 单星多波束天线下基于压缩感知的多目标干扰定位. 电子与信息学报. 2021(07): 1872-1878 . 本站查看
    6. 曲志昱,王超然,孙萌. 基于改进迭代扩展卡尔曼滤波的3星时频差测向融合动目标跟踪方法. 电子与信息学报. 2021(10): 2871-2877 . 本站查看

    Other cited types(2)

  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (3381) PDF downloads(777) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return