Delay-constrained maximum reliability routing over lossy links

This paper studies the problem of joint routing and transmission scheduling for reliable real-time communication over lossy networks. We impose a strict latency bound on the packet delivery from source to destination and develop transmission scheduling policies that maximize the probability that the packet is delivered within the specified deadline. A solution to this problem allows to characterize the set of achievable latencies and packet loss probabilities for a given network. We develop dynamic programming-based solutions for deadline-constrained maximum reliability routing under Bernoulli and Gilbert-Elliot packet loss models. Particular instances of the problem that admit numerically efficient solutions are discussed and our results are demonstrated on several examples.