Queuing theory based analysis for packet jitter of mixed services

Exploring theory and methods to analyze the impacts of non real-time services on jitter performance of real-time services is a quite challenging but meaningful job. This article puts forward a general theoretical method to calculate packet jitter in network node bearing mixed services. Based on queuing theory and Markov theory, the network node is modeled as a double-queue single-server and limited-cache queuing system with thresholds. Two-state Markov-modulated Bernoulli process (MMBP-2) and interrupted Bernoulli process (IBP) are used to model the arrival processes of real-time services and small data services respectively in a packet switched network. In order to depict the interaction between real-time services and small data services, a four-dimensional discrete-time Markov chain is implemented to describe the transition of the system states. By solving the system model, expressions for packet jitter are obtained. The results given by the model are then compared with the simulation results obtained by network simulator, version 3 (NS-3).