{"title":"分形网络远程通信仿真","authors":"Mitko Gospodinov","doi":"10.1145/2516775.2516813","DOIUrl":null,"url":null,"abstract":"In this paper an algorithm based on fractional Brownian motion is used to simulate network traffic. The simulated traffic is compared with real network traffic and the results from the comparison show that they are similar to each other, as the difference between the relative errors of the Hurst parameter of the simulated traffic and the real traffic is less than 2%. Therefore this algorithm could be used for practical simulation research.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Simulation of fractal network teletraffic\",\"authors\":\"Mitko Gospodinov\",\"doi\":\"10.1145/2516775.2516813\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper an algorithm based on fractional Brownian motion is used to simulate network traffic. The simulated traffic is compared with real network traffic and the results from the comparison show that they are similar to each other, as the difference between the relative errors of the Hurst parameter of the simulated traffic and the real traffic is less than 2%. Therefore this algorithm could be used for practical simulation research.\",\"PeriodicalId\":316788,\"journal\":{\"name\":\"International Conference on Computer Systems and Technologies\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Computer Systems and Technologies\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2516775.2516813\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computer Systems and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2516775.2516813","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper an algorithm based on fractional Brownian motion is used to simulate network traffic. The simulated traffic is compared with real network traffic and the results from the comparison show that they are similar to each other, as the difference between the relative errors of the Hurst parameter of the simulated traffic and the real traffic is less than 2%. Therefore this algorithm could be used for practical simulation research.