Performance evaluation of jitter management algorithms

This paper studies some jitter management algorithms for real-time applications. These algorithms are executed at a destination node, and assume no knowledge of the source characteristic or the impact of the network path characteristic. Our work mainly focuses on prediction algorithms that make use of the information of the packets received in the past. The algorithm would predict the delay of the future packet arrival time so that the buffer parameters can be dynamically changed in order to adapt to the bursty network traffic. These parameters are required to guarantee a certain level of quality of service (QoS). The algorithms are evaluated using OPNET simulation and compared with some other algorithms such as I-policy and E-policy. We also studied and discussed the tradeoff among display latency, gap probability and packet discarding rates.