Abstract
In this paper a high-performance, robust and scalable scheduling algorithm for input-queued switches, called distributed sequential allocation (DISA), is presented and analyzed. Contrary to pointer-based arbitration schemes, the algorithm proposed is based on a synchronized channel reservation cycle whereby each input selects a designated output, considering both its local requests as well as global channel availability information. The distinctiveness of the algorithm is in its ability to offer high-performance when multiple cells are transmitted within each switching intervals. The subsequent relaxed switching-time requirement allows for the utilization of commercially available crosspoint switches, yielding a pragmatic and scalable solution for high port-density switching platforms. The efficiency of the algorithms and its robustness is established through analysis and computer simulations addressing diverse traffic scenarios.
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.
