Abstract
Abstract The increased demand of real-time video applications, including IPTV in home networks and remote monitoring in Internet of Things, requires new routing mechanism to support rapid and reliable real-time data transmission, especially in the wireless networks with bandwidth limitation and at the same time with the high packet loss rate. In this paper, we study the problem of reliable multi-path routing with bandwidth and delay constraints. Considering the link loss rate, which affects the actual bandwidth, we search a set of source-destination paths such that the valid aggregated bandwidth satisfies the requirements and meanwhile the maximum delay is minimized. Since this multi-path routing problem is NP-hard, we first propose a heuristic algorithm as the benchmark, and then present a polynomial time approximation algorithm to obtain a ( 1+ϵ )-approximation solution. Simulations on well-known Internet topologies and random architectures verify the performance of our algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
