Abstract
AbstractA simple algorithm for resolving output contentions in an input‐buffered Batcher‐banyan network is described. The basic idea in this algorithm is to let the binary nodes of the Batcher network participate in the arbitration process. The proposed algorithm is completely distributed and parallel; thus it scales well to large size switches. Furthermore, our algorithm is fair and requires an overhead that is significantly less than that due to the well‐known three‐phase algorithm. Two variations of the algorithm are described.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
