For example,Бобцов

Multipath routing in networks with accelerated message delivery

Annotation

This article examines the geography-aware class of telecommunication networks with mobile nodes. Their defining feature is that each network device knows the geographic coordinates of all other devices and, consequently, is fully aware of the network graph. The aim of this work is to develop a technique for constructing a set of message transmission paths with subsequent placement of messages across these paths. A multipath routing technique is introduced, featuring a procedure for finding a set of paths within the network that connect the message source to the target node. This procedure is based on a modified Dijkstra’s algorithm for determining the shortest path in a directed graph. A method for constructing additional paths is described, which utilizes both the minimum path length criterion and the criterion of minimum intersections with the original shortest path. To accelerate message delivery, the proposed routing technique involves a preliminary ordering of the output message queue based on optimal scheduling rules. The optimality criterion is the minimization of total message delivery time. These rules are formulated for various scenarios involving the presence of pre-partially ordered and unordered message groups within the queue. The process concludes with a procedure for placing the ordered queue onto the set of information transmission paths. The proposed technique is exemplified by transmitting a message queue containing three pre-ordered groups. The difference in the resulting orderings is demonstrated for cases where preemptions are prohibited and where they are allowed. The feasibility of applying the proposed technique is determined by the performance of the device onboard processor, which is assumed to be a priori sufficient in the case of an autonomous unmanned underwater vehicle.

Keywords

Постоянный URL

Articles in current issue

CONTENT © ITMO UNIVERSITY 1993-2026