English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14284625      Online Users : 174
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    National Tsing Hua University Institutional Repository > 研究中心 > 電腦與通訊科技研發中心 > 技術報告 >  CR switch: A load-balanced switch with contention and reservation


    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/13085


    Title: CR switch: A load-balanced switch with contention and reservation
    Authors: Yu,Chao-Lin
    Chang,Cheng-Shang
    Lee,Duan-Shin
    教師: 張正尚
    Date: 2007
    Publisher: Institute of Electrical and Electronics Engineers Inc.
    Relation: INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE,6-12 May 2007,Page(s) 1361 - 1369
    Keywords: buffer storage
    packet switching
    storage management
    Abstract: © 2007 Institute of Electrical and Electronics Engineers-Load-balanced switches have received a great deal of attention recently as they are much more scalable than other existing switch architectures in the literature. However, as there exist multiple paths for flows of packets to traverse through loadbalanced switches, packets in such switches may be delivered out of order. In this paper, we propose a new switch architecture, called the CR switch, that not only delivers packets in order but also guarantees 100% throughput. The key idea, as in a multiple access channel, is to operate the CR switch in two modes: (i) the contention mode in light traffic and (ii) the reservation mode in heavy traffic. To do this, we invent a new buffer management scheme, called I-VOQ (virtual output queue with insertion). With the I-VOQ scheme, we give rigorous mathematical proofs for 100% throughput and in order packet delivery of the CR switch. By computer simulations, we also demonstrate that the average packet delay of the CR switch is considerably lower than other schemes in the literature, including the uniform frame spreading scheme [8], the padded frame scheme [6] and the mailbox switch [41. © 2007 IEEE.
    Relation Link: http://www.ieee.org/portal/site
    URI: http://nthur.lib.nthu.edu.tw/handle/987654321/13085
    Appears in Collections:[電腦與通訊科技研發中心] 技術報告
    [通訊工程研究所] 會議論文
    [電腦與通訊科技研發中心] 會議論文
    [資訊工程學系] 會議論文

    Files in This Item:

    File Description SizeFormat
    2030162030005.pdf488KbAdobe PDF997View/Open


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

    SFX Query

    與系統管理員聯絡

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