QoS Guaranteed Input Queued Scheduling Algorithms with Low Delay
نویسندگان
چکیده
| The enhanced Birkho -von Neumann decomposition (EBVND) algorithm, a new class of scheduling algorithms for input queued (IQ) switches, is introduced. Theoretical analysis shows that the performance of EBVND is better than the Birkho von Neumann decomposition algorithm in terms of throughput and cell delay, and can also provide rate and cell delay guarantees. Wave front Birkho -von Neumann decomposition (WFBVND) algorithm and its simpli ed version WFBVND with logN iterations (WFBVND-logN), the special cases of EBVND, are also introduced and evaluated. Simulations show that WFBVND and WFBVND-logN have much lower average cell delay as compared to the Birkho -von Neumann decomposition algorithm.
منابع مشابه
Cell Delay Modeling and Comparison of 2 Iterative Scheduling Algorithms for Atm Input - Queued Switches
A mathematical cell delay modeling and performance comparison of two iterative scheduling algorithms for ATM input-queued switch are carried out in this paper. The algorithms under consideration are iterative round robin with multiple classes (IRRM-MC) and iterative round robin with slip (iSLIP). By using Bernoulli arrivals a mathematical model is proposed for both algorithms. The developed mod...
متن کاملPacket scheduling in a combined input and output queued switch using virtual time reference system
There i s an increasing demand for Internet core nodes to have (I) quality-of-service (QoS) guarantees and (2) higher switching capacity. The combined input and output queued (CiOQ) switching has been shown to be a promising solution to meet such demand. However, many of the proposed scheduling algorithms fo r a CIOQ switch cannot be practically implemented due to problems from scalability and ...
متن کاملUniform weighted round robin scheduling algorithms for input queued switches
| This paper concentrates on obtaining uniform weighted round robin schedules for input queued packet switches. The desired schedules are uniform in the sense that each connection is serviced at regularly spaced time slots, where the spacing is proportional to the inverse of the guaranteed data rate. Suitable applications include ATM networks as well as satellite switched TDMA systems that prov...
متن کاملOn the Provision of Integrated Qos Guarantees of Switches * Unicast and Multicast Traffic in Input - Queued
In this paper, we address the problem of providing QoS guarantees for multiple input-queued switching architecture. Stable matching of inputs and outputs is used for scheduling the enqueued packets to be transmitted across the switching fabric. With an in-depth theoretic analysis on the properties of stable matching in the context of a multiple input-queued switch, we propose efficient schemes ...
متن کاملA combined low Latency and Weighted Fair Queuing based Scheduling of an input-Queued Switch
Input queuing has become dominant and popular building blocks for high speed crossbar switches with many ports and fast line rates because they require minimum speed-up of memory bandwidth. Input Queued switches with finite Virtual Output Queues guarantees QoS performance in terms of throughput and average delay. A switch performs two functions Queuing and Scheduling. Queue Management algorithm...
متن کامل