National Tsing Hua University Institutional Repository:A high-throughput cell scheduling algorithm for delay-sensitive traffic in broadband switching systems
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54367/62174 (87%)
造访人次 : 14170670      在线人数 : 55
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    National Tsing Hua University Institutional Repository > 電機資訊學院 > 資訊工程學系 > 會議論文  >  A high-throughput cell scheduling algorithm for delay-sensitive traffic in broadband switching systems


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/14164


    题名: A high-throughput cell scheduling algorithm for delay-sensitive traffic in broadband switching systems
    作者: Chen,Wen-Tsuen
    Liu,Huai-Jen
    Tsay,Yeong-Tsong
    教師: 陳文村
    日期: 1992
    出版者: Institute of Electrical and Electronics Engineers Inc
    關聯: INFOCOM '92. Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE
    4-8 May 1992 Page(s):2499-2508 vol.3
    关键词: Switching systems
    Telecommunication traffic
    Scheduling
    Algorithms
    Asynchronous sequential logic
    Queueing theory
    Computer networks
    摘要: The authors propose a cell scheduling algorithm to increase the throughput of an asynchronous transfer mode (ATM) switching system with services of diverse priority classes. The maximum throughput is increased up to 0.949. The efficiency (output trunk utilization)/(input trunk utilization) is almost equal to 100%, and is almost independent of the switch size and the traffic load. The cell scheduling algorithm is shown to be able to provide high throughput not only for higher priority classes but also for lower priority classes. The mean cell waiting time of the highest priority class are transmitted as soon as possible. In the switching system implemented with the present cell scheduling algorithm, it is sufficient for a sorting network to establish input/output paths through it simultaneously without conflicts and it is not necessary to append a routing network to a sorting network.
    相関连結: http://ieeexplore.ieee.org/Xplore/dynhome.jsp
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/14164
    显示于类别:[資訊工程學系] 會議論文
    [通訊工程研究所] 會議論文
    [電腦與通訊科技研發中心] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    2030201030002.pdf801KbAdobe PDF651检视/开启


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

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