A novel resource scheduling algorithm for QoS-aware services on the Internet

Authors:
Fariza Sabrina
Affiliations:
ICT Centre, Commonwealth Scientific and Industrial Research Organisation (CSIRO), Cnr Vimiera and Pembroke Roads, Marsfield, NSW 2022, Australia
Venue:
Computers and Electrical Engineering
Year:
2010

Citing 10
Cited 0

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

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)
Scheduling Resources in Programmable and Active Networks Based on Adaptive Estimations

LCN '03 Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks
How sensitive are online gamers to network quality?

Communications of the ACM - Entertainment networking
Enabling network-centric music performance in wide-area networks

Communications of the ACM - Entertainment networking
Adjusted fair scheduling and non-linear workload prediction for QoS guarantees in grid computing

Computer Communications
Design, Analysis, and Implementation of a Novel Low Complexity Scheduler for Joint Resource Allocation

IEEE Transactions on Parallel and Distributed Systems
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
Low-latency guaranteed-rate scheduling using Elastic Round Robin

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The popularity and availability of Internet connection has opened up the opportunity for network-centric collaborative work that was impossible a few years ago. Contending traffic flows in this collaborative scenario share different kinds of resources such as network links, buffers, and router CPU. The goal should hence be overall fairness in the allocation of multiple resources rather than a specific resource. In this paper, firstly, we present a novel QoS-aware resource scheduling algorithm called Weighted Composite Bandwidth and CPU Scheduler (WCBCS), which jointly allocates the fair share of the link bandwidth as well as processing resource to all competing flows. WCBCS also uses a simple and adaptive online prediction scheme for reliably estimating the processing times of the incoming data packets. Secondly, we present some analytical results, extensive NS-2 simulation work, and experimental results from our implementation on Intel IXP2400 network processor. The simulation and implementation results show that our low complexity scheduling algorithm can efficiently maximise the CPU and bandwidth utilisation while maintaining guaranteed Quality of Service (QoS) for each individual flow.