Abstract
This paper proposes an efficient fair queuing algorithm, called mean starting potential fair queuing (MSPFQ), which has O(l) complexity for the virtual time computation while it has delay and fairness properties similar to starting-potential fair queueing (SPFQ). The key idea of MSPFQ algorithm is that it recalibrates the system virtual time to the mean value of the minimum possible virtual start times of HOL packets in each backlogged session. Through analysis and simulation, this paper shows that the proposed algorithm has good delay and fairness properties.
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.
