Catastrophic event phenomena in communication networks: a survey

DOI10.1016/j.cosrev.2015.10.001zbMath1344.68021OpenAlexW2192361279MaRDI QIDQ900709

Christopher Dabrowski

Publication date: 22 December 2015

Published in: Computer Science Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cosrev.2015.10.001

zbMATH Keywords

percolationphase transitiongraph theorycommunication networkinternet

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Reliability, testing and fault tolerance of networks and computer systems (68M15) Internet topics (68M11)

Related Items (6)

Phase transition in lattice networks with heavy-tailed user behaviors ⋮ Analysis of a population model with batch Markovian arrivals influenced by Markov arrival geometric catastrophes ⋮ Analysis of batch Bernoulli process subject to discrete-time renewal generated binomial catastrophes ⋮ Markovian arrival process subject to renewal generated binomial catastrophes ⋮ Batch renewal arrival process subject to geometric catastrophes ⋮ A generating function approach to Markov chains undergoing binomial catastrophes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bootstrap percolation on the random graph \(G_{n,p}\)
• On the critical behavior of the general epidemic process and dynamical percolation
• More is the same; phase transitions and mean field theories
• The contact process in a random environment
• The survival of one-dimensional contact processes in random environments
• The contact process on trees
• Contact interactions on a lattice
• The Ehrenfest classification of phase transitions: Introduction and evolution
• Extinction risk and the \(1/f\) family of noise models
• Information transfer and phase transitions in a model of internet traffic
• A comparsion of estimators for \(1/f\) noise
• Complex networks: structure and dynamics
• Equilibrium analysis through separation of user and network behavior
• The critical point of \(k\)-clique percolation in the Erdős-Rényi graph
• Diffusion and Reactions in Fractals and Disordered Systems
• How to distribute antidote to control epidemics
• Emergence of Scaling in Random Networks
• Self-organized criticality
• Percolation
• TRANSPORT ON COMPLEX NETWORKS: FLOW, JAMMING AND OPTIMIZATION
• The Evolution of Random Graphs
• Asymptotic final-size distribution for some chain-binomial processes
• The Diameter of a Cycle Plus a Random Matching
• Is Network Traffic Self-Similar or Multifractal?
• Wavelet analysis of long-range-dependent traffic
• Estimation of 1/f noise
• The Structure and Function of Complex Networks
• A simple model of global cascades on random networks
• Graph annotations in modeling complex network topologies
• A critical point for random graphs with a given degree sequence
• A general model of web graphs
• The phase transition in inhomogeneous random graphs
• Collective dynamics of ‘small-world’ networks
• An epidemic model with exposure-dependent severities
• Topological modelling of large networks
• Critical points and transitions in an electric power transmission model for cascading failure blackouts
• Percolation of arbitrary uncorrelated nested subgraphs

This page was built for publication: Catastrophic event phenomena in communication networks: a survey