Chia Nan University of Pharmacy & Science Institutional Repository:Item 310902800/21631
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 18074/20272 (89%)
造访人次 : 4308603      在线人数 : 5701
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://ir.cnu.edu.tw/handle/310902800/21631


    標題: A Fast-convergent Fairness Scheme for Resource Allocation in RPR Networks
    作者: Chuan-Gang Liu
    Jung-Shian Li
    劉川綱
    貢獻者: 資訊管理系
    關鍵字: RPR fairness scheme
    AM
    CM
    RIAS
    DVSR
    日期: 2008-02
    上傳時間: 2009-09-23 16:05:04 (UTC+8)
    摘要: In this paper, we propose a fast-convergent fairness scheme in IEEE 802.17 resilient packet ring (RPR) networks. In the proposed scheme, each station could rapidly approach fair rate by estimating the number of unbounded flows at each link. In addition, the fast-convergent scheme could prevent rate oscillations in the RPR aggressive mode scheme under unbalanced traffic. The estimation mechanism is simple and scalable since it is stateless without per-flow management. Through analytical and simulation evaluations our scheme was found to be stable and speedy when compared with 802.17 RPR fairness scheme or the proposed distributed virtual-time scheduling in rings scheme. Our scheme could allocate bandwidth fairly and smoothly among flows and achieve high utilization at the same time in the RPR network
    關聯: International journal of communication systems 21(7):p.773-789
    显示于类别:[資訊管理系] 期刊論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    0KbUnknown2293检视/开启
    97_66.pdf615KbAdobe PDF352检视/开启


    在CNU IR中所有的数据项都受到原著作权保护.

    TAIR相关文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈