Papers by Thomas Morsellino
A Flexible Monitoring Infrastructure for a Cloud-Based ESB
Enterprise Interoperability VI, 2014
On Snapshots and Stable Properties Detection in Anonymous Fully Distributed Systems (Extended Abstract)
Lecture Notes in Computer Science, 2012
ABSTRACT
About The Power of Anonymous Radio Networks
PLAY: Semantics-Based Event Marketplace
Debugging the Execution of Distributed Algorithms over Anonymous Networks
2012 16th International Conference on Information Visualisation, 2012
ABSTRACT Computing the global state of an asynchronous distributed system is a widely studied pro... more ABSTRACT Computing the global state of an asynchronous distributed system is a widely studied problem and finds a plethora of solutions under different assumptions. Most of them do not correspond to real-life requirements. In this paper, we address the global snapshot and the global predicate evaluation problems in anonymous and asynchronous networks. We present a fully-distributed solution which allows the debugging and the monitoring of such networks. We show that our contribution can be easily implemented and added as a new feature in existing simulation softwares by describing specifications of the used model and details of the development process. As an illustration, a debugging layer is implemented on the ViSiDiA platform.
Une Approche Métier au Développement d'Applications pour Milieux Pervasifs
We address the enumeration and the leader election problems over partially anonymous and multi-ho... more We address the enumeration and the leader election problems over partially anonymous and multi-hop broadcast networks. We consider an asynchronous communication model where each process broadcasts a message and all its neighbours receive this message after arbitrary and unpredictable time. In this paper, we present necessary conditions that must be satisfied by any graph to solve these problems and we show that these conditions are sufficient by providing an enumeration algorithm on the one hand and a leader election algorithm on the other hand. From the complexity viewpoint, our algorithms offer a polynomial complexity (memory, number of messages and size of messages).
Snapshots et Detection de Proprietes Stables dans les Systemes Distribues Anonymes
Fully-Distributed Debugging and Visualization of Distributed Systems in Anonymous Networks
A Flexible Monitoring Infrastructure for a Cloud-Based ESB
Enterprise Interoperability VI, 2014
Uploads
Papers by Thomas Morsellino