Abstract
This paper proposes an active queue management algorithm we called “SCHOKe”, which wants to address the problems of providing a fair bandwidth allocation and a stabilized buffer occupancy in congested routers. The scheme works in concert with a simple FIFO queue that is shared by all flows, so it is stateless and easy to implement. In the algorithm, unresponsive flows are punished effectively and buffer occupancy is stabilized by a “hit”, which happens when an arriving packet's flow ID is the same as one of packets randomly chosen from the FIFO queue. Simulations of a TCP/IP network are used to illustrate the performance of the scheme.
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.
