• DocumentCode
    1906607
  • Title

    The Crosspoint-Queued Switch

  • Author

    Kanizo, Yossi ; Hay, David ; Keslassy, Isaac

  • Author_Institution
    Dept. of Comput. Sci., Technion - Israel Inst. of Technol., Haifa
  • fYear
    2009
  • fDate
    19-25 April 2009
  • Firstpage
    729
  • Lastpage
    737
  • Abstract
    This paper calls for rethinking packet-switch architectures by cutting all dependencies between the switch fabric and the linecards. Most single-stage packet-switch architectures rely on an instantaneous communication between the switch fabric and the linecards. Today, however, this assumption is breaking down, because effective propagation times are too high and keep increasing with the line rates. In this paper, we argue for a self-sufficient switch fabric by moving all the buffering from the linecards to the switch fabric. We introduce the crosspoint-queued (CQ) switch, a new buffered-crossbar switch architecture with large crosspoint buffers and no input queues, and show how it can be readily implemented in a single SRAM-based chip using current technology. For a crosspoint buffer size of one, we provide a closed-form throughput formula for all work-conserving schedules under uniform Bernoulli i.i.d. arrivals. Furthermore, we study the performance of the switch for larger buffer sizes and show that it nearly behaves as an ideal output-queued switch. Finally, we confirm our results using synthetic as well as trace-based simulations.
  • Keywords
    SRAM chips; packet switching; queueing theory; buffered- crossbar; crosspoint-queued switch; linecards; single SRAM-based chip; single-stage packet-switch architectures; switch fabric; uniform Bernoulli i.i.d. arrivals; Communication switching; Communications Society; Computer architecture; Computer science; Fabrics; Internet; Optical propagation; Packet switching; Switches; Throughput;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    INFOCOM 2009, IEEE
  • Conference_Location
    Rio de Janeiro
  • ISSN
    0743-166X
  • Print_ISBN
    978-1-4244-3512-8
  • Electronic_ISBN
    0743-166X
  • Type

    conf

  • DOI
    10.1109/INFCOM.2009.5061981
  • Filename
    5061981