Abstract
This paper defines a theoretical framework based on Markov Decision Processes (MDP) to deal with faulttolerant routing algorithms in heterogeneous networks, which are realized through the integration of assorted wired and wireless telecommunication technologies. Such kinds of networks are characterized by fast dynamics of link availabilities, mainly due to the extensive use of wireless technologies. The novelty of this paper is the formulation of the fault-tolerant routing problem as a MDP, which is used to compute the optimal re-routing policy. As in existing fault-tolerant algorithms, when a path becomes unavailable, the traffic flows transmitted over that path are re-routed on another available path; the novelty is that the new selected path is the one that minimizes re-routing occurrences, since it is selected taking into consideration the probability that also the alternative paths can become unavailable in the future. As a by-product, the optimal path selection for newtraffic flows is also obtained. Simulations show the effectiveness of the proposed approach.
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.
