An equivalent random method with hyper-exponential service

Authors:
John F. Shortle
Affiliations:
Systems Engineering and Operations Research, George Mason University, 4400 University Drive, MS 4A6, Fairfax, VA
Venue:
Performance Evaluation
Year:
2004

Citing 2
Cited 1

Heavy-tailed probability distributions in the World Wide Web

A practical guide to heavy tails
Measurement-based modelling of Internet dial-up access connections

Computer Networks: The International Journal of Computer and Telecommunications Networking

Call packing bound for overflow loss systems

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Equivalent Random Method (ERM) has been widely used to predict blocking probabilities at overflow service stations. The method assumes that service times follow an exponential distribution. While this may be a reasonable assumption for voice traffic, it is not a good assumption for dial-up Internet traffic, where service times typically have a coefficient of variation (standard deviation/mean) greater than 1. In this paper, we give a modified ERM for two-term hyper-exponential service distributions. The method is based on an efficient algorithm to estimate the peakedness of the overflow process of an M/H2/S/S queue. Finally, we investigate the accuracy of the modified ERM using simulation and also compare systems with hyper-exponential service to systems with heavy-tailed service.