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
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks
IEEE/ACM Transactions on Networking (TON)
Measurement-based admission control with aggregate traffic envelopes
IEEE/ACM Transactions on Networking (TON)
Loss probability calculations and asymptotic analysis for finite buffer multiplexers
IEEE/ACM Transactions on Networking (TON)
Design and implementation of scalable edge-based admission control
Computer Networks: The International Journal of Computer and Telecommunications Networking - QoS for IP networks
A measurement-analytic approach for QoS estimation in a network based on the dominant time scale
IEEE/ACM Transactions on Networking (TON)
Scalable services via egress admission control
IEEE Transactions on Multimedia
The notion of end-to-end capacity and its application to the estimation of end-to-end network delays
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Long range dependent trafic
The notion of end-to-end capacity and its application to the estimation of end-to-end network delays
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Long range dependent trafic
Proceedings of the Nineteenth International Workshop on Quality of Service
Hi-index | 0.00 |
In this paper we propose an approximation for the end-to-end (queueing) delay distribution based on endpoint measurements. We develop a notion of the end-to-end capacity which is defined for a path of interest. We show that the end-to-end path can be represented by a single-node model with the end-to-end capacity in the sense that the single-node model is equivalent to the original path in terms of the queue-length and the departure. Our study is motivated by the case where the end-to-end delay distribution can be approximated by an appropriately scaled end-to-end queue-length distribution. We investigate the accuracy of our approximation and demonstrate its application to admission control providing end-to-end QoS.