Packet Switching Management in Telematics Devices with Finite Buffer Size Using Preemptive Priority Queueing and Randomized Push-out mechanism. Part 2

O. I. Zayats , e-mail: zayats@amd.stu.neva.ru, Zaborovsky V. S. , e-mail: vlad@neva.ru, Muliukha V. A. , e-mail: vladimir@mail.neva.ru, A. S. Verbenko

In this part of the paper basic specifications of telematics systems described in the first part are calculated for random values of a push-out probability α. The problem is solved by generating functions. When the system capacity is equal to k packets, the proposed method allows to reduce the order of the system of linear algebraic equations in k/2 times from k(k + 1)/2 to (k + 1). The dependence of the probability of packet loss and network latency on the α parameter is analyzed. The results explain a number of effects that were observed in natural experiment, in particular the linear law of the packet loss in non-congested network, and the possibility of "blocking" non-priority traffic in congested network increasing the α value. An example of media traffic management is presented.

Keywords: priority queueing, preemptive priority, randomized push out mechanism, packet traffic, telematics systems management

pp. 21–29