Redundant multi-path service of a flow heterogeneous in delay criticality with defined node passage paths

Abstract

An analytical model is proposed for estimating the probability of timely redundant servicing of a heterogeneous flow, which implies the creation of replicas of requests with a multiplicity depending on the total allowable waiting time in the sequence of nodes involved in servicing the request. It is shown that the reservation of queries critical to the admissible waiting time allows increasing the probability of timely execution of queries and the intensity of the profit received from servicing a non-uniform flow.

The Timeliness of the Reserved Service in the Cluster with the Regulation of the Time of Destruction of Overdue Requests in the Node Queues

“…The efficiency and expediency of redundant query execution in a cluster represented by a group of queuing systems with infinite queues is shown in [11][12][13][14][15]. The possibilities of combining the reserved service of waiting-critical requests with the regulation of the number of places in the queues of cluster system nodes are analyzed in [16]. The effect analyzed in [16] is achieved as a result of reducing the load achieved by destroying requests received when the queue length exceeds the established limits.…”

Multipath Redundant Real-Time Transmission with the Destruction of Expired Packets in Intermediate Nodes

“…A request to transmit a packet is considered successful if at least one of the generated replicas is delivered to the addressee in a timely and error-free manner. When multiple replicas are delivered, all but one is destroyed and not issued to the addressable subscriber [15,16].…”

“…Multi-path redundant service, provides for the replication of requests with the assignment for each of them of the path (route) of the sequential passage of nodes, networks [15][16][17][18]. With redundant transmissions, a step-by-step route formation is possible, when for each replica, when it passes through the next communication node, the addresses of the next node that makes up the path are assigned.…”

“…The condition for the success of reserved transfers is that the accumulated total waiting in the queues of nodes that make up the path, for at least one of the copies, should not exceed the specified maximum allowed time [15][16][17][18].…”

“…Software models [15][16][17][18] are focused on transfers in which the intermediate communication nodes do not provide for the elimination of expired replicas of the transmitted packet. It should be noted that non-destroyed replicas that have lost their relevance create unproductive loading on switching nodes, and this leads to additional delays in the delivery of transmitted data.…”