Performance analysis of reassembly and multiplexing queueing with long-range-dependent input traffic

This paper studies the impact of long-range-dependent (LRD) traffic on the performance of reassembly and multiplexing queueing. A queueing model characterizing the general reassembly and multiplexing operations performed in packet networks is developed and analyzed. The buffer overflow probabilities for both reassembly and multiplexing queues are derived by extending renewal analysis and Beneˇs fluid queue analysis, respectively. Tight upper and lower bounds of the frame loss probabilities are also analyzed and obtained. Our analysis is not based on existing asymptotic methods, and it provides new insights regarding the practical impact of LRD traffic. For the reassembly queue, the results show that LRD traffic and conventional Markov traffic yield similar queueing behavior. For the multiplexing queue, the results show that the LRD traffic has a significant impact on the buffer requirement when the target loss probability is small, including for practical ranges of buffer size or maximum delay