2010 14th International Telecommunications Network Strategy and Planning Symposium (NETWORKS) 2010
DOI: 10.1109/netwks.2010.5624954
|View full text |Cite
|
Sign up to set email alerts
|

FPGA implementation of the MMRRS scheduling algorithm for VOQ switches

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
2
0

Year Published

2017
2017
2017
2017

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 11 publications
0
2
0
Order By: Relevance
“…On the other hand, the iterative implementation of LQF (i.e., iLQF) is known to outperform iSLIP to the detriment of a larger number of iterations required for convergence, i.e., N instead of log N, where N is the number of ports [14]. Other scheduling algorithms have been proposed such as maximal matching with round-robin selection, which outperforms iSLIP at high loads (greater than 70%) [15], and the parallel hierarchical matching schedulers [16], which outperform iSLIP for low numbers of iterations [16]. Yet among the various schedulers, iSLIP stands out for its low complexity and performance [17], whereas the delay improvement of longest-queue-first approaches is still valuable, for instance, in two-step schedulers [5].…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…On the other hand, the iterative implementation of LQF (i.e., iLQF) is known to outperform iSLIP to the detriment of a larger number of iterations required for convergence, i.e., N instead of log N, where N is the number of ports [14]. Other scheduling algorithms have been proposed such as maximal matching with round-robin selection, which outperforms iSLIP at high loads (greater than 70%) [15], and the parallel hierarchical matching schedulers [16], which outperform iSLIP for low numbers of iterations [16]. Yet among the various schedulers, iSLIP stands out for its low complexity and performance [17], whereas the delay improvement of longest-queue-first approaches is still valuable, for instance, in two-step schedulers [5].…”
mentioning
confidence: 99%
“…iSLIP hardware implementation has been shown to outperform two other schedulers (namely lonely output [19] and wavefront allocator [20]) [21]. Other hardware implementations targeted other maximal matching algorithms, such as noniterative maximal matching with round-robin selection [15] and the sequential non-iterative matching algorithm [22]. A hardware implementation of the iSLIP algorithm modified for supporting the blocking behavior of the architecture used for the photonic integrated interconnection network is presented in [23].…”
mentioning
confidence: 99%