Research on the Robustness of Peer-to-Peer Overlay

2013 ◽  
Vol 427-429 ◽  
pp. 2884-2887
Author(s):  
Zhi Yong Jiang

Many complex networks display a surprising degree of tolerance against error comes at a high price in that these networks are extremely vulnerable to attacks (that is , to the removal of a few nodes that play a vital role in the networks). Complex peer-to-peer overlay networks display a surprising degree of robustness: although some components regularly malfunction, local failures rarely lead to the loss of the information carrying ability of the network. The stability of these and other complex systems is often attributed to the redundant wiring of the functional web defined by the systems components. In this paper a model of peer-to-peer overlay is presented based on the actual topology. According to the model it is found that such error tolerance and attack vulnerability are generic properties of peer-to-peer overlay.

Author(s):  
Stefan Thurner ◽  
Rudolf Hanel ◽  
Peter Klimekl

Understanding the interactions between the components of a system is key to understanding it. In complex systems, interactions are usually not uniform, not isotropic and not homogeneous: each interaction can be specific between elements.Networks are a tool for keeping track of who is interacting with whom, at what strength, when, and in what way. Networks are essential for understanding of the co-evolution and phase diagrams of complex systems. Here we provide a self-contained introduction to the field of network science. We introduce ways of representing and handle networks mathematically and introduce the basic vocabulary and definitions. The notions of random- and complex networks are reviewed as well as the notions of small world networks, simple preferentially grown networks, community detection, and generalized multilayer networks.


2013 ◽  
Vol 2013 ◽  
pp. 1-3 ◽  
Author(s):  
Pantelimon-George Popescu ◽  
Florin Pop ◽  
Alexandru Herişanu ◽  
Nicolae Ţăpuş

We refine a classical logarithmic inequality using a discrete case of Bernoulli inequality, and then we refine furthermore two information inequalities between information measures for graphs, based on information functionals, presented by Dehmer and Mowshowitz in (2010) as Theorems 4.7 and 4.8. The inequalities refer to entropy-based measures of network information content and have a great impact for information processing in complex networks (a subarea of research in modeling of complex systems).


Biomedicines ◽  
2018 ◽  
Vol 6 (4) ◽  
pp. 111
Author(s):  
Shujuan Du ◽  
Xiaoqing Liu ◽  
Qiliang Cai

Cellular RNA decay machinery plays a vital role in regulating gene expression by altering the stability of mRNAs in response to external stresses, including viral infection. In the primary infection, viruses often conquer the host cell’s antiviral immune response by controlling the inherently cellular mRNA degradation machinery to facilitate viral gene expression and establish a successful infection. This review summarizes the current knowledge about the diverse strategies of viral-mediated regulatory RNA shutoff for pathogenesis, and particularly sheds a light on the mechanisms that viruses evolve to elude immune surveillance during infection.


2004 ◽  
Vol 211 (1) ◽  
pp. 121-134 ◽  
Author(s):  
Mandy Mende ◽  
Heide-Marie Buchhammer ◽  
Simona Schwarz ◽  
Gudrun Petzold ◽  
Werner Jaeger

Sign in / Sign up

Export Citation Format

Share Document