2 research outputs found

    A MDP approach to fault-tolerant routing

    No full text
    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. © 2012 EUCA

    A MDP Approach to Fault-Tolerant Routing

    No full text
    This paper defines a theoretical framework based on Markov Decision Processes (MDP) to deal with fault-tolerant routing algorithms in heterogeneous home networks, which are realized through the integration of different wired and wireless telecommunication technologies. Such networks are characterized by fast dynamics of link availability, mainly due to the wide use of wireless technologies. The novelty of this paper is the MDP approach to the fault-tolerant routing problem, which is addressed by introducing a re-routing policy: when a path becomes unavailable, the flows transmitted over that path are re-routed on another available path; the new path is selected taking into consideration the probability that also the new path can become unavailable in the future, in order to minimize re-routing occurrences. Numerical simulations show the effectiveness of the proposed approach. ©2009 IEEE
    corecore