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.
Type de document :
Communication dans un congrès
Ching-Hsien Hsu; Xuanhua Shi; Valentina Salapura. 11th IFIP International Conference on Network and Parallel Computing (NPC), Sep 2014, Ilan, Taiwan. Springer, Lecture Notes in Computer Science, LNCS-8707, pp.35-48, 2014, Network and Parallel Computing. 〈10.1007/978-3-662-44917-2_4〉
https://hal.inria.fr/hal-01403056
Contributeur : Hal Ifip
<>
Soumis le : vendredi 25 novembre 2016 - 14:20:52
Dernière modification le : vendredi 1 décembre 2017 - 01:09:47
Document(s) archivé(s) le : mardi 21 mars 2017 - 09:57:22
