版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Faculty of Computer EngineeringUniversity of IsfahanIsfahan***Iran Department of Electrical and Computer EngineeringIsfahan University of TechnologyIsfahan***Iran
出 版 物:《Digital Communications and Networks》 (数字通信与网络(英文版))
年 卷 期:2023年第9卷第2期
页 面:534-544页
核心收录:
学科分类:080904[工学-电磁场与微波技术] 0810[工学-信息与通信工程] 0809[工学-电子科学与技术(可授工学、理学学位)] 08[工学] 080402[工学-测试计量技术及仪器] 0804[工学-仪器科学与技术] 081001[工学-通信与信息系统]
主 题:Blocking probability Complex traffic Link failure Network survivability Disaster recovery Information assurance
摘 要:The capability of a system to fulfill its mission promptly in the presence of attacks,failures,or accidents is one of the qualitative definitions of *** this paper,we propose a model for survivability quantification,which is acceptable for networks carrying complex traffic *** network traffic is considered as general multi-rate,heterogeneous traffic,where the individual bandwidth demands may aggregate in complex,nonlinear *** probability is the chosen measure for survivability *** study an arbitrary topology and some other known topologies for the *** and dependent failure scenarios as well as deterministic and random traffic models are ***,we provide survivability evaluation results for different network *** results show that by using about 50%of the link capacity in networks with a relatively high number of links,the blocking probability remains near zero in the case of a limited number of failures.