Investigations of the Performance of a Measurement-based Connection Admission Control Algorithm
Proceedings of the IFIP TC6 WG6.3/WG6.4 Fifth International Workshop on Performance Modelling and Evaluation of ATM Networks: Performance Analysis of ATM Networks
Measurement-Based Usage Charges in Comminucations Networks
Operations Research
Statistical service assurances for traffic scheduling algorithms
IEEE Journal on Selected Areas in Communications
Asymptotic end-to-end stochastic evaluation for tandem networks with many flows
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Dynamic adjustment of virtual paths in ATM networks
ICCOM'06 Proceedings of the 10th WSEAS international conference on Communications
| Hi-index | 0.00 |
We investigate the worst possible behavior of a stationary traffic source when the traffic emanating from it is required to meet certain constraints. Specifically, the peak rate of the source is required not to exceed a level ρ and realizations must obey a “leaky bucket” constraint with bucket size β and leak rate σ. The worst case source is considered to be the one with the largest effective bandwidth, a concept which arises in the large deviation theory of queueing networks and governs the asymptotic loss rate when a large number of sources send traffic to a single server queue. We conjecture the form of the worst case traffic in general and prove the conjecture for the special case when T, the time-scale parameter of the effective bandwidth, is less than both β/(ρ−σ) and β/σ, the times taken respectively to fill and empty the leaky bucket.