A pipeline-based approach for maximal-sized matching scheduling in input-buffered switches

@article{Oki2001APA,
  title={A pipeline-based approach for maximal-sized matching scheduling in input-buffered switches},
  author={Eiji Oki and Roberto Rojas-Cessa and H. Jonathan Chao},
  journal={IEEE Communications Letters},
  year={2001},
  volume={5},
  pages={263-265}
}
This letter proposes an innovative pipeline-based maximal-sized matching scheduling approach, called PMM, for input-buffered switches. It dramatically relaxes the timing constraint for arbitration with a maximal matching scheme. In the PMM approach, arbitration operates in a pipelined manner. Each subscheduler is allowed to take more than one time slot for its matching. Every time slot, one of them provides the matching result. The subscheduler can adopt a pre-existing efficient round-robin… CONTINUE READING
Highly Cited
This paper has 54 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 40 extracted citations

55 Citations

0510'01'04'08'12'16
Citations per Year
Semantic Scholar estimates that this publication has 55 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Flexible bandwidth allocation in terabit packet switches

  • A. Smiljanic
  • Proc. IEEE Workshop on High Performance Switching…
  • 2000
1 Excerpt

RRGS-round-robin greedy scheduling for electronic/optical terabit switches

  • A. Smiljanic, R. Fan, G. Ramamurthy
  • Proc. IEEE Globecom’99, pp. 1244–1250.
  • 1250

Similar Papers

Loading similar papers…