Timothy D. Neame

Learn More
— This paper presents the Poisson Pareto burst process (PPBP) as a simple but accurate model for Internet traffic. It presents formulae relating the parameters of the PPBP to measurable traffic statistics, and describes a technique for fitting the PPBP to a given traffic stream. The PPBP is shown to accurately predict the queueing performance of a sample(More)
This paper provides means for performance evaluation of a queue with Poisson Pareto Burst Process (PPBP) input. Because of the long range dependent nature of the PPBP, straightforward simulations are unreliable. New analytical and simulation techniques are described in this paper. Numerical comparison between the results shows consistency. Conservative(More)
This paper presents steps towards creating a general model for aggregated traffic streams. We show that fitting the mean, variance and Hurst parameter is insufficient to consistently model a long range dependent traffic stream. A fourth parameter , the " level of aggregation, " is required. We also show that with increased aggregation, the behaviour of a(More)
This paper presents the M/Pareto model as a potentially useful tool in the modeling of broadband traffic streams. We show that this model can be used to accurately estimate the queueing performance of a variety of realistic multimedia traffic streams. We also show a practical way to fit the parameters of the model with those of the real traffic stream. We(More)
This paper presents the M/Pareto process as a practical model for mul-timedia traac. We explain the M/Pareto model, discuss its advantages and limitations, and demonstrate its ability to accurately predict the queueing performance of multimedia traac. 1. INTRODUCTION Dimensioning and evaluation of traditional telephony networks is comparatively simple, with(More)
There have been many queuing analyses for a single server queue fed by an M/G/∞ traffic process, in which G is a Pareto Distribution, that focus on certain limiting conditions. In this paper we enhance the so-called Quasi-Stationary (QS) approximation – a queuing analysis introduced previously that provides an algorithm for computation of an accurate(More)
In this paper we examine the usefulness of the M/Pareto process as a model for broadband traffic. We show that the queueing performance of the M/Pareto process depends upon the level of aggregation in the process. When the level of aggregation is high, the M/Pareto converges to a long range dependent Gaussian process. For lower levels of ag-gregation, the(More)