基于流量分形特性的MPLS网络路由值计算

T. Radivilova, Lyudmyla Kirichenko, Oleksandra Yeremenko
{"title":"基于流量分形特性的MPLS网络路由值计算","authors":"T. Radivilova, Lyudmyla Kirichenko, Oleksandra Yeremenko","doi":"10.1109/AIACT.2017.8020112","DOIUrl":null,"url":null,"abstract":"Method for calculating routing cost of MPLS network is presented in the work. This method allows to minimize routing cost, taking into account traffic fractal properties, choice of traffic transmission path and quality of service requirements. The method uses values of the Hurst parameter and value of normalized spread of traffic values, which makes it possible to apply it to self-similar and multifractal data streams.","PeriodicalId":367743,"journal":{"name":"2017 2nd International Conference on Advanced Information and Communication Technologies (AICT)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Calculation of routing value in MPLS network according to traffic fractal properties\",\"authors\":\"T. Radivilova, Lyudmyla Kirichenko, Oleksandra Yeremenko\",\"doi\":\"10.1109/AIACT.2017.8020112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Method for calculating routing cost of MPLS network is presented in the work. This method allows to minimize routing cost, taking into account traffic fractal properties, choice of traffic transmission path and quality of service requirements. The method uses values of the Hurst parameter and value of normalized spread of traffic values, which makes it possible to apply it to self-similar and multifractal data streams.\",\"PeriodicalId\":367743,\"journal\":{\"name\":\"2017 2nd International Conference on Advanced Information and Communication Technologies (AICT)\",\"volume\":\"114 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 2nd International Conference on Advanced Information and Communication Technologies (AICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AIACT.2017.8020112\",\"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 2nd International Conference on Advanced Information and Communication Technologies (AICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AIACT.2017.8020112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

提出了一种计算MPLS网络路由开销的方法。该方法考虑了交通的分形特性、交通传输路径的选择和服务质量的要求,使路由成本最小化。该方法利用Hurst参数值和流量值的归一化扩展值,使其可以应用于自相似和多重分形数据流。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Calculation of routing value in MPLS network according to traffic fractal properties
Method for calculating routing cost of MPLS network is presented in the work. This method allows to minimize routing cost, taking into account traffic fractal properties, choice of traffic transmission path and quality of service requirements. The method uses values of the Hurst parameter and value of normalized spread of traffic values, which makes it possible to apply it to self-similar and multifractal data streams.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信