Round robin based packet schedulers generally have a low complexity and provide long-
term fairness. The main limitation of such schemes is that they do not support short-term …

Flow-level bandwidth provisioning (FBP) achieves fine-grained bandwidth assurance for
individual flows. It is especially important for virtualization-based computing environments …

This paper presents Interleaved Stratified Timer Wheels as a novel priority queue data
structure for traffic sha** and scheduling in packet-switched networks. The data structure …

In a network where weighted fair-queueing schedulers are used at each link, a flow is
guaranteed an end-to-end worst-case delays which depends on the rate reserved for it at …

Generalized processor sharing (GPS) is a fluid scheduling policy providing perfect fairness
over both constant-rate and variable-rate links. The minimum deviation (lead/lag) with …

Abstract As shown in [1], the problem of routing a flow subject to a worst-case end-to-end
delay constraint in a packed-based network can be formulated as a Mixed-Integer Second …

The interest in solving the issue of congestion or flow control in network established from the
first discovery and increase popularity of the Internet in 1967 or earlier. As the use of the …

In this paper, we take a novel approach at service differentiation in packet-switched
networks. Existing mechanisms for delay control and differentiation typically require some …

Packets from different flows are stored in queues and the scheduler processes information
associated with the head packet in each queue to determine which packet should be …

This paper addresses the problem of scheduling variable-size packets from large number of
distinct traffic flows. Although the problem of fair packet scheduling in computer networks …