METHOD OF SERVICING DIFFERENT-PRIORITY PACKETS IN MULTI-SERVICE NETWORKS Russian patent published in 2013 - IPC H04L12/875 

FIELD: information technology.

SUBSTANCE: packet servicing maximum waiting time codes (T_ser.i) are used, during generation of which the type of service (j) to which the packet belongs and the time spent by the packet in the queue are taken into account. The maximum waiting time codes are determined using the formula: T_ser.i=η_j(min(t_del.j,t_del.i)-t_ij), where i=1,2,…,N is the corresponding priority number of the i-th packet; N is the total number of packets; j=1,2_,…K is the number of service of the multi-service network; K is the total number of services of the multi-service network; η_i is the weight coefficient for the j-th service; t_del.i is the allowable dwell time of the i-th packet in the computing system; t_del.j is the delay time requirement for the packet of the j-th service in the multi-service network; t_ij is the time spent by the packet in the queue.

EFFECT: high probability of timely servicing of low-priority packets, reduced packet loss due to the exceeding of time-out, fewer cases of retransmission.

4 dwg