doi:10.1016/j.peva.2004.11.007
Copyright © 2005 Elsevier B.V. All rights reserved.
Effective bandwidth for a single server queueing system with fractional Brownian input
References and further reading may be available for this article. To view references and further reading you must
purchase this article.
Sunggon Kima,
,
, Seung Yeob Namb,
and Dan Keun Sungc, 
aDepartment of Information Statistics, Gyeongsang National University, Jinju 660-701, Republic of Korea
bCyLab, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA 15213, USA
cDepartment of Electrical Engineering and Computer Science, KAIST, Daejeon 305-701, Republic of Korea
Available online 1 January 2005.
Abstract
The traffic patterns of today’s IP networks exhibit two important properties: self-similarity and long-range dependence. The fractional Brownian motion is widely used for representing the traffic model with the properties. We consider a single server fluid queueing system with input process of a fractional Brownian motion type. Packet-loss probability and mean delay are considered as QoS. We show that there is a scaling property among the stationary queue-length distributions of different input parameters and service rates. We also evaluate the scaling factor. From the scaling property, we drive formulas for the effective bandwidth to guarantee the QoS in a single source and multiple sources cases. The formulas indicate that it is essential to evaluate the distribution functions of a type of random variables. For multiple sources the shape of an admissible region and multiplexing gain are analyzed. Finally, numerical examples are shown to validate the proposed scheme.
Keywords: Effective bandwidth; Fractional Brownian motion; Fluid queueing system; Admissible region; Multiplexing gain
Fig. 1. Graphical explanation for finding the solution ed.
Fig. 2. A graph of
.
Fig. 3. Histograms of the traffic rates for the four types of M/G/∞ traffic traces.
Table 3.
Selected values of
when H=0.8

Table 4.
The parameters of the input processes

Table 5.
Effective bandwidth(Mbps) under an overflow constraint of 0.0001 by the proposed scheme

Table 6.
Effective bandwidth (Mbps) under an overflow constraint of 0.0001 by simulation

Table 7.
Effective bandwidth (Mbps) under various delay constraints by the proposed scheme

Table 8.
Effective bandwidth (Mbps) under various delay constraints by simulation

Table 9.
Mean queue length (packets) under the service rate of effective bandwidth satisfying the overflow constraint of 0.0001

Table 10.
Mean queue length (packets) under the service rate of effective bandwidth satisfying the delay constraints

Table 11.
Parameters of the four M/G/∞ type input processes

Table 12.
Statistics for the four types of M/G/∞ traffic traces and effective bandwidths by the proposed scheme and simulations


Corresponding author.