Abstract
We address the deployment of random early detection (RED) on class based queues (CBQs) with shared buffer by deriving novel RED algorithms for the complete sharing and sharing with minimum allocation schemes and comparing their performance with RED under complete partitioning that is equivalent to using a dedicated buffer for each CBQ. In our novel RED algorithms, packet drop decision is based on the estimated average lengths of both the effective subqueue and the whole queue. Simulation results ascertain and demonstrate the superiority of the proposed schemes in terms of lower packet drop ratio under congestion situations, with different RED parameters under diverse RED drop probabilities and weight factors.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.