Skip to main content
Log in

An efficient scheduling algorithm for input-queued switches

  • Published:
Journal of Electronics (China)

Abstract

This letter presents an efficient scheduling algorithm DTRR (Dual-Threshold Round Robin) for input-queued switches. In DTRR, a new matched input and output by round robin in a cell time will be locked by two self-adaptive thresholds whenever the queue length or the wait-time of the head cell in the corresponding Virtual Output Queue (VOQ) exceeds the thresholds. The locked input and output will be matched directly in the succeeding cell time until they are unlocked. By employing queue length and wait-time thresholds which are updated every cell time simultaneously, DTRR achieves a good tradeoff between the performance and hardware complexity. Simulation results indicate that the delay performance of DTRR is competitive compared to other typical scheduling algorithms under various traffic patterns especially under diagonal traffic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. N. McKeown, A. Mekkittikul, V. Anantharam, J. Walrand. Achieving 100% throughput in an input-queued switch. IEEE Trans. on Communications, 47(1999)8, 1260–1269.

    Article  Google Scholar 

  2. N. McKeown. The iSLIP scheduling algorithm for input-queued switches. IEEE Trans. on Networking, 7(1999)2, 188–201.

    Article  Google Scholar 

  3. D. N. Serpanos, P. I. Antoniadis. FIRM: A class of distribution scheduling algorithm for high-speed ATM switches with multiple input queues. IEEE INFOCOM, Tel Aviv, Israel, March 26–30, 2000, 548–555.

  4. Ying Jiang, M. Hamdi. A fully desynchronized round-robin matching scheduler for a VOQ packet switch architecture. IEEE Workshop on High Performance Switching and Routing, Texas, USA, May 29–31, 2001, 407–411.

  5. Wenzhe Cui, Hanseok KO, Sunshin An. A threshold based scheduling algorithm for input queue switch. IEEE International Conference on Information Networking, Oita, Japan, January 31–February 2, 2001, 207–211.

  6. Shutao Sun, Simin He, Yanfeng Zheng, Wen Gao. Multiple-threshold based scheduling algorithm for high performance input queued switches. IEEE International Conference on Network, Singapore, November 16–19, 2004, 755–759.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hu Qingsheng Ph.D..

Additional information

Supported by the National Natural Science Foundation of China (No.60472057).

About this article

Cite this article

Hu, Q., Sun, Y. & Han, J. An efficient scheduling algorithm for input-queued switches. J. of Electron.(China) 24, 251–256 (2007). https://doi.org/10.1007/s11767-006-0111-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11767-006-0111-8

Key words

CLC index

Navigation