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. The authors 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. They develop dynamic programming-based solutions for deadline-constrained maximum reliability routing under Bernoulli and Gilbert-Elliot packet loss models.

Provided by: KTH - Royal Institute of Technology Topic: Mobility Date Added: Sep 2010 Format: PDF

Find By Topic