Well-Regulated Pseudo-request Dual Round-Robin Matching Arbitration Algorithm for High Performance Input-Queued Switches 


Vol. 29,  No. 9, pp. 973-982, Sep.  2004


PDF
  Abstract

High-speed scheduling algorithms are required for high-performance input-queued switches to achieve good performance. Various Round-Robin scheduling algonthms for Virtual-Output-Queue (VOQ) switch architectures have been proposed, hke iSLIP, DRRM (Dual Round-Robin Matching). iSLIP can achieve high performance and have already been implemented in hardware. DRRM has been proved to achieve better performance and simpler than iSLIP But neither iSLIP nor DRRM can efficiently solve the problem of the Round-Robm pointers' desynchronization. In this paper, we have proposed "Well-Regulated Pseudo-request Dual Round-Robin Matching" Algorithm. It is developed from DRRM, and can always keep the pointers' desynchronization. Since our algorithm is based on the Round-Robin scheduling, it is also simple to be implemented. And simulation results also show that our proposed algonthm performs pretty well under various, traffic models.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Nan and D. N. Kim, "Well-Regulated Pseudo-request Dual Round-Robin Matching Arbitration Algorithm for High Performance Input-Queued Switches," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 9, pp. 973-982, 2004. DOI: .

[ACM Style]

MeiHua Nan and Doug Nyun Kim. 2004. Well-Regulated Pseudo-request Dual Round-Robin Matching Arbitration Algorithm for High Performance Input-Queued Switches. The Journal of Korean Institute of Communications and Information Sciences, 29, 9, (2004), 973-982. DOI: .

[KICS Style]

MeiHua Nan and Doug Nyun Kim, "Well-Regulated Pseudo-request Dual Round-Robin Matching Arbitration Algorithm for High Performance Input-Queued Switches," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 9, pp. 973-982, 9. 2004.