Skip to main content
SpringerLink
Log in

Impact of scheduling algorithms on performance of crosspoint-queued switch

  • Published:
annals of telecommunications - annales des télécommunications Aims and scope Submit manuscript

Abstract

The performance analysis of the 32 × 32 crosspoint-queued switch is presented in this paper. Switches with small buffers in crosspoints have been evaluated in the late 1980s but mostly for uniform traffic. However, due to technological limitations of that time, it was impractical to implement large buffers together with switching fabric. The crosspoint-queued switch architecture has been recently brought back into focus since modern technology enables an easy implementation of large buffers in crosspoints. An advantage of this solution is the absence of control communication between linecards and schedulers. In this paper, the performances of four algorithms (longest queue first, round robin, exhaustive round robin, and frame-based round robin matching) are analyzed and compared. The results obtained for the crosspoint-queued switch are compared with the output queued switch. Throughput, average cell latency and instantaneous packet delay variance are evaluated under uniform and nonuniform traffic patterns. The results will show that the longest queue first algorithm has the highest throughput in many simulated cases but the highest average cell latency and delay variance among observed algorithms. It will also be shown that the choice of the scheduling algorithm does not play a role in the switch performance if the buffers are long enough. This will prove that some form of round-robin-based algorithms become a better choice for implementation due to their simplicity, small hardware requirements, and avoidance of the starvation problem, which is a major drawback of the longest queue first algorithm.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

References

  1. Karol MJ, Hluchyj MG, Morgan S (1987) Input versus output queuing on a space-division packet switch. IEEE Trans Commun 35(12):1347–1356

    Article  Google Scholar 

  2. Mekkittikul A, McKeown N (1998) A practical scheduling algorithm to achieve 100% throughput in input-queued switches. Proc INFOCOM ′98, pp. 792–799

  3. McKeown N, Mekkittikul A, Anantharam V, Walrand J (1999) Achieving 100% throughput in an input-queued switch. IEEE Trans Commun 47(8):1260–1267

    Article  Google Scholar 

  4. Banovic D, Radusinovic I (2005) Software tool for performance analysis of VOQ switches. Proc EUROCON 2005:1758–1761

    Google Scholar 

  5. Dai J, Prabhakar B (2000) The throughput of data switches with and without speedup. Proc IEEE INFOCOM ′00, pp. 556–564

  6. Banovic D, Radusinovic I (2008) Scheduling algorithm for VOQ switches. AEU Int J Electron Commun 62:455–458

    Article  Google Scholar 

  7. Liu NH, Yeung KL, Pao DCW (2001) Scheduling algorithms for input-queued switches with virtual output queuing. Proc ICC ′01, pp. 2038–2042

  8. Radonjic M, Radusinovic I, Veljovic Z (2009) Performance analysis of LPF based VOQ crossbar switches. Proc EUROCON 2009:1844–1851

    Google Scholar 

  9. Ganjali Y, Keshavarzian A, Shah D (2005) Cell switching versus packet switching in input-queued switches. IEEE/ACM Trans Networking 13(4):782–789

    Article  Google Scholar 

  10. Tobajas F, Esper-Chain R, Armas V, Lopez J, Sarmiento R (2002) Round-trip delay effect on iterative request-grant-accept scheduling algorithms for virtual output queued switches. Proc GLOBECOM ′02, pp. 1889–1893

  11. Rojas-Cessa R, Oki E, Jing Z, Chao HJ (2001) CIXB-1: Combined input-one-cell-crosspoint buffered switch. Proc IEEE HPSR ′01, pp. 324–329

  12. Radusinovic I, Pejanovic M, Petrovic Z (2002) Impact of scheduling algorithms on performance of buffered crossbar switch fabrics. Proc ICC ′02, pp. 2416–2420

  13. Yoshigoe K (2006) The CICQ switch with virtual crosspoint queues for large RTT. Proc ICC ′06, pp. 299–303

  14. Kanizo Y, Hay D, Keslassy I (2009) The crosspoint-queued switch. Proc INFOCOM ′09, pp. 729–737

  15. Nojima S, Tsutsui E, Fukuda H, Hashimoto M (1987) Integrated services packet network using bus matrix switch. IEEE J Sel Areas Commun 5:1284–1292

    Article  Google Scholar 

  16. Kato Y, Shimoe T, Hajikano K, Murakami K (1988) Experimental broadband ATM switching system. Proc GLOBECOM ′88, pp. 1288–1292

  17. Cvorovic J, Radusinovic I, Radonjic M (2009) Buffering in crosspoint-queued switch. Proc 17th Telecommun TELFOR 2009, pp.198–201

  18. Radonjic M, Radusinovic I (2010) Buffer length impact to crosspoint queued crossbar switch performance. Proc 15th IEEE MELECON, pp. 119–124

  19. Shin E, Mooney V, Riley G (2002) Round-robin arbiter design and generation. Proc 15th Int Symp Syst Synth, pp. 243–248

  20. Li Y, Panwar S, Chao HJ (2002) The dual round-robin matching switch with exhaustive service. Proc IEEE HPSR ′02, pp. 58–63

  21. Mekkittikul A, McKeown N (1996) A starvation-free algorithm for achieving 100s throughput in an input-queued switch. Proc ICCCN '96, pp. 226–231

  22. Abel F, Minkerberg C, Iliadis I, Engbersen T, Gusat M, Gramsamer F et al (2007) Design issues in next-generation merchant switch fabrics. IEEE/ACM Trans Netw 15:1603–1615

    Article  Google Scholar 

  23. Rojas-Cessa R, Chuan-bi L (2004) Frame occupancy-based round-robin matching scheme for input-queued packet switches. Proc GLOBECOM 3:1845–1849

    Google Scholar 

  24. IP Packet Delay Variation Metric for IP Performance Metrics (IETF - RFC 3393). http://www.ietf.org/rfc/rfc3393.txt

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical Engineering, University of Montenegro, Bulevar Dzordza Vasingtona bb, 20000, Podgorica, Montenegro

    Milutin Radonjic & Igor Radusinovic

Authors
  1. Milutin Radonjic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Igor Radusinovic
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Milutin Radonjic.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Radonjic, M., Radusinovic, I. Impact of scheduling algorithms on performance of crosspoint-queued switch. Ann. Telecommun. 66, 363–376 (2011). https://doi.org/10.1007/s12243-010-0214-y

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12243-010-0214-y

Keywords

Search

Navigation