FIRM: a class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues

Serpanos, Dimitrios; Antoniadis, Panayotis

doi:10.1109/infcom.2000.832228

Cited by 106 publications

(54 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some of the scheduling algorithms are LQF (Kumar et al, 2004), OCF (Serpanos and Antoniadis, 2000) and LPF (Mekkittikul and McKeown, 1996). However, MWM has intrinsically high computation complexity that is translated into long resolution time and high hardware complexity.…”

Section: Input Queuingmentioning

confidence: 99%

A Combined Low Latency and Weighted Fair Queuing Based Scheduling of an Input-Queued Switch

Raghupathikumar¹

2014

Journal of Computer Science

View full text Add to dashboard Cite

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 manages the size of the queues and drops packets when necessary or appropriate. Scheduling algorithms determine next packet to transfer and solves conflicts with the switching fabric. Fairness and Starvation are another two properties of IQ switches and it is analyzed in finite VOQ in this works. Fairness performs fair allocation of bandwidth among flows and prevents flows from misbehaving flows. Starvation of VOQ prevents serving High priority queue. The motivation behind this study is to schedule the HoL packets queued in finite VOQs by Framing with Low Latency Queuing (LLQ) and Weighted Fair Queueing (WFQ). This queueing technique of VOQ is measured in terms of throughput and average delay by fair allocation of bandwidth with WFQ and Starvation-free queue with LLQ.

show abstract

Section: Input Queuingmentioning

confidence: 99%

A Combined Low Latency and Weighted Fair Queuing Based Scheduling of an Input-Queued Switch

Raghupathikumar¹

2014

Journal of Computer Science

View full text Add to dashboard Cite

show abstract

“…To resolve both input and output contentions, schedulers are used, whose function is to find one to one conflict free match between inputs and outputs in every time slot. Recently many scheduling algorithms have been proposed for Input Queued switch [3][4][5][6][7][8].…”

Section: Previous Workmentioning

confidence: 99%

Efficient Variable Length Block Switching Mechanism

Jaidhar

Reddy

2007

INT J COMPUT COMMUN

View full text Add to dashboard Cite

Most popular and widely used packet switch architecture is the crossbar. Its attractive characteristics are simplicity, non-blocking and support for simultaneous multiple packet transmission across the switch. The special version of crossbar switch is Combined Input Crossbar Queue (CICQ) switch. It overcomes the limitations of un-buffered crossbar by employing buffers at each crosspoint in addition to buffering at each input port. Adoption of Crosspoint Buffer (CB) simplifies the scheduling complexity and adapts the distributed nature of scheduling. As a result, matching operation is not needed. Moreover, it supports variable length packets transmission without segmentation. Native switching of variable length packet transmission results in unfairness. To overcome this unfairness, Fixed Length Block Transfer mechanism has been proposed. It has the following drawbacks: (a) Fragmented packets are reassembled at the Crosspoint Buffer (CB). Hence, minimum buffer requirement at each crosspoint is twice the maximum size of the block. When number of ports are more, existence of such a switch is infeasible, due to the restricted memory available in switch core. (b) Reassembly circuit at each crosspoint adds the cost of the switch. (c) Packet is eligible to transfer from CB to output only when the entire packet arrives at the CB, which increases the latency of the fragmented packet in the switch. To overcome these drawbacks, this paper presents Variable Length Block Transfer mechanism. It does not require internal speedup, segmentation and reassembly circuits. Using simulation it is shown that proposed mechanism is superior to Fixed Length Block Transfer mechanism in terms of delay and throughput.

show abstract

“…However, they may need a large number of iterations to achieve satisfactory matching results. Schemes based on round-robin matching, such as PIM [5], iSLIP [9], FIRM [10], DRRM [11], and SRRRS [12] have been shown to deliver 100% throughput under uniform traffic. With a single-stage switch, the exhaustive dual round robin matching (EDRRM) [13] has been shown to achieve a throughput higher than iSLIP and DRRM under non-uniform traffic pattern.…”

Section: Introductionmentioning

confidence: 99%

A Priority based SRM Algorithm for VOQ Packet Switch Architecture

Singh¹,

Ranjan²

2012

IJCA

View full text Add to dashboard Cite

Virtual Output Queuing (VOQ) is used to overcome the head-ofline (HoL) blocking problem in input-queued (IQ) packet switches. There are a lot of research has been devoted to design iterative arbitration algorithms to find maximum throughput of this architecture. In this paper approximating maximum size matching (MSM) algorithm called Selective Request Matching (SRM) has been proposed, which performs extremely well under various traffic models and easy to implement in hardware.

show abstract

FIRM: a class of distributed scheduling algorithms for high-speed ATM switches with multiple input queues

Cited by 106 publications

References 10 publications

A Combined Low Latency and Weighted Fair Queuing Based Scheduling of an Input-Queued Switch

A Combined Low Latency and Weighted Fair Queuing Based Scheduling of an Input-Queued Switch

Efficient Variable Length Block Switching Mechanism

A Priority based SRM Algorithm for VOQ Packet Switch Architecture

Contact Info

Product

Resources

About