Worst-Case Deterministic Delay Bounds for Arbitrary Weighted Generalized Processor Sharing Schedulers

Authors:
Róbert Szabó;Peter Barta;Felician Németh;József Bíró
Affiliations:
-;-;-;-
Venue:
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
Year:
2000

Citing 5
Cited 1

Analysis and simulation of a fair queueing algorithm

SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Supporting real-time applications in an Integrated Services Packet Network: architecture and mechanism

SIGCOMM '92 Conference 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)
A generalized processor sharing approach to flow control in integrated services networks: the multiple node case

IEEE/ACM Transactions on Networking (TON)
Hierarchical packet fair queueing algorithms

Conference proceedings on Applications, technologies, architectures, and protocols for computer communications

Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Generalized Processor Sharing (GPS) is realized as the most important ideal fluid scheduling discipline in guaranteed QoS networks. The well-known problem of GPS-based rate-proportional servers is the bandwidth delay coupling which leads to inefficient resource utilization. In this paper we introduce the concept of non rate-proportional (or arbitrary) weighting of sessions in GPS systems. Such an approach in a GPS node of network constrained by leaky buckets can handle bandwidth and delay parameters independently, thus allowing better utilization of network resources. Moreover, we show that even under the traditional bandwidth delay coupled system (rate-proportional weighting) it is possible to determine tighter delay bounds of sessions than that of presented in earlier papers. A numerically inexpensive algorithm, which works in any arbitrary weighted GPS system is also presented for computing delay bounds. Besides the analytical work numerical examples are also shown.