8,023 research outputs found
New approaches to model and study social networks
We describe and develop three recent novelties in network research which are
particularly useful for studying social systems. The first one concerns the
discovery of some basic dynamical laws that enable the emergence of the
fundamental features observed in social networks, namely the nontrivial
clustering properties, the existence of positive degree correlations and the
subdivision into communities. To reproduce all these features we describe a
simple model of mobile colliding agents, whose collisions define the
connections between the agents which are the nodes in the underlying network,
and develop some analytical considerations. The second point addresses the
particular feature of clustering and its relationship with global network
measures, namely with the distribution of the size of cycles in the network.
Since in social bipartite networks it is not possible to measure the clustering
from standard procedures, we propose an alternative clustering coefficient that
can be used to extract an improved normalized cycle distribution in any
network. Finally, the third point addresses dynamical processes occurring on
networks, namely when studying the propagation of information in them. In
particular, we focus on the particular features of gossip propagation which
impose some restrictions in the propagation rules. To this end we introduce a
quantity, the spread factor, which measures the average maximal fraction of
nearest neighbors which get in contact with the gossip, and find the striking
result that there is an optimal non-trivial number of friends for which the
spread factor is minimized, decreasing the danger of being gossiped.Comment: 16 Pages, 9 figure
Highly intensive data dissemination in complex networks
This paper presents a study on data dissemination in unstructured
Peer-to-Peer (P2P) network overlays. The absence of a structure in unstructured
overlays eases the network management, at the cost of non-optimal mechanisms to
spread messages in the network. Thus, dissemination schemes must be employed
that allow covering a large portion of the network with a high probability
(e.g.~gossip based approaches). We identify principal metrics, provide a
theoretical model and perform the assessment evaluation using a high
performance simulator that is based on a parallel and distributed architecture.
A main point of this study is that our simulation model considers
implementation technical details, such as the use of caching and Time To Live
(TTL) in message dissemination, that are usually neglected in simulations, due
to the additional overhead they cause. Outcomes confirm that these technical
details have an important influence on the performance of dissemination schemes
and that the studied schemes are quite effective to spread information in P2P
overlay networks, whatever their topology. Moreover, the practical usage of
such dissemination mechanisms requires a fine tuning of many parameters, the
choice between different network topologies and the assessment of behaviors
such as free riding. All this can be done only using efficient simulation tools
to support both the network design phase and, in some cases, at runtime
Automating the mean-field method for large dynamic gossip networks
We investigate an abstraction method, called mean- field method, for the performance evaluation of dynamic net- works with pairwise communication between nodes. It allows us to evaluate systems with very large numbers of nodes, that is, systems of a size where traditional performance evaluation methods fall short.\ud
While the mean-field analysis is well-established in epidemics and for chemical reaction systems, it is rarely used for commu- nication networks because a mean-field model tends to abstract away the underlying topology.\ud
To represent topological information, however, we extend the mean-field analysis with the concept of classes of states. At the abstraction level of classes we define the network topology by means of connectivity between nodes. This enables us to encode physical node positions and model dynamic networks by allowing nodes to change their class membership whenever they make a local state transition. Based on these extensions, we derive and implement algorithms for automating a mean-field based performance evaluation
LUNES: Agent-based Simulation of P2P Systems (Extended Version)
We present LUNES, an agent-based Large Unstructured NEtwork Simulator, which
allows to simulate complex networks composed of a high number of nodes. LUNES
is modular, since it splits the three phases of network topology creation,
protocol simulation and performance evaluation. This permits to easily
integrate external software tools into the main software architecture. The
simulation of the interaction protocols among network nodes is performed via a
simulation middleware that supports both the sequential and the
parallel/distributed simulation approaches. In the latter case, a specific
mechanism for the communication overhead-reduction is used; this guarantees
high levels of performance and scalability. To demonstrate the efficiency of
LUNES, we test the simulator with gossip protocols executed on top of networks
(representing peer-to-peer overlays), generated with different topologies.
Results demonstrate the effectiveness of the proposed approach.Comment: Proceedings of the International Workshop on Modeling and Simulation
of Peer-to-Peer Architectures and Systems (MOSPAS 2011). As part of the 2011
International Conference on High Performance Computing and Simulation (HPCS
2011
For the good of the group? Exploring group-level evolutionary adaptations using multilevel selection theory.
In this paper, we present an evolutionary framework, multilevel selection theory (MLS), that is highly amenable to existing social psychological theory and empiricism. MLS provides an interpretation of natural selection that shows how group-beneficial traits can evolve, a prevalent implication of social psychological data. We outline the theory and provide a number of example topics, focusing on prosociality, policing behavior, gossip, brainstorming, distributed cognition, and social identity. We also show that individual differences can produce important group-level outcomes depending on differential aggregation of individual types and relate this to the evolutionary dynamics underlying group traits. Drawing on existing work, we show how social psychologists can integrate this framework into their research program and suggest future directions for research
The age of information in gossip networks
We introduce models of gossip based communication networks in which each node
is simultaneously a sensor, a relay and a user of information. We model the
status of ages of information between nodes as a discrete time Markov chain. In
this setting a gossip transmission policy is a decision made at each node
regarding what type of information to relay at any given time (if any). When
transmission policies are based on random decisions, we are able to analyze the
age of information in certain illustrative structured examples either by means
of an explicit analysis, an algorithm or asymptotic approximations. Our key
contribution is presenting this class of models.Comment: 15 pages, 8 figure
Improving the Scalability of DPWS-Based Networked Infrastructures
The Devices Profile for Web Services (DPWS) specification enables seamless
discovery, configuration, and interoperability of networked devices in various
settings, ranging from home automation and multimedia to manufacturing
equipment and data centers. Unfortunately, the sheer simplicity of event
notification mechanisms that makes it fit for resource-constrained devices,
makes it hard to scale to large infrastructures with more stringent
dependability requirements, ironically, where self-configuration would be most
useful. In this report, we address this challenge with a proposal to integrate
gossip-based dissemination in DPWS, thus maintaining compatibility with
original assumptions of the specification, and avoiding a centralized
configuration server or custom black-box middleware components. In detail, we
show how our approach provides an evolutionary and non-intrusive solution to
the scalability limitations of DPWS and experimentally evaluate it with an
implementation based on the the Web Services for Devices (WS4D) Java Multi
Edition DPWS Stack (JMEDS).Comment: 28 pages, Technical Repor
- …