攻击下数据传输的可行性:从孤立韧性变体的角度看问题

IF 0.5 4区 计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS
W. Gao, H. M. Başkonuş, C. Cattani
{"title":"攻击下数据传输的可行性:从孤立韧性变体的角度看问题","authors":"W. Gao, H. M. Başkonuş, C. Cattani","doi":"10.1134/s0032946023020060","DOIUrl":null,"url":null,"abstract":"<p>The graph model is an appreciable tool for data transmission network, where the feasibility of data transmission in site attack circumstances can be described by fractional critical graphs, and the vulnerability of networks can be measured by isolation toughness variant. This paper considers both the stability of the network and the feasibility of data transmission when the sites are destroyed, and determines the isolated toughness variant bound for fractional <span>\\((a,b,n)\\)</span>-critical graphs, where the parameter <span>\\(n\\)</span> represents the number of damaged sites at a certain moment. A counterexample proves the sharpness of the given isolated toughness variant bound. The main theoretical conclusion provides an equilibrium between performance and cost in network topology designing.</p>","PeriodicalId":54581,"journal":{"name":"Problems of Information Transmission","volume":"5 1","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2023-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Feasibility of Data Transmission under Attack: From Isolated Toughness Variant Perspective\",\"authors\":\"W. Gao, H. M. Başkonuş, C. Cattani\",\"doi\":\"10.1134/s0032946023020060\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The graph model is an appreciable tool for data transmission network, where the feasibility of data transmission in site attack circumstances can be described by fractional critical graphs, and the vulnerability of networks can be measured by isolation toughness variant. This paper considers both the stability of the network and the feasibility of data transmission when the sites are destroyed, and determines the isolated toughness variant bound for fractional <span>\\\\((a,b,n)\\\\)</span>-critical graphs, where the parameter <span>\\\\(n\\\\)</span> represents the number of damaged sites at a certain moment. A counterexample proves the sharpness of the given isolated toughness variant bound. The main theoretical conclusion provides an equilibrium between performance and cost in network topology designing.</p>\",\"PeriodicalId\":54581,\"journal\":{\"name\":\"Problems of Information Transmission\",\"volume\":\"5 1\",\"pages\":\"\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-12-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Problems of Information Transmission\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1134/s0032946023020060\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Problems of Information Transmission","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1134/s0032946023020060","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0

摘要

图模型是数据传输网络的重要工具,在站点被攻击的情况下,数据传输的可行性可以用分数临界图来描述,网络的脆弱性可以用隔离韧性变量来衡量。本文同时考虑了网络的稳定性和站点被破坏时数据传输的可行性,并确定了分数临界图的\((a,b,n)\)隔离韧性变体约束,其中参数\(n\)表示某一时刻被破坏站点的数量。一个反例证明了所给孤立韧性变体约束的尖锐性。主要理论结论提供了网络拓扑设计中性能与成本之间的平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Feasibility of Data Transmission under Attack: From Isolated Toughness Variant Perspective

The graph model is an appreciable tool for data transmission network, where the feasibility of data transmission in site attack circumstances can be described by fractional critical graphs, and the vulnerability of networks can be measured by isolation toughness variant. This paper considers both the stability of the network and the feasibility of data transmission when the sites are destroyed, and determines the isolated toughness variant bound for fractional \((a,b,n)\)-critical graphs, where the parameter \(n\) represents the number of damaged sites at a certain moment. A counterexample proves the sharpness of the given isolated toughness variant bound. The main theoretical conclusion provides an equilibrium between performance and cost in network topology designing.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Problems of Information Transmission
Problems of Information Transmission 工程技术-计算机:理论方法
CiteScore
2.00
自引率
25.00%
发文量
10
审稿时长
>12 weeks
期刊介绍: Problems of Information Transmission is of interest to researcher in all fields concerned with the research and development of communication systems. This quarterly journal features coverage of statistical information theory; coding theory and techniques; noisy channels; error detection and correction; signal detection, extraction, and analysis; analysis of communication networks; optimal processing and routing; the theory of random processes; and bionics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信