Dynamics of Rumor Spreading in Complex Networks

We derive the mean-field equations characterizing the dynamics of a rumor process that takes place on top of complex heterogeneous networks. These equations are solved numerically by means of a stochastic approach. First, we present analytical and Monte Carlo calculations for homogeneous networks and compare the results with those obtained by the numerical method. Then, we study the spreading process in detail for random scale-free networks. The time profiles for several quantities are numerically computed, which allow us to distinguish among different variants of rumor spreading algorithms. Our conclusions are directed to possible applications in replicated database maintenance, peer to peer communication networks and social spreading phenomena.Comment: Final version to appear in PR

Self-Management GRID Services – A Programmable Network Approach

Due to the complexity and size of service oriented GRIDs, it is essential that GRID systems should be autonomous i.e. a self-management system is needed. This paper identifies the requirements of such a self-management GRID system and the required supporting services. This paper suggests that these supporting services should be deployed in the form of software modules through programmable techniques. This paper presents a communication protocol for dynamic self-configuration in programmable GRIDs as an example for supporting new network services