Abstract
In a banyan based broadband packet switch using input queuing, the throughput of the switch is limited by the head of line blocking. Windowing is a technique used to mitigate the head of line blocking by relaxing the strict first-in-first-out queuing discipline of the input buffers. In this paper, we compare four different windowing policies which have been presented in the literature for input buffered non blocking time-slotted packet switch. First we compare the performance in terms of maximum throughput under random and bursty traffic patterns and then compare the implementation requirements of the four windowing policies.
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.
