Tiny Tera: a packet switch core
Reads0
Chats0
TLDR
Tiny Tera as mentioned in this paper is an input-buffered switch, which makes it the highest bandwidth switch possible given a particular CMOS and memory technology. But it does not support multicasting.Abstract:
Describes Tiny Tera: a small, high-bandwidth, single-stage switch. Tiny Tera has 32 ports switching fixed-size packets, each operating at over 10 Gbps (approximately the Sonet OC-192e rate, a telecom standard for system interconnects). The switch distinguishes four classes of traffic and includes efficient support for multicasting. We aim to demonstrate that it is possible to use currently available CMOS technology to build this compact switch with an aggregate bandwidth of approximately 1 terabit per second and a central hub no larger than a can of soda. Such a switch could serve as a core for an ATM switch or an Internet router. Tiny Tera is an input-buffered switch, which makes it the highest bandwidth switch possible given a particular CMOS and memory technology. The switch consists of three logical elements: ports, a central crossbar switch, and a central scheduler. It queues packets at a port on entry and optionally prior to exit. The scheduler, which has a map of each port's queue occupancy, determines the crossbar configuration every packet time slot. Input queueing, parallelism, and tight integration are the keys to such a high-bandwidth switch. Input queueing reduces the memory bandwidth requirements: When a switch queues packets at the input, the buffer memories need run no faster than the line rate. Thus, there is no need for the speedup required in output-queued switches.read more
Citations
More filters
Book
Principles and Practices of Interconnection Networks
William J. Dally,Brian Towles +1 more
TL;DR: This book offers a detailed and comprehensive presentation of the basic principles of interconnection network design, clearly illustrating them with numerous examples, chapter exercises, and case studies, allowing a designer to see all the steps of the process from abstract design to concrete implementation.
Journal ArticleDOI
The iSLIP scheduling algorithm for input-queued switches
TL;DR: This paper presents a scheduling algorithm called iSLIP, an iterative, round-robin algorithm that can achieve 100% throughput for uniform traffic, yet is simple to implement in hardware, and describes the implementation complexity of the algorithm.
Proceedings ArticleDOI
Fast and scalable layer four switching
TL;DR: Two new algorithms for solving the least cost matching filter problem at high speeds are described, based on a grid-of-tries construction and works optimally for processing filters consisting of two prefix fields using linear space.
Journal ArticleDOI
Fast address lookups using controlled prefix expansion
V. Srinivasan,George Varghese +1 more
TL;DR: The main technique, controlled prefix expansion, transforms a set of prefixes into an equivalent set with fewer prefix lengths, and optimization techniques based on dynamic programming, and local transformations of data structures to improve cache behavior are used.
Journal ArticleDOI
Matching output queueing with a combined input/output-queued switch
TL;DR: It is demonstrated that a combined input/output-queueing (CIOQ) switch running twice as fast as an input-queued switch can provide precise emulation of a broad class of packet-scheduling algorithms, including WFQ and strict priorities.
References
More filters
Book
Data Structures and Network Algorithms
TL;DR: This paper presents a meta-trees tree model that automates the very labor-intensive and therefore time-heavy and therefore expensive process of manually selecting trees to grow in a graph.
Journal ArticleDOI
Input Versus Output Queueing on a Space-Division Packet Switch
TL;DR: Two simple models of queueing on an N \times N space-division packet switch are examined, and it is possible to slightly increase utilization of the output trunks and drop interfering packets at the end of each time slot, rather than storing them in the input queues.
Journal ArticleDOI
High-speed switch scheduling for local-area networks
TL;DR: Issues in the design of a prototype switch for an arbitrary topology point-to-point network with link speeds of up to 1 Gbit/s are described and a technique called statistical matching is described, which can be used to ensure fairness at the switch and to support applications with rapidly changing needs for guaranteed bandwidth.
Proceedings ArticleDOI
Achieving 100% throughput in an input-queued switch
TL;DR: This paper proves that if a suitable queueing policy and scheduling algorithm are used then it is possible to achieve 100% throughput for all independent arrival processes.
Scheduling algorithms for input-queued cell switches
TL;DR: The algorithms described in this thesis are designed to schedule cells in a very high-speed, parallel, input-queued crossbar switch, and it is proved that LQ although too complex to implement in hardware, is stable under all admissible i.i.d. offered loads.