基于综合生成流量矩阵的征服者流量优化网络路由以最小化拥塞

S. Zargar, M. Moghaddam
{"title":"基于综合生成流量矩阵的征服者流量优化网络路由以最小化拥塞","authors":"S. Zargar, M. Moghaddam","doi":"10.1109/CCNC08.2007.133","DOIUrl":null,"url":null,"abstract":"Many traffic engineering and network design tasks require a network-wide description as an input for their performance evaluation. Therefore, a traffic matrix represents the demands for these tasks and is applicable to them. Traffic matrix can be measured directly or estimated from an indirect data. Generating synthetic traffic matrix method, is a better way to achieve traffic matrix indirectly. We have previously proposed the conqueror traffic based synthetic traffic matrix and we have indicated that our conqueror traffic based matrix performed better in all cases where conqueror traffic existed. In this paper by measuring the maximum link-utilization, we consider how well the conqueror traffic based synthetic matrix optimizes the specific traffic engineering task; that is optimizing network routing to minimize congestion. First, we optimize the routing with the conqueror traffic based synthetic matrix to minimize congestion. Then, we test the performance of the resulting routing on the real traffic matrix. Simulation results indicate that OSPF optimization which we use in this paper to optimize the weights based on the conqueror traffic based synthetic matrix, optimize the routing better and result in a better performance on real traffic matrix.","PeriodicalId":183858,"journal":{"name":"2008 5th IEEE Consumer Communications and Networking Conference","volume":"123 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimizing Network Routing to Minimize Congestion, Using the Conqueror Traffic Based Synthetically Generated Traffic Matrices\",\"authors\":\"S. Zargar, M. Moghaddam\",\"doi\":\"10.1109/CCNC08.2007.133\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Many traffic engineering and network design tasks require a network-wide description as an input for their performance evaluation. Therefore, a traffic matrix represents the demands for these tasks and is applicable to them. Traffic matrix can be measured directly or estimated from an indirect data. Generating synthetic traffic matrix method, is a better way to achieve traffic matrix indirectly. We have previously proposed the conqueror traffic based synthetic traffic matrix and we have indicated that our conqueror traffic based matrix performed better in all cases where conqueror traffic existed. In this paper by measuring the maximum link-utilization, we consider how well the conqueror traffic based synthetic matrix optimizes the specific traffic engineering task; that is optimizing network routing to minimize congestion. First, we optimize the routing with the conqueror traffic based synthetic matrix to minimize congestion. Then, we test the performance of the resulting routing on the real traffic matrix. Simulation results indicate that OSPF optimization which we use in this paper to optimize the weights based on the conqueror traffic based synthetic matrix, optimize the routing better and result in a better performance on real traffic matrix.\",\"PeriodicalId\":183858,\"journal\":{\"name\":\"2008 5th IEEE Consumer Communications and Networking Conference\",\"volume\":\"123 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 5th IEEE Consumer Communications and Networking Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCNC08.2007.133\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 5th IEEE Consumer Communications and Networking Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCNC08.2007.133","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

许多流量工程和网络设计任务需要一个全网描述作为其性能评估的输入。因此,流量矩阵代表了这些任务的需求,并适用于这些任务。流量矩阵可以直接测量,也可以通过间接数据估算。生成综合交通矩阵的方法,是间接实现交通矩阵的较好方法。我们之前已经提出了基于征服者流量的综合流量矩阵,并且我们已经表明我们的基于征服者流量的矩阵在存在征服者流量的所有情况下都表现得更好。本文通过度量最大链路利用率来考虑基于征服者流量的综合矩阵对具体交通工程任务的优化程度;这就是优化网络路由以最小化拥塞。首先,利用基于征服者流量的综合矩阵对路由进行优化,使拥塞最小化。然后,我们在真实流量矩阵上测试所得路由的性能。仿真结果表明,本文采用的OSPF优化方法在基于征服者流量的综合矩阵上优化权值,可以更好地优化路由,在实际流量矩阵上具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimizing Network Routing to Minimize Congestion, Using the Conqueror Traffic Based Synthetically Generated Traffic Matrices
Many traffic engineering and network design tasks require a network-wide description as an input for their performance evaluation. Therefore, a traffic matrix represents the demands for these tasks and is applicable to them. Traffic matrix can be measured directly or estimated from an indirect data. Generating synthetic traffic matrix method, is a better way to achieve traffic matrix indirectly. We have previously proposed the conqueror traffic based synthetic traffic matrix and we have indicated that our conqueror traffic based matrix performed better in all cases where conqueror traffic existed. In this paper by measuring the maximum link-utilization, we consider how well the conqueror traffic based synthetic matrix optimizes the specific traffic engineering task; that is optimizing network routing to minimize congestion. First, we optimize the routing with the conqueror traffic based synthetic matrix to minimize congestion. Then, we test the performance of the resulting routing on the real traffic matrix. Simulation results indicate that OSPF optimization which we use in this paper to optimize the weights based on the conqueror traffic based synthetic matrix, optimize the routing better and result in a better performance on real traffic matrix.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Improvement of Iterative Decoding Algorithm in the Adaptive Modulation and Coding System Designing and Creating Environment Aware Games Cross-Layer Design for Cooperative Caching in Mobile Ad Hoc Networks Ant System Based Flexible and Cost Effective Routing for Wireless Face Recognition Seamless Mobile Context - Towards High Speed Context-Aware Event-Based Middleware
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1