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 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)
—We consider a special case of the M/G/∞ traffic process, named as Poisson Lomax Burst Process (PLBP), where the burst lengths follow the Lomax distribution. We illustrate its advantage in modelling Internet traffic flow sizes, particularly, its ability to capture a large number of small flows. We provide two approximations based on analytical and fast(More)
—In this letter we attempt to quantify the extent to which using the sustainable rate as an estimate of the mean transfer rate results in the wastage of bandwidth. We treat users as on–off traffic sources with arbitrary on and off times, and use allocations based on Gaussian assumptions. We also confirm that this model is consistent with our intuitive(More)
—We present a new perspective on effective bandwidths which allows us to squeeze the most from a network while still meeting QoS constraints. We show that if buffer space requirements are also considered, the effective bandwidth of a given stream can be considerably reduced. This reduction in capacity is shown to have little or no impact on the ability of(More)
  • 1