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 / Pietrabissa, Antonio; Castrucci, Marco; Palo, Andi. - In: EUROPEAN JOURNAL OF CONTROL. - ISSN 0947-3580. - 18:4(2012), pp. 334-347. [10.3166/ejc.18.334-347]

A MDP approach to fault-tolerant routing

PIETRABISSA, Antonio;CASTRUCCI, MARCO;PALO, ANDI
2012

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. © 2012 EUCA.
markov decision process; fault tolerant control; stochastic control; routing; communication networks; faulttolerant; markov decision processes
01 Pubblicazione su rivista::01a Articolo in rivista
A MDP approach to fault-tolerant routing / Pietrabissa, Antonio; Castrucci, Marco; Palo, Andi. - In: EUROPEAN JOURNAL OF CONTROL. - ISSN 0947-3580. - 18:4(2012), pp. 334-347. [10.3166/ejc.18.334-347]
File allegati a questo prodotto
File Dimensione Formato  
VE_2012_11573-396957.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 355.13 kB
Formato Adobe PDF
355.13 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/396957
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 4
  • ???jsp.display-item.citation.isi??? 3
social impact