Silvia Bonomi

Learn More
In this paper we investigate the problem of counting the size of a network where processes are anonymous (i.e, they share the same identifier) and the network topology constantly changes controlled by an adversary able to look internal process states and add and remove edges in order to contrast the convergence of the algorithm to the correct count. It is(More)
Counting is a fundamental problem of every distributed system as it represents a basic building block to implement high level abstractions. In anonymous dynamic networks, counting is far from being trivial as nodes have no identity and the knowledge about the network is limited to the local perception of the process itself. Moreover, nodes have to cope with(More)
Glutamatergic dysfunction is one of the major hypotheses for the pathogenesis of schizophrenia. The GRIA1 gene encodes for one (GluR1) of the four (GluR1-4) ionotropic AMPA receptor subunits. GRIA1 is a good candidate gene for susceptibility to schizophrenia since it maps in 5q33, a region where the presence of susceptibility loci has been suggested by(More)
Providing distributed processes with concurrent objects is a fundamental service that has to be offered by any distributed system. The classical shared read/write register is one of the most basic ones. Several protocols have been proposed that build an atomic register on top of an asyn- chronous message-passing system prone to process crashes. In the same(More)
Due to their capability to hide the complexity generated by the messages exchanged between processes, shared objects are one of the main abstractions provided to developers of distributed applications. Implementations of such objects, in modern distributed systems, have to take into account the fact that almost all services, implemented on top of(More)
The advances of pervasive technology offer new standards for user comfort by adding intelligence to ubiquitous home and office appliances. With intelligence being the core of some newly constructed buildings, it is important to design a scalable, robust, context-aware architecture, which not only has enough longevity and evolving capabilities to sustain(More)
Overlay management protocols have been introduced to guarantee overlay network connectivity in dynamic large- scale peer-to-peer systems. Some of these protocols have been specifically designed to avoid the partitioning of the overlay in large clusters (network breakage) despite massive node failures and the continuous arrivals/departures of nodes (churn).(More)
Data Centers are evolving to adapt to emerging IT trends such as Big Data and Cloud Computing, which push for increased scalability and improved service availability. Among the side effects of this kind of evolution, the proliferation of new security breaches represents a major issue that usually does not get properly addressed since the focus tends to be(More)
This paper considers the Approximate Agreement problem in presence of mobile Byzantine agents. We prove lower bounds on the number of correct processes to solve such problem. To do that we prove that the existing solutions tolerant to Byzantine agents still holds in such case and under which conditions.