Adaptive tuning of scheduling parameters

Authors:
Timo Hamalainen;Jarmo Siltanen;Ari Viinikainen;Jyrki Joutsensalo
Affiliations:
Department of Mathematical Information Technology, University of Jyvaskyla, Jyvaskyla, Finland;Department of Mathematical Information Technology, University of Jyvaskyla, Jyvaskyla, Finland;Department of Mathematical Information Technology, University of Jyvaskyla, Jyvaskyla, Finland;Department of Mathematical Information Technology, University of Jyvaskyla, Jyvaskyla, Finland
Venue:
ICECS'03 Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing
Year:
2003

Citing 8
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)
Link-sharing and resource management models for packet networks

IEEE/ACM Transactions on Networking (TON)
Achieving network optima using Stackelberg routing strategies

IEEE/ACM Transactions on Networking (TON)
Core-stateless fair queueing: achieving approximately fair bandwidth allocations in high speed networks

Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Providing guaranteed services without per flow management

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Equilibrium bandwidth and buffer allocations for elastic traffics

IEEE/ACM Transactions on Networking (TON)
Utility-based rate control in the Internet for elastic traffic

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents WFQ- based scheduling algorithm that allocates network resources in a fair way by taking into account class of service issues. Presented model is flexible in that different traffic flows are grouped into service classes and are given such QoS characteristics as bandwidth and delay. To adjust dynamically weights it is proposed to use the usage-based revenue criterion that enables the allocation of free resource between service classes. The analysis considers a single node and it is shown that the QoS can be guaranteed due to the allocation of unused resources to the higher service classes.