Delay-bandwidth normalized service sharing with service rate guarantees

Authors:
JuHyun Lee;Hoyoung Hwang;KyeongHo Park;Chang-Gun Lee;Sungsoo Lim
Affiliations:
Seoul National University, Seoul, Korea;Hansung University, Seoul, Korea;Seoul National University, Seoul, Korea;Seoul National University, Seoul, Korea;Kookmin University, Seoul, Korea
Venue:
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
Year:
2011

Citing 9
Cited 0

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing algorithms for packet-switched networks

IEEE/ACM Transactions on Networking (TON)
SCED: a generalized scheduling policy for guaranteeing quality-of-service

IEEE/ACM Transactions on Networking (TON)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services

IEEE/ACM Transactions on Networking (TON)
A Priority-Based Weighted Fair Queuing Scheduler for Real-Time Network

RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
WF2Q: worst-case fair weighted fair queueing

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Fair queueing algorithms based on Generalized Processor Sharing (GPS) provide sessions with instantaneous fair sharing of server capacity, as well as guaranteed service rate and delay. The instantaneous fair sharing distributes server capacity to currently back-logged sessions in proportion to their weights regardless of the amount of service that the sessions received in the past. From a long-term perspective, however, this type of sharing leads to a different quality of service to sessions even if they have the same weight, since it provides only the instantaneous capacity sharing without considering the accumulated service delay and bandwidth. To minimize such long-term unfairness, we propose a delay and bandwidth normalized scheduling model in which the concept of Value of Service (VoS) is defined from the aspects of both delay and bandwidth. Performance comparisons between the proposed algorithm and traditional fair queueing algorithms show that the proposed algorithm provides better long-term fairness among sessions and is more adaptive to sessions with dynamic traffic patterns without compromising the guarantees of service rate and delay.