This paper presents a throughput analysis for switches or switching fabrics with small output buffers, where a scheduler needs to compute approximate matchings, i.e., match multiple inputs to the same output. We adopt a random arbitration scheme, which is an extension of Parallel Iterative Matching (PIM) [1, 3]. We propose a performance analysis based on a Markov Chain modeling of output credits and further devise an iterative solving procedure for it. The analytical results match very well with simulations of various switch and buffer sizes. Our analysis and experiments also show that with very modest output buffers, switches of any size can provide full throughput under uniformly distributed traffic.
By: Lydia Y. Chen, Nikolaos Chrysos
Published in: RZ3856 in 2013
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .