Epidemic spreading in growing network by copying

O. Bamaarouf, A. O. B. Alweimine, A. Rachadi, S. Lamzabi, H. Ez‐zahraouy
{"title":"Epidemic spreading in growing network by copying","authors":"O. Bamaarouf, A. O. B. Alweimine, A. Rachadi, S. Lamzabi, H. Ez‐zahraouy","doi":"10.1109/EITECH.2017.8255312","DOIUrl":null,"url":null,"abstract":"Despite the extensive number of applications that use growing network by copying in real world, the focus on network growth by copying has not receiving an adequate attention. In this work, we cast light on the time-discrete Markov chain of traffic minimal routing in growing network by copying. We found that, the switching from free-flow to congested phase is affected by the probability of copying. The epidemic propagation in this network is also studied. We see that when the copying probability increases, which governs the network growth, the infected packets proportion decreases.","PeriodicalId":447139,"journal":{"name":"2017 International Conference on Electrical and Information Technologies (ICEIT)","volume":"75 2","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 International Conference on Electrical and Information Technologies (ICEIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EITECH.2017.8255312","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Despite the extensive number of applications that use growing network by copying in real world, the focus on network growth by copying has not receiving an adequate attention. In this work, we cast light on the time-discrete Markov chain of traffic minimal routing in growing network by copying. We found that, the switching from free-flow to congested phase is affected by the probability of copying. The epidemic propagation in this network is also studied. We see that when the copying probability increases, which governs the network growth, the infected packets proportion decreases.
传染病通过复制在不断增长的网络中传播
尽管在现实世界中有大量的应用程序通过复制来使用网络增长,但是通过复制来关注网络增长并没有得到足够的重视。在这项工作中,我们揭示了时间离散马尔可夫链的流量最小路由的增长网络通过复制。我们发现,从自由流动阶段到拥挤阶段的切换受到复制概率的影响。并对该网络中的流行病传播进行了研究。我们可以看到,随着复制概率的增大,受感染报文的比例减小,而复制概率的增大控制着网络的增长。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信