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 under highly asymmetric load. In this paper we compare existing algorithms and propose a new algorithm for weighted matching with a delay performance close to the ideal maximum weight matching. As an important step towards implementation we emphasize the finite wordlength required for weights. This can be exploited to support priorities which is required for ATM or IPv6 switches.
منابع مشابه
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...
متن کامل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...
متن کاملEE384Y Project Intermediate Report Enabling Class of Service for CIOQ Switches with Maximal Matching Algorithms
Providing Qualities of Service (QoS) is a desirable feature for most network routers and switches. The capability to service differential classes is a prerequisite to enable QoS. It has been shown that Output Queued (OQ) switches implementing Weighted Fair Queuing (WFQ) can provide QoS. However, OQ switches have high speed requirements for the fabric switch and the memory bandwidth, which makes...
متن کامل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...
متن کاملStatic Bandwidth Allocation for Input-Queued Switches with strict QoS Bounds
Input buffered switches are known to suffer from head-of-line blocking that limits the throughput to 58.6%. It has been shown that with virtual output queueing (VOQ) 100% throughput can be achieved using arbitration algorithms. While dynamic algorithms decide based on some metrics in each time slot, a static arbitration called allocation reserves time slots for specific connections in advance. ...
متن کامل