Evaluation of MMRS and MMRRS packet scheduling algorithms for VOQ switches under bursty packet arrivals

Baranowska, A.; Kabacinski, W.

doi:10.1109/hpsr.2005.1503248

Cited by 6 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In 4 × 4 switch, we have a four combinations of connections [6], [7]. Example of such combinations is shown in Figure 2.…”

Section: Scheduling Algorithmmentioning

confidence: 97%

“…One of them is iSLiP which is presented in [3]. The next one is Parallel Iterative Matching (PIM) [2], Iterative RoundRobin Matching (iRRM) [4], Maximal Matching with Random Selection (MMRS) and Maximal Matching with Round-Robin Selection (MMRRS) [5], [6], [7]. We compared all these algorithms with the new algorithm which is presented in this paper.…”

Section: Introductionmentioning

confidence: 94%

See 1 more Smart Citation

The new MSMPS Packet Scheduling Algorithm for VOQ Switches

Danilewicz

Dziuba

2012

2012 8th International Symposium on Communication Systems, Networks &Amp; Digital Signal Processing (CSNDSP)

View full text Add to dashboard Cite

In this article we present the new algorithm Maximal Size Matching with Permanent Selection (MSMPS). This algorithm offers high efficiency with minimal MTD (Mean Time Delay). This algorithm based on permanent connections between inputs and outputs. When at least two connections without packets to send are found (empty connections), algorithm tries to convert them into better matching with the longest VOQ from the available. Simulations confirm that for large load our algorithm provides better efficiency than other algorithms.

show abstract

“…In 4 × 4 switch, we have a four combinations of connections [6], [7]. Example of such combinations is shown in Figure 2.…”

Section: Scheduling Algorithmmentioning

confidence: 97%

Section: Introductionmentioning

confidence: 94%

The new MSMPS Packet Scheduling Algorithm for VOQ Switches

Danilewicz

Dziuba

2012

2012 8th International Symposium on Communication Systems, Networks &Amp; Digital Signal Processing (CSNDSP)

View full text Add to dashboard Cite

show abstract

“…The general architecture of the scheduler of the MMRS and MMRRS schemes is shown in Figure 2 [12]- [14]. The scheduler is the PE with N counters and one selector.…”

Section: Parallel Match Evaluators For Iterative Matching Schemesmentioning

confidence: 99%

“…possible match permutations in an N × N switch, MMRS and MMRRS adopt a set of N arbitrary permutations with the property that each input can be connected to any output through this set. MMRS and MMRRS were evaluated under traffic models with Bernoulli packet arrivals with different patterns of output selection (uniform and nonuniform) [12], [13] and bursty traffic in [14] and are compared with other known algorithms like: Parallel Iterative Matching (PIM) [3], Iterative Round-Robin Matching [15], iSLIP [5], and it was shown that the MMRS and MMRRS schemes can provide higher performance than PIM and iSLIP.…”

Section: Introductionmentioning

confidence: 99%

“…The performance of these schemes is then low for some traffic patterns, especially those with nonuniform distributions. To improve the performance, a parallel match evaluator (PE) to determine the largest match was proposed, where ties are broken in two different modes: a) Maximal Matching with Random Selection (MMRS) and b) Maximal Matching with Round-Robin Selection (MMRRS) [12]- [14]. In these schemes, PE finds a maximal-size matching between inputs and outputs in one iteration.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Re-Configurable Parallel Match Evaluators Applied to Scheduling Schemes for Input-Queued Packet Switches

Beldianu

Rojas‐Cessa

Oki

et al. 2009

2009 Proceedings of 18th International Conference on Computer Communications and Networks

View full text Add to dashboard Cite

The performance of matching schemes for inputqueued (IQ) packet switches is mainly defined by the selection policy adopted. This policy can be aimed to produce a large weight sum for matched input-output pairs, where each inputoutput pair is assigned a weight, or to produce a large match size in the number of matched pairs, giving place to maximum weight matching or maximum size matching, respectively. However, schedulers can only provide a single match in function of the selection (of candidate ports) policy adopted and of the backlogged traffic at the input queues. A parallel match evaluator was recently proposed to provide not one but several match options at the same time. This approach evaluates several predefined and fixed matches and picks the match with the largest size. However, the fixed permutations of the evaluated matches may produce low performance under traffic with nonuniform distributions because of the limited number of choices. This paper proposes to make the parallel match evaluator configurable and two schemes to provide diverse and changeable matches such that the matches (and therefore, the evaluator) become adaptable to the traffic pattern. The proposed schemes were tested under uniform and nonuniform traffic patterns and the results show that these schemes provide high performance, even when scheduling is performed between periods of multiple time slots, or framed intervals. The proposed approach can be used for configuring slow micro-electro-mechanical (MEM) optical switch fabrics.Index Terms-packet switches, maximal weight matching, parallel matching, input-queued switch, iterative matching.

show abstract

Hierarchical round-robin matching for virtual output queuing switches

Baranowska

Kabacinski

2005

Advanced Industrial Conference on Telecommunications/Service Assurance With Partial and Intermittent Resources Conference/E-Lea

View full text Add to dashboard Cite

Evaluation of MMRS and MMRRS packet scheduling algorithms for VOQ switches under bursty packet arrivals

Cited by 6 publications

References 10 publications

The new MSMPS Packet Scheduling Algorithm for VOQ Switches

The new MSMPS Packet Scheduling Algorithm for VOQ Switches

Re-Configurable Parallel Match Evaluators Applied to Scheduling Schemes for Input-Queued Packet Switches

Hierarchical round-robin matching for virtual output queuing switches

Contact Info

Product

Resources

About