A Practical Scheduling Algorithm to Achieve 100% Throughput in Input-Queued Switches
نویسندگان
چکیده
Input queueing is becoming increasingly used for high-bandwidth switches and routers. In previous work, it was proved that it is possible to achieve 100% throughput for input-queued switches using a combination of virtual output queueing and a scheduling algorithm called LQF. However, this is only a theoretical result: LQF is too complex to implement in hardware. In this paper we introduce a new algorithm called Longest Port First (LPF), which is designed to overcome the complexity problems of LQF, and can be implemented in hardware at high speed. By giving preferential service based on queue lengths, we prove that LPF can achieve 100% throughput.
منابع مشابه
Local Scheduling Policies in Networks of Packet Switches with Input Queues
A significant research effort has been devoted in recent years to the design of simple and efficient scheduling policies for Input Queued (IQ) and Combined Input Output Queued (CIOQ) packet switches. As a result, a number of switch control algorithms have been proposed. Among these, scheduling policies based on Maximum Weight Matching (MWM) were identified as optimal, in the sense that they wer...
متن کاملScheduling VOQ Switches under Non-Uniform Traffic
Abstract — Input queueing is becoming increasingly important for high-bandwidth switches and routers. In previous work, we proved that it is possible to achieve 100% throughput for input-queued switches using a cell-by-cell scheduling algorithm called LQF. However, LQF is too complex to implement in hardware. In this paper we introduce a new algorithm called Longest Port First (LPF), which is d...
متن کاملPractical Scheduling Algorithms for Input - Queued
| The input-queued (IQ) switching architecture is becoming an attractive alternative for high speed switches owing to its scalability. In this paper, two new algorithms, referred to as maximum credit rst (MCF) algorithm and iterative maximum credit rst (IMCF) algorithm, are introduced. Theo-retic analysis shows that the credits of an IQ switch using MCF are bounded for all admissible rate reser...
متن کاملOn the stability of local scheduling policies in networks of packet switches with input queues
A significant research effort has been devoted in recent years to the design of simple and efficient scheduling policies for input queued (IQ) and combined input–output queued (CIOQ) packet switches. As a result, a number of switch control algorithms have been proposed. Among these, scheduling policies based on maximum weight matching (MWM) were identified as optimal, in the sense that they wer...
متن کاملFair Scheduling in Input-Queued Switches
Input-queued switch architecture has become attractive in the context of high performance networking because the switching fabric and the buffer need not run at a multiple (speedup) of the external link’s rate. With the expanding of network applications, the networks should provide QoS guarantees and QoS control is becoming a major issue in 1the design of high-performance switches. The scheduli...
متن کامل