In Queueing Analysis are works that provide mathematical models of long-range dependent traffic with a view toward facilitating performance analysis in the queueing theory sense [10], etc. The works establish basic performance boundaries by investigating queueing behavior with long-range dependent input, which exhibit performance characteristics fundamentally different from corresponding systems with Markovian input. In particular, the queue length distribution in infinite buffer systems has a slower-than exponentially decreasing tail, in contrast with short-range dependent input for which the decay is exponential.