Abstract
It has been shown that maximal size matching algorithms for input-queued switches are stable under any admissible traffic conditions with a scheduling speedup of 2. However, as link speeds increase, the computational complexity of these algorithms limits their applicability in high port-density switches and routers. In this letter we describe a Frame-Based Maximal Weight Matching (FMWM) algorithm in which a new scheduling decision is issued once every several cell times. Between scheduling decisions, the configuration of the crossbar switch remains unchanged. We prove that the FMWM algorithm is stable with an internal buffer transfer speedup of 2, thereby significantly relaxing the timing constraints on the scheduling process. Simulation results illustrate the impact of the algorithm on the average cell delay for different traffic scenarios.
Sign-in/Register to access full text options 
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.
