Abstract: We describe a scheduler based on deficit-round robin (DRR) for multiple servers of multiple packet-flows, where each packet-flow may be served by ...

We describe a scheduler based on deficit-round robin (DRR) for multiple servers of multiple packet-flows, where each packet-flow may be served by only a ...

This paper modifies Khamse-Ashari et al.'s [4] multi-server algorithm for use in a single server environment, hence it is referred to as Singler-Server Max-Min ...

Apr 1, 2018 · To achieve the max-min fair service rates, we propose a novel packet scheduler which is inspired by the deficit-round robin (DRR) algorithm. The ...

We develop a new fair allocation mechanism called Per-Server Dominant-Share Fairness (PS-DSF) which we show offers all desirable sharing properties that DRF is ...

The scheduler allocates tokens to flows in a round-by-round manner, where token allocation to flows at the beginning of each round is weighted max-min fair. We ...

To achieve the max-min fair service rates, we propose a novel packet scheduler which is inspired by the deficit-round robin (DRR) algorithm. The scheduler ...

In this paper, we study a multi-server queuing system wherein each user is constrained to get service only from a specified subset of servers. Fair packet ...

In the paper, we propose Hierarchical Deficit Round-Robin (HDRR) packet scheduling algorithm for multiple classes of service to pro-vide a fair share of ...

Abstract—Hierarchical link sharing addresses the demand for fine-grain traffic control at multiple levels of aggregation. At present, packet schedulers that ...