Advertisement

Designing Buffer Capacity of Crosspoint-Queued Switch

  • Guo Chen
  • Dan Pei
  • Youjian Zhao
  • Yongqian Sun
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8707)

Abstract

We use both theoretical analysis and simulations to study crosspoint-queued(CQ) buffer size’s impact on CQ switch’s throughput and delay performance under different traffic models, input loads, and scheduling algorithms. In this paper, 1) we present an exact closed-form formula for the CQ switch’s throughput and a non-closed-form but convergent formula for its delay using static non-work-conserving random scheduling algorithms with any given buffer size under independent Bernoulli traffic; 2) we show that the above results can serve as a conservative guidance on deciding the needed buffer size in pure CQ switches using work-conserving algorithms such as random, under independent Bernoulli traffic. Furthermore, our simulation results under real-trace traffic show that simple round-robin and random work-conserving algorithms can achieve quite good throughput and delay performance with feasible crosspoint buffer size. Our work reveals the impact of buffer size on CQ switches’ performance and provides a theoretical guidance on designing the buffer size in pure CQ switch, which is an important step towards building ultra-high-speed switching fabrics.

Keywords

Loss Rate Time Slot Schedule Algorithm Buffer Size Average Delay 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    McKeown, N.: The islip scheduling algorithm for input-queued switches. IEEE/ACM Transactions on Networking 7(2), 188–201 (1999)CrossRefGoogle Scholar
  2. 2.
    Li, Y., Panwar, S., Chao, H.: On the performance of a dual round-robin switch. In: INFOCOM 2001, vol. 3, pp. 1688–1697 (2001)Google Scholar
  3. 3.
    Rojas-Cessa, R., Oki, E., Jing, Z., Chao, H.: Cixb-1: combined input-one-cell-crosspoint buffered switch. In: HPSR 2001, pp. 324–329 (2001)Google Scholar
  4. 4.
    He, S.M., Sun, S.T., Guan, H.T., Zheng, Q., Zhao, Y.J., Gao, W.: On guaranteed smooth switching for buffered crossbar switches. IEEE/ACM Transactions on Networking 16(3), 718–731 (2008)CrossRefGoogle Scholar
  5. 5.
    Oki, E., Jing, Z., Rojas-Cessa, R., Chao, H.J.: Concurrent round-robin-based dispatching schemes for clos-network switches. IEEE/ACM Trans. on Networking 10(6), 830–844 (2002)CrossRefGoogle Scholar
  6. 6.
    Iyer, S., Awadallah, A., McKeown, N.: Analysis of a packet switch with memories running slower than the line-rate. In: INFOCOM 2000, vol. 2, pp. 529–537. IEEE (2000)Google Scholar
  7. 7.
    Abel, F., Minkenberg, C., Iliadis, I., Engbersen, T., Gusat, M., Gramsamer, F., Luijten, R.P.: Design issues in next-generation merchant switch fabrics. IEEE/ACM Trans. Netw. 15(6), 1603–1615 (2007)CrossRefGoogle Scholar
  8. 8.
    Kanizo, Y., Hay, D., Keslassy, I.: The crosspoint-queued switch. In: INFOCOM 2009, pp. 729–737. IEEE (2009)Google Scholar
  9. 9.
    Radonjic, M., Radusinovic, I.: Impact of scheduling algorithms on performance of crosspoint-queued switch. Annals of Telecommunications - Annales Des Télécommunications 66, 363–376 (2011)CrossRefGoogle Scholar
  10. 10.
    Radusinovic, I., Radonjic, M., Simurina, A., Maljevic, I., Veljovic, Z.: A new analytical model for the cq switch throughput calculation under the bursty traffic. AEU - International Journal of Electronics and Communications 66(12), 1038–1041 (2012)CrossRefGoogle Scholar
  11. 11.
    Cao, Z., Panwar, S.S.: Efficient buffering and scheduling for a single-chip crosspoint-queued switch. In: Proceedings of the Eighth ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2012, pp. 111–122. ACM, New York (2012)CrossRefGoogle Scholar
  12. 12.
    Cisco crs carrier routing system 16-slot line card chassis system description. Cisco Systems, Inc. (2012)Google Scholar
  13. 13.
    Trivedi, K.: Probability and statistics with reliability, queuing, and computer science applications. Wiley, New York (2002)Google Scholar
  14. 14.
    Anonymized 2013 internet traces, https://data.caida.org/datasets/passive-2013/

Copyright information

© IFIP International Federation for Information Processing 2014

Authors and Affiliations

  • Guo Chen
    • 1
  • Dan Pei
    • 1
  • Youjian Zhao
    • 1
  • Yongqian Sun
    • 1
  1. 1.Department of Computer Science and TechnologyTsinghua UniversityBeijingChina

Personalised recommendations