ATM网络中自相似流量的产生与测试

A. Prasad, B. Stavrov, F. Schoute
{"title":"ATM网络中自相似流量的产生与测试","authors":"A. Prasad, B. Stavrov, F. Schoute","doi":"10.1109/ICPWC.1996.494269","DOIUrl":null,"url":null,"abstract":"A number of findings from detailed studies of traffic measurements from different packet networks have brought up a surprising discrepancy between the traditional traffic modelling techniques and the actual network traffic. The studies have shown the actual network traffic to be statistically self-similar with significant implications for the design of future multi-service integrated networks. This new traffic feature can be effectively captured within fractal models like: fractional Brownian motion (fBm) and fractional ARIMA processes. Although these formal mathematical models provide an elegant solution to the modelling of the self-similar phenomena, an comprehensive queuing analysis of these models is still lacking. Therefore simulations with synthetic self-similar input traffic are essential for gaining better understanding of the queuing problems and some initial experience with the performance of the future networks. Consequently fast generation of long traces of self-similar processes becomes an important task. We use an fBm generation method called the successive random addition (SRA) algorithm and carry out a rigorous statistical analysis on the generated traces. Our results show that the traces are indeed self-similar, although the parameters obtained may slightly differ from their target values. Our conclusion is that for qualitative studies the SRA algorithm provides a very good traffic source, whereas for quantitative analysis some caution is recommended. We also mention some possible applications of the algorithm in performance-related network implementations.","PeriodicalId":117877,"journal":{"name":"1996 IEEE International Conference on Personal Wireless Communications Proceedings and Exhibition. Future Access","volume":"404 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"Generation and testing of self-similar traffic in ATM networks\",\"authors\":\"A. Prasad, B. Stavrov, F. Schoute\",\"doi\":\"10.1109/ICPWC.1996.494269\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A number of findings from detailed studies of traffic measurements from different packet networks have brought up a surprising discrepancy between the traditional traffic modelling techniques and the actual network traffic. The studies have shown the actual network traffic to be statistically self-similar with significant implications for the design of future multi-service integrated networks. This new traffic feature can be effectively captured within fractal models like: fractional Brownian motion (fBm) and fractional ARIMA processes. Although these formal mathematical models provide an elegant solution to the modelling of the self-similar phenomena, an comprehensive queuing analysis of these models is still lacking. Therefore simulations with synthetic self-similar input traffic are essential for gaining better understanding of the queuing problems and some initial experience with the performance of the future networks. Consequently fast generation of long traces of self-similar processes becomes an important task. We use an fBm generation method called the successive random addition (SRA) algorithm and carry out a rigorous statistical analysis on the generated traces. Our results show that the traces are indeed self-similar, although the parameters obtained may slightly differ from their target values. Our conclusion is that for qualitative studies the SRA algorithm provides a very good traffic source, whereas for quantitative analysis some caution is recommended. We also mention some possible applications of the algorithm in performance-related network implementations.\",\"PeriodicalId\":117877,\"journal\":{\"name\":\"1996 IEEE International Conference on Personal Wireless Communications Proceedings and Exhibition. Future Access\",\"volume\":\"404 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-02-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1996 IEEE International Conference on Personal Wireless Communications Proceedings and Exhibition. Future Access\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICPWC.1996.494269\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1996 IEEE International Conference on Personal Wireless Communications Proceedings and Exhibition. Future Access","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPWC.1996.494269","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

对不同分组网络的流量测量进行了详细研究,发现传统的流量建模技术与实际网络流量之间存在惊人的差异。研究表明,实际网络流量在统计上是自相似的,这对未来多业务集成网络的设计具有重要意义。这种新的交通特征可以在分形模型中有效地捕获,例如:分数布朗运动(fBm)和分数ARIMA过程。尽管这些形式化的数学模型为自相似现象的建模提供了一个优雅的解决方案,但对这些模型的全面排队分析仍然缺乏。因此,具有合成自相似输入流量的模拟对于更好地理解排队问题和对未来网络性能的一些初步经验是必不可少的。因此,快速生成自相似过程的长轨迹成为一项重要任务。我们使用一种称为连续随机加法(SRA)算法的fBm生成方法,并对生成的迹线进行严格的统计分析。我们的结果表明,虽然得到的参数可能与目标值略有不同,但轨迹确实是自相似的。我们的结论是,对于定性研究,SRA算法提供了一个非常好的流量源,而对于定量分析,建议谨慎一些。我们还提到了该算法在与性能相关的网络实现中的一些可能应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Generation and testing of self-similar traffic in ATM networks
A number of findings from detailed studies of traffic measurements from different packet networks have brought up a surprising discrepancy between the traditional traffic modelling techniques and the actual network traffic. The studies have shown the actual network traffic to be statistically self-similar with significant implications for the design of future multi-service integrated networks. This new traffic feature can be effectively captured within fractal models like: fractional Brownian motion (fBm) and fractional ARIMA processes. Although these formal mathematical models provide an elegant solution to the modelling of the self-similar phenomena, an comprehensive queuing analysis of these models is still lacking. Therefore simulations with synthetic self-similar input traffic are essential for gaining better understanding of the queuing problems and some initial experience with the performance of the future networks. Consequently fast generation of long traces of self-similar processes becomes an important task. We use an fBm generation method called the successive random addition (SRA) algorithm and carry out a rigorous statistical analysis on the generated traces. Our results show that the traces are indeed self-similar, although the parameters obtained may slightly differ from their target values. Our conclusion is that for qualitative studies the SRA algorithm provides a very good traffic source, whereas for quantitative analysis some caution is recommended. We also mention some possible applications of the algorithm in performance-related network implementations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信