串联失败经常发生在象因特网那样的拥挤的网络。串联失败能被描述为一个三阶段的过程:拥挤的产生,散开,和驱散。在这个说明,我们在场在一个给定的节点上代表拥挤的程度的功能。这条途径与存在功能不同基于在海角中心性之间。由介绍‘ d elay time' 的概念,我们指明一内部在永久移动之间并且非的阶段移动。我们也构造网络效率的一个评估函数,基于拥挤,它测量串联失败引起的损坏。最后,我们调查网络的效果结构和尺寸,延期时间,处理能力和包拥挤上的产生速度繁殖。另外,我们揭开在串联动力学和象结构和尺寸那样的网络的一些性质之间的关系。
Cascading failures often occur in congested networks such as the Internet. A cascading failure can be described as a three-phase process: generation, diffusion, and dissipation of the congestion. In this account, we present a function that represents the extent of congestion on a given node. This approach is different from existing fimctions based on betweenness centrality. By introducing the concept of 'delay time', we designate an intergradation between permanent removal and nonremoval. We also construct an evaluation fimction of network efficiency, based on congestion, which measures the damage caused by cascading failures. Finally, we investigate the effects of network structure and size, delay time, processing ability and packet generation speed on congestion propagation. Also, we uncover the relationship between the cascade dynamics and some properties of the network such as structure and size.