Bandwidth allocation algorithms for weighted maximum rate constrained link sharing policy

Authors:
Jeng Farn Lee;Meng Chang Chen;Ming Tat Ko;Wanjiun Liao
Affiliations:
Institute of Information Science, Academia Sinica, Taiwan and Department of Electrical Engineering, National Taiwan University, Taiwan;Institute of Information Science, Academia Sinica, Taiwan;Institute of Information Science, Academia Sinica, Taiwan;Department of Electrical Engineering, National Taiwan University, Taiwan
Venue:
Information Processing Letters
Year:
2006

Citing 7
Cited 0

Data networks

Data networks
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

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Computer networks (3rd ed.)

Computer networks (3rd ed.)
Introduction to Algorithms

Introduction to Algorithms
On Maximum Rate Control of Weighted Fair Scheduling for Transactional Systems

RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
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.89

Visualization

Abstract

This paper addresses the problem of bandwidth allocation under the weighted maximum rate constrained link sharing policy and proves a key theory in the condition of allocation termination. We propose several algorithms with various worst-case and average-case time complexities, and evaluate their computation elapse times.