Abstract
More than than fifty new active queue management (AQM) algorithms have been proposed since 1999. However, none of them address the inter-server fairness problem. This letter describes the inter-server fairness problem in conventional AQM, and presents a group-based virtual queue algorithm, called GVQ, as a novel AQM approach to solve this problem. The queue complexity and performance of GVQ are evaluated by analysis. The validity of the analytical result and the effectiveness of GVQ are confirmed through ns-2 simulations.
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.
