390 research outputs found
Modeling the Internet
We model the Internet as a network of interconnected Autonomous Systems which
self-organize under an absolute lack of centralized control. Our aim is to
capture how the Internet evolves by reproducing the assembly that has led to
its actual structure and, to this end, we propose a growing weighted network
model driven by competition for resources and adaptation to maintain
functionality in a demand and supply ``equilibrium''. On the demand side, we
consider the environment, a pool of users which need to transfer information
and ask for service. On the supply side, ASs compete to gain users, but to be
able to provide service efficiently, they must adapt their bandwidth as a
function of their size. Hence, the Internet is not modeled as an isolated
system but the environment, in the form of a pool of users, is also a
fundamental part which must be taken into account. ASs compete for users and
big and small come up, so that not all ASs are identical. New connections
between ASs are made or old ones are reinforced according to the adaptation
needs. Thus, the evolution of the Internet can not be fully understood if just
described as a technological isolated system. A socio-economic perspective must
also be considered.Comment: Submitted to the Proceedings of the 3rd International Conference
NEXT-SigmaPh
Accurately modeling the Internet topology
Based on measurements of the Internet topology data, we found out that there
are two mechanisms which are necessary for the correct modeling of the Internet
topology at the Autonomous Systems (AS) level: the Interactive Growth of new
nodes and new internal links, and a nonlinear preferential attachment, where
the preference probability is described by a positive-feedback mechanism. Based
on the above mechanisms, we introduce the Positive-Feedback Preference (PFP)
model which accurately reproduces many topological properties of the AS-level
Internet, including: degree distribution, rich-club connectivity, the maximum
degree, shortest path length, short cycles, disassortative mixing and
betweenness centrality. The PFP model is a phenomenological model which
provides a novel insight into the evolutionary dynamics of real complex
networks.Comment: 20 pages and 17 figure
Modeling the Internet of Things: a simulation perspective
This paper deals with the problem of properly simulating the Internet of
Things (IoT). Simulating an IoT allows evaluating strategies that can be
employed to deploy smart services over different kinds of territories. However,
the heterogeneity of scenarios seriously complicates this task. This imposes
the use of sophisticated modeling and simulation techniques. We discuss novel
approaches for the provision of scalable simulation scenarios, that enable the
real-time execution of massively populated IoT environments. Attention is given
to novel hybrid and multi-level simulation techniques that, when combined with
agent-based, adaptive Parallel and Distributed Simulation (PADS) approaches,
can provide means to perform highly detailed simulations on demand. To support
this claim, we detail a use case concerned with the simulation of vehicular
transportation systems.Comment: Proceedings of the IEEE 2017 International Conference on High
Performance Computing and Simulation (HPCS 2017
Understanding edge-connectivity in the Internet through core-decomposition
Internet is a complex network composed by several networks: the Autonomous
Systems, each one designed to transport information efficiently. Routing
protocols aim to find paths between nodes whenever it is possible (i.e., the
network is not partitioned), or to find paths verifying specific constraints
(e.g., a certain QoS is required). As connectivity is a measure related to both
of them (partitions and selected paths) this work provides a formal lower bound
to it based on core-decomposition, under certain conditions, and low complexity
algorithms to find it. We apply them to analyze maps obtained from the
prominent Internet mapping projects, using the LaNet-vi open-source software
for its visualization
Vertex importance extension of betweenness centrality algorithm
Variety of real-life structures can be simplified by a graph. Such simplification emphasizes the structure represented by vertices connected via edges. A common method for the analysis of the vertices importance in a network is betweenness centrality. The centrality is computed using the information about the shortest paths that exist in a graph. This approach puts the importance on the edges that connect the vertices. However, not all vertices are equal. Some of them might be more important than others or have more significant influence on the behavior of the network. Therefore, we introduce the modification of the betweenness centrality algorithm that takes into account the vertex importance. This approach allows the further refinement of the betweenness centrality score to fulfill the needs of the network better. We show this idea on an example of the real traffic network. We test the performance of the algorithm on the traffic network data from the city of Bratislava, Slovakia to prove that the inclusion of the modification does not hinder the original algorithm much. We also provide a visualization of the traffic network of the city of Ostrava, the Czech Republic to show the effect of the vertex importance adjustment. The algorithm was parallelized by MPI (http://www.mpi-forum.org/) and was tested on the supercomputer Salomon (https://docs.it4i.cz/) at IT4Innovations National Supercomputing Center, the Czech Republic.808726
- …