National Tsing Hua University Institutional Repository:CR switch: A load-balanced switch with contention and reservation
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14751990      Online Users : 102
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
    NTHUR > Research & Development Office > Computer and Communication Research Center  > CCRC Technical Reports  >  CR switch: A load-balanced switch with contention and reservation

    Please use this identifier to cite or link to this item:

    Title: CR switch: A load-balanced switch with contention and reservation
    Authors: Yu,Chao-Lin
    Teacher: 張正尚
    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:
    Appears in Collections:[Computer and Communication Research Center ] CCRC Technical Reports
    [Institute of Communications Engineering] COM Conference Papers
    [Computer and Communication Research Center ] CCRC Conference Papers
    [Department of Computer Science] CS Conference Papers

    Files in This Item:

    File Description SizeFormat
    2030162030005.pdf488KbAdobe PDF1013View/Open


    SFX Query


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