Abstract
This letter addresses the scalability problems induced by high complexity of multicast scheduling algorithms in high-speed switches. Based on a two-phase (request-grant) scheduling scheme in a Nx N switch, a more scalable approach instead of traditional iterative schedulings is presented, which reduces the matching overhead from O(kN) to O(N) by selecting one head-of-line cell for requesting when k multicast queues are allocated at each input port. Simulation results show that the proposed algorithm exhibits a good switching performance in terms of throughput and average delay under various traffic patterns.
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.
