Prioritized Arbitration for Input-queued Switches with 100% Throughput
نویسندگان
چکیده
Input buffered switches are known to suffer from head-of-line (HOL) blocking that limits the throughput to approximately 58.6%. It has been shown that 100% throughput can be achieved with virtual output queueing (VOQ) and an arbitration algorithm that controls the access to the switch fabric in each time slot. No weight-dependent algorithm was known that supports priorities, which are necessary for the isolation of connections with different QoS requirements in ATM or IPv6 switches. In this paper we show how a weighted matching can be extended to support priorities in order to separate CBR, VBR and ABR traffic. The number of bits per priority is exposed as the main parameter. Based on simulation results the priority performance is evaluated for the ideal algorithm and an approximation SIMP which offers a delay performance close to the ideal maximum weight matching.
منابع مشابه
Weighted Arbitration Algorithms with Priorities for Input-Queued Switches with 100% Throughput
Input buffered switches have the strong advantage of efficient crossbar usage. Virtual Output Queueing (VOQ) has to be established to circumvent the head-of-line (HOL) blocking which limits the throughput to 58.6%. Arbitration algorithms control the access to the switch fabric in each time slot. Weighted algorithms achieve 100% throughput with lowest delays under all admissible traffic even und...
متن کاملHigh Speed Networks A FAST ARBITRATION SCHEME FOR TERABIT PACKET SWITCHES
Input-output queued switches have been widely considered as the most feasible solution for large capacity packet switches and IP routers. The challenge is to develop a high speed and cost-effective arbitration scheme to maximize the switch throughput and delay performance for supporting multimedia services with various quality-of-service (QoS) requirements. In this paper, we propose a ping-pong...
متن کاملPerformance of Prioritized i-SLIP Algorithm with Multiple Input Queued Switch
Input Queued Switch has throughput limitation of 58%.Hence concept of Virtual Output Queue is evolved. Selection of ‘N’ cells out of N is difficult task. Prof.Nick Mckeown from Stanford University had suggested i-slip algorithm to provide throughput of 100%. Multiple Input Queued Switch is generalized case of Input Queued Switch, where M indicates number of queues/port. When M=N, its VOQ. When ...
متن کاملDesynchronized Two-Dimensional Round-Robin Scheduler for Input Buffered Switches
We propose a new arbitration algorithm, called the desynchronized two-dimensional round-robin (D2DRR), for input queued packet switches in which each input port maintains a separate logical queue for each output. D2DRR is an enhanced version of 2DRR, and thus improves fairness over 2DRR without a starvation problem. Iterative maximal matching schemes including iSLIP yield better throughput with...
متن کاملBasic Characteristics of FIFO Packet Switches
In this paper we compare characteristics of different FIFO packet switch types. In accordance with our expectations, the best results are obtained by using the output-queued packet switches. The main drawback of these switches is the need for a fast switching fabric. This can be avoided by using the input-queued packet switches, whose performance depends upon individual packet sizes. Characteri...
متن کامل