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

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

In the paper the mathematical model of telematics system is studied. It is a single-channel double-stream priority queueing system with finite buffer size. Packet traffic generated from the commands is a priority one and it has two advantages over the other traffic: a preemptive priority and randomized push out mechanism in the buffer memory. Priority packets have a chance 0 < α < 1 to push remaining packets out of the buffer. The value of α is the control parameter that enables to adjust adaptively the control algorithm of packet switching and to reallocate efficiently available network throughput for the virtual connections of various types. An example of such approach is the algorithms for the remote control of robotic devices in the space experiment on the ISS. In the paper it is considered an analytic solution by the method of generating functions for the deterministic push out mechanism (α = 1) and explained the basic ideas of the general solution

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

pp. 22–28