O. Bamaarouf, A. O. B. Alweimine, A. Rachadi, S. Lamzabi, H. Ez‐zahraouy
{"title":"传染病通过复制在不断增长的网络中传播","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":"{\"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}","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}
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.