Delay-constrained maximum reliability routing over lossy links
2010 (English)In: Proceedings of the IEEE Conference on Decision and Control, IEEE , 2010, 973-978 p.Conference paper (Refereed)
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.
Place, publisher, year, edition, pages
IEEE , 2010. 973-978 p.
Bernoulli; Joint routing; Latency bounds; Lossy links; Lossy networks; Maximum reliability; Packet Delivery; Packet loss probability; Real-time communication; Transmission scheduling; Transmission scheduling policies
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-46467DOI: 10.1109/CDC.2010.5717308ISI: 000295049101037ScopusID: 2-s2.0-79953134950ISBN: 978-142447745-6OAI: oai:DiVA.org:kth-46467DiVA: diva2:453733
49th IEEE Conference on Decision and Control (CDC), 2010
© 2010 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
QC 201111242011-11-242011-11-032011-11-24Bibliographically approved