Credit-based fair scheduling for input-queued switches

Gourgy, A.; Wu, Honglin; Szymański, Tomasz

doi:10.1109/icc.2004.1312866

Search citation statements

Order By: Relevance

Paper Sections

Select...

Related Work1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2010

Publication Types

Select...

Other1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithms iLQF [7], iOCF [7], iLPF [8], iFS [9], iCBFS [10], FIFOMS [11] and π-RGA [12] fall in the second category. It is clear that iSLIP belongs to the third category.…”

Section: Related Workmentioning

confidence: 99%

Longest queue first in round-robin matching for input-queued switches

Liao

2010

2010 International Symposium on Information Theory &Amp; Its Applications

View full text Add to dashboard Cite

In this paper, we developed a new virtual output queue (VOQ) scheduling algorithm called "longest queue first in round-robin matching" (LQFRRM) for input-queued switches. Based on the well-known iSLIP algorithm, we proposed a new update policy for the output round robin pointers. That is, when a grant is not accepted, all the output round robin pointers are updated to the longest queue. The rationale is that a grant not accepted will leave an output port idle and that means a less than optimal solution. Therefore, a better alternative is to give priority to the longest queue, especially under non-uniform traffic. The simulation results showed that LQFRRM was better than iSLIP in non-uniform traffic and was comparable to iSLIP in uniform traffic.

show abstract

“…The algorithms iLQF [7], iOCF [7], iLPF [8], iFS [9], iCBFS [10], FIFOMS [11] and π-RGA [12] fall in the second category. It is clear that iSLIP belongs to the third category.…”

Section: Related Workmentioning

confidence: 99%

Longest queue first in round-robin matching for input-queued switches

Liao

2010

2010 International Symposium on Information Theory &Amp; Its Applications

View full text Add to dashboard Cite

show abstract

Credit-based fair scheduling for input-queued switches

Cited by 1 publication

References 14 publications

Longest queue first in round-robin matching for input-queued switches

Longest queue first in round-robin matching for input-queued switches

Contact Info

Product

Resources

About