Author :
Yu, Jie ; Petropulu, Athina A. ; Sethu, Harish
Author_Institution :
Dept. of Electr. & Comput. Eng., Drexel Univ., Philadelphia, PA, USA
Abstract :
The Extended Alternating Fractal Renewal Process (EAFRP) model has recently been proposed for modeling the self-similar and impulsive traffic of high-speed networks. For mathematical simplicity, it assumes that the available transmission bandwidth in the network is infinite. In reality, the network has a limit R on the total traffic rate through it, and in addition, the ith user´s traffic rate is often limited to special value Li, which is assigned by the bandwidth sharing protocol. We propose a model for single-user traffic, which, by taking into account the aforementioned rate limit Li and R, and in the absence of congestion, provides insight on the distinctive two slope behavior of the loglog survival function of multiuser traffic. For small to medium number of users, such as in local area networks (LANs), the model results in non-Gaussian traffic, whereas as the number of users increases, the resulting traffic is Gaussian, both of which are consistent with real network measurements. We discuss model parameter estimation, provide queuing analysis of the multiple-user traffic model, and, based on real data, show that it achieves a closer approximation of the observed reality than existing models.
Keywords :
Gaussian processes; fractals; local area networks; parameter estimation; protocols; queueing theory; telecommunication traffic; bandwidth sharing protocol; extended alternating fractal renewal process model; high-speed network traffic; impulsive traffic; local area network; loglog survival function; model parameter estimation; multiuser traffic; nonGaussian traffic; queuing analysis; rate-limited EAFRP; single-user traffic; Area measurement; Bandwidth; Fractals; High-speed networks; Local area networks; Parameter estimation; Protocols; Queueing analysis; Telecommunication traffic; Traffic control; High-speed network traffic; impulsive traffic; traffic modeling;