Network internal traffic characterization and end-to-end delay bound calculus for generalized processor sharing scheduling discipline

Authors:
F. Németh;P. Barta;R. Szabó;J. Bíró
Affiliations:
Department of Telecommunications and Telematics, Budapest University of Technology and Economics (BUTE), Magyar tudósok körútja 2. B326, H-1117 Budapest, Hungary;Department of Telecommunications and Telematics, Budapest University of Technology and Economics (BUTE), Magyar tudósok körútja 2. B326, H-1117 Budapest, Hungary;Department of Telecommunications and Telematics, Budapest University of Technology and Economics (BUTE), Magyar tudósok körútja 2. B326, H-1117 Budapest, Hungary;Department of Telecommunications and Telematics, Budapest University of Technology and Economics (BUTE), Magyar tudósok körútja 2. B326, H-1117 Budapest, Hungary
Venue:
Computer Networks: The International Journal of Computer and Telecommunications Networking
Year:
2005

Citing 19
Cited 1

A stop-and-go queueing framework for congestion management

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
On computing per-session performance bounds in high-speed multi-hop computer networks

SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Performance and stability of communication networks via robust exponential bounds

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)
Statistical analysis of generalized processor sharing scheduling discipline

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Any work-conserving policy stabilizes the ring with spatial re-use

IEEE/ACM Transactions on Networking (TON)
Efficient network QoS provisioning based on per node traffic shaping

IEEE/ACM Transactions on Networking (TON)
Stability of networks and protocols in the adversarial queueing model for packet routing

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Performance Guarantees in Communication Networks

Performance Guarantees in Communication Networks
Optimal Call Admission Control under Generalized Processor Sharing Scheduling

IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Determining End-to-End Delay Bounds in Heterogeneous Networks

NOSSDAV '95 Proceedings of the 5th International Workshop on Network and Operating System Support for Digital Audio and Video
Call Admission Control Algorithms for Tandem Generalized Processor Sharing Networks

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Network Level Call Admission Control Algorithms for Generalized Processor Sharing Scheduling Discipline

ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Universal stability results for greedy contention-resolution protocols

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
End-to-End Delay Bound Calculation in Generalized Processor Sharing Networks

ISCC '01 Proceedings of the Sixth IEEE Symposium on Computers and Communications
The FCFS service discipline: Stable network topologies, bounds on traffic burstiness and delay, and control by regulators

Mathematical and Computer Modelling: An International Journal
Call admission control in generalized processor sharing schedulers with tight deterministic delay bounds

Computer Communications

Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the end-to-end performance bound provisioning problem for one of the most significant traffic scheduling algorithms, generalized processor sharing (GPS). In particular, solutions are given to the network internal traffic characterization and end-to-end delay bound calculation problems in arbitrary topology GPS networks, where sessions are allowed to be arbitrary weighted. In the first part of the paper methods are given for determining internal (at inputs of network nodes) traffic descriptors of sessions, which are originally leaky bucket constrained at the network edge. The output burstiness behaviour of the arbitrary weighted GPS server is analyzed, and based on these results two algorithms are proposed that not only calculate internal traffic descriptors, but can also be used to manage network stability questions in non-feedforward networks. In the second part the end-to-end service curve is introduced to capture end-to-end worst-case traffic conditions of sessions, which forms the basis of the proposed method for end-to-end delay bound calculation. Extensive numerical analysis is shown to illustrate the tightness of this delay bound and various examples for internal traffic characterization are also conducted.