Tradeoffs between low complexity, low latency, and fairness with deficit round-robin schedulers
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this paper, we describe the structure of the access network and we propose bandwidth guarantee scheme for subscriber and service. The scheme uses two kinds of the classification table, which are called ”service classification table” and ”subscriber classification table.” Using the classification table, we can identify the flow of the subscriber and service. Also, we compute the number of hash table entry to minimize the loss ratio of flows using the M/G/k/k queueing model. Finally, we apply to deficit round robin (DRR) scheduling through virtual queueing per subscriber instead of aggregated class.