UBSFQ: An Urgency-Based Start-time Fair Queuing Scheduling

Abstract

How to provide a broad range of QoS guarantees in a packet network is an important issue. In order to achieve QoS guarantees, good traffic schedulers are indispensable. In this paper, a packet scheduling discipline UBSFQ and its simulation are proposed. According as the implementation and result of our simulations, this scheduling discipline is computational efficient, and can resolve the unstable packet latencies problem, and shares both the bounded-delay and fairness properties of GPS.