A discrete-time ATM traffic model with long range dependence characteristics

نویسندگان

  • Tim Daniëls
  • Chris Blondia
چکیده

This paper presents a novel discrete-time ATM traac model which exhibits a long range dependence character. The process results from the superposition of an innnite number of on/oo sources which have an increasing mean on and oo period duration. The condition under which the process has the long range dependence property is a simple function of the parameters of the on/oo sources. Moreover, the Hurst parameter of the process is given explicitly. By considering the traac model in a matrix-analytic setting, the behaviour of a queueing system with this traac as input, can be analyzed. Also the correlation structure is characterized by means of the Index of Dispersion for Counts and its limit is investigated. Numerical examples illustrate the properties of this process.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the departure process of a leaky bucket system with long-range dependent input traffic

Due to the strong experimental evidence that the traffic to be offered to future broadband networks will display long-range dependence, it is important to study the possible implications that such traffic may have for the design and performance of these networks. In particular, an important question is whether the offered traffic preserves its long-range dependent nature after passing through a...

متن کامل

Time Scale Analysis of an ATM Queueing System with Long-Range Dependent Traffic

Several types of network trafic have been shown to exhibit long-range dependence (LRD). In this work, we show that the busy period of an ATM system driven by a long-range dependent process can be very large. We introduce a new trafjic model based on a fractional Brownian motion envelope process. We show that this characterization can be used to predict queueing dynamics. Furthermore, we derive ...

متن کامل

MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS

Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

متن کامل

ATM dynamic bandwidth allocation using F-ARIMA prediction model

Measurements of high-speed network traffic have shown that traffic data exhibits a high degree of self-similarity. Traditional traffic models such as AR and ARMA are not able to capture this long-range-dependence making them ineffective for the traffic prediction task. In this paper, we apply the fractional ARIMA (F-ARIMA) model to predict one-step-ahead traffic value at different time scales. ...

متن کامل

Time-Parallel Generation of Self-Similar ATM Traffic 1071 TIME–PARALLEL GENERATION OF SELF-SIMILAR ATM TRAFFIC

We present a time–parallel technique for the fast generation of self–similar traffic which is suitable for performance studies of Asynchronous Transfer Mode (ATM) networks. The technique is based on the well known result according to which the aggregation of a large number of heavy–tailed ON/OFF– type renewal/reward processes asymptotically approximates a Fractional Gaussian Noise (FGN) process...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997