9,367 research outputs found
Cognition-Based Networks: A New Perspective on Network Optimization Using Learning and Distributed Intelligence
IEEE Access
Volume 3, 2015, Article number 7217798, Pages 1512-1530
Open Access
Cognition-based networks: A new perspective on network optimization using learning and distributed intelligence (Article)
Zorzi, M.a , Zanella, A.a, Testolin, A.b, De Filippo De Grazia, M.b, Zorzi, M.bc
a Department of Information Engineering, University of Padua, Padua, Italy
b Department of General Psychology, University of Padua, Padua, Italy
c IRCCS San Camillo Foundation, Venice-Lido, Italy
View additional affiliations
View references (107)
Abstract
In response to the new challenges in the design and operation of communication networks, and taking inspiration from how living beings deal with complexity and scalability, in this paper we introduce an innovative system concept called COgnition-BAsed NETworkS (COBANETS). The proposed approach develops around the systematic application of advanced machine learning techniques and, in particular, unsupervised deep learning and probabilistic generative models for system-wide learning, modeling, optimization, and data representation. Moreover, in COBANETS, we propose to combine this learning architecture with the emerging network virtualization paradigms, which make it possible to actuate automatic optimization and reconfiguration strategies at the system level, thus fully unleashing the potential of the learning approach. Compared with the past and current research efforts in this area, the technical approach outlined in this paper is deeply interdisciplinary and more comprehensive, calling for the synergic combination of expertise of computer scientists, communications and networking engineers, and cognitive scientists, with the ultimate aim of breaking new ground through a profound rethinking of how the modern understanding of cognition can be used in the management and optimization of telecommunication network
Spatiotemporal Patterns and Predictability of Cyberattacks
Y.C.L. was supported by Air Force Office of Scientific Research (AFOSR) under grant no. FA9550-10-1-0083 and Army Research Office (ARO) under grant no. W911NF-14-1-0504. S.X. was supported by Army Research Office (ARO) under grant no. W911NF-13-1-0141. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.Peer reviewedPublisher PD
Voter models on weighted networks
We study the dynamics of the voter and Moran processes running on top of
complex network substrates where each edge has a weight depending on the degree
of the nodes it connects. For each elementary dynamical step the first node is
chosen at random and the second is selected with probability proportional to
the weight of the connecting edge. We present a heterogeneous mean-field
approach allowing to identify conservation laws and to calculate exit
probabilities along with consensus times. In the specific case when the weight
is given by the product of nodes' degree raised to a power theta, we derive a
rich phase-diagram, with the consensus time exhibiting various scaling laws
depending on theta and on the exponent of the degree distribution gamma.
Numerical simulations give very good agreement for small values of |theta|. An
additional analytical treatment (heterogeneous pair approximation) improves the
agreement with numerics, but the theoretical understanding of the behavior in
the limit of large |theta| remains an open challenge.Comment: 21 double-spaced pages, 6 figure
- âŚ