Publish/subscribe middleware is being increasingly used to devise large-scale critical systems. Although several reliable publish/subscribe solutions have been proposed, none of them properly address the problem of assuring message dissemination even if network omissions happen without breaking any temporal constraints. In order to fill this gap, we have investigated how to guarantee a resilient and timely event dissemination despite of message losses. The contribution of this paper is on proposing a FEC approach, where encoding functionality is placed at the root and on a subset of interior nodes in the multicast tree, combined to a gossiping algorithm. Simulation-based experiments demonstrate that the proposed approach allows all the interested subscribers to receive all the published messages and the adopted resiliency mean does not affect the timeliness of the multicast protocol.
Reliable Event Dissemination over Wide-Area Networks without Severe Performance Fluctuations / Esposito, Christiancarmine; Cotroneo, Domenico; Russo, Stefano. - (2010), pp. 97-101. (Intervento presentato al convegno 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing (ISORC) tenutosi a Carmona, Spain nel May 5-6, 2010) [10.1109/ISORC.2010.14].
Reliable Event Dissemination over Wide-Area Networks without Severe Performance Fluctuations
ESPOSITO, CHRISTIANCARMINE;COTRONEO, DOMENICO;RUSSO, STEFANO
2010
Abstract
Publish/subscribe middleware is being increasingly used to devise large-scale critical systems. Although several reliable publish/subscribe solutions have been proposed, none of them properly address the problem of assuring message dissemination even if network omissions happen without breaking any temporal constraints. In order to fill this gap, we have investigated how to guarantee a resilient and timely event dissemination despite of message losses. The contribution of this paper is on proposing a FEC approach, where encoding functionality is placed at the root and on a subset of interior nodes in the multicast tree, combined to a gossiping algorithm. Simulation-based experiments demonstrate that the proposed approach allows all the interested subscribers to receive all the published messages and the adopted resiliency mean does not affect the timeliness of the multicast protocol.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.