一种基于流量增长与分布模型的网络拓扑演化生成器

Xiangqian Chen, K. Makki, K. Yen, N. Pissinou
{"title":"一种基于流量增长与分布模型的网络拓扑演化生成器","authors":"Xiangqian Chen, K. Makki, K. Yen, N. Pissinou","doi":"10.1109/ICN.2007.5","DOIUrl":null,"url":null,"abstract":"Following traffic increase near to network backbone capacity in a domain network, the evolution of backbone topology takes place. In this paper, three main types of evolution methods: link upgrading only method (upgrade link capacity only), node upgrading method (add nodes and links with the same link capacity), and the combinations of previous two are explored. To shunt the saturated traffic efficiently, we propose several node upgrading generators - Adapting Traffic Evolution Topology gEnerators (ATETEs). ATETEs consider traffic distribution and node burden conditions and select the congested link as the main shunting object. The difference among ATETEs lies that they have diverse strategies to choose a node in the congested link as the second shunting aim. Simulation shows that: the type of ATETEs which picks the burdened node in the saturated link as another shunting object has the most effective shunting result. Compare with most of current topology generators such as [BRITE] in [1] which consider little about traffic increase distribution, ATETEs are more efficient to satisfy traffic increase.","PeriodicalId":117154,"journal":{"name":"Sixth International Conference on Networking (ICN'07)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A New Network Topology Evolution Generator Based on Traffic Increase and Distribution Model\",\"authors\":\"Xiangqian Chen, K. Makki, K. Yen, N. Pissinou\",\"doi\":\"10.1109/ICN.2007.5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Following traffic increase near to network backbone capacity in a domain network, the evolution of backbone topology takes place. In this paper, three main types of evolution methods: link upgrading only method (upgrade link capacity only), node upgrading method (add nodes and links with the same link capacity), and the combinations of previous two are explored. To shunt the saturated traffic efficiently, we propose several node upgrading generators - Adapting Traffic Evolution Topology gEnerators (ATETEs). ATETEs consider traffic distribution and node burden conditions and select the congested link as the main shunting object. The difference among ATETEs lies that they have diverse strategies to choose a node in the congested link as the second shunting aim. Simulation shows that: the type of ATETEs which picks the burdened node in the saturated link as another shunting object has the most effective shunting result. Compare with most of current topology generators such as [BRITE] in [1] which consider little about traffic increase distribution, ATETEs are more efficient to satisfy traffic increase.\",\"PeriodicalId\":117154,\"journal\":{\"name\":\"Sixth International Conference on Networking (ICN'07)\",\"volume\":\"106 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Sixth International Conference on Networking (ICN'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICN.2007.5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Sixth International Conference on Networking (ICN'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICN.2007.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

在域网络中,随着业务量的增长接近骨干网容量,骨干网拓扑结构也发生了演变。本文主要探讨了仅链路升级法(仅升级链路容量)、节点升级法(增加链路容量相同的节点和链路)以及前两种进化方法的结合。为了有效分流饱和流量,我们提出了几种节点升级生成器——自适应流量演化拓扑生成器(atete)。atete考虑流量分布和节点负荷情况,选择拥塞链路作为主要分流对象。atete之间的不同之处在于,它们有不同的策略来选择拥塞链路中的节点作为第二个分流目标。仿真结果表明:在饱和链路中选择负荷节点作为另一个分流对象的atete类型具有最有效的分流效果。与目前大多数拓扑生成器(如[1]中的[BRITE])很少考虑流量增长分布相比,atete能够更有效地满足流量增长。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A New Network Topology Evolution Generator Based on Traffic Increase and Distribution Model
Following traffic increase near to network backbone capacity in a domain network, the evolution of backbone topology takes place. In this paper, three main types of evolution methods: link upgrading only method (upgrade link capacity only), node upgrading method (add nodes and links with the same link capacity), and the combinations of previous two are explored. To shunt the saturated traffic efficiently, we propose several node upgrading generators - Adapting Traffic Evolution Topology gEnerators (ATETEs). ATETEs consider traffic distribution and node burden conditions and select the congested link as the main shunting object. The difference among ATETEs lies that they have diverse strategies to choose a node in the congested link as the second shunting aim. Simulation shows that: the type of ATETEs which picks the burdened node in the saturated link as another shunting object has the most effective shunting result. Compare with most of current topology generators such as [BRITE] in [1] which consider little about traffic increase distribution, ATETEs are more efficient to satisfy traffic increase.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信