IP网络中无拥塞的链路权重迁移

2014 23rd International Conference on Computer Communication and Networks (ICCCN) Pub Date : 2014-09-29 DOI:10.1109/ICCCN.2014.6911729

Xiong Wang, Mengchao Ran

{"title":"IP网络中无拥塞的链路权重迁移","authors":"Xiong Wang, Mengchao Ran","doi":"10.1109/ICCCN.2014.6911729","DOIUrl":null,"url":null,"abstract":"When the traffic matrix of an IP network changes significantly, network operators will re-optimize the link weights to achieve optimal traffic distribution in the network. In such cases, network link weights need to be migrated from the old setting to the re-optimized setting based on a pre-determined sequence of migration operations. In this paper, we study the links weights migration problem in IP networks. Firstly, we defined a Generic Link Weights Migration (GLWM) problem, which tries to find an optimal sequence of migration operations that will not cause network congestion while minimizing the number of migration operations. And then we propose an approximation algorithm for the GLWM problem. Simulation results reveal that our proposed algorithm performs better than existing algorithms.","PeriodicalId":404048,"journal":{"name":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Link weights migration without congestion in IP networks\",\"authors\":\"Xiong Wang, Mengchao Ran\",\"doi\":\"10.1109/ICCCN.2014.6911729\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"When the traffic matrix of an IP network changes significantly, network operators will re-optimize the link weights to achieve optimal traffic distribution in the network. In such cases, network link weights need to be migrated from the old setting to the re-optimized setting based on a pre-determined sequence of migration operations. In this paper, we study the links weights migration problem in IP networks. Firstly, we defined a Generic Link Weights Migration (GLWM) problem, which tries to find an optimal sequence of migration operations that will not cause network congestion while minimizing the number of migration operations. And then we propose an approximation algorithm for the GLWM problem. Simulation results reveal that our proposed algorithm performs better than existing algorithms.\",\"PeriodicalId\":404048,\"journal\":{\"name\":\"2014 23rd International Conference on Computer Communication and Networks (ICCCN)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 23rd International Conference on Computer Communication and Networks (ICCCN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2014.6911729\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 23rd International Conference on Computer Communication and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2014.6911729","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

当IP网络的流量矩阵发生较大变化时，网络运营商会重新优化链路权重，以实现网络中最优的流量分配。在这种情况下，需要根据预先确定的迁移操作顺序，将网络链路权重从旧设置迁移到重新优化的设置。本文研究了IP网络中的链路权重迁移问题。首先，我们定义了一个通用链路权重迁移(GLWM)问题，它试图找到一个最优的迁移操作序列，在最小化迁移操作数量的同时不会导致网络拥塞。然后，我们提出了一个GLWM问题的近似算法。仿真结果表明，该算法的性能优于现有算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Link weights migration without congestion in IP networks

When the traffic matrix of an IP network changes significantly, network operators will re-optimize the link weights to achieve optimal traffic distribution in the network. In such cases, network link weights need to be migrated from the old setting to the re-optimized setting based on a pre-determined sequence of migration operations. In this paper, we study the links weights migration problem in IP networks. Firstly, we defined a Generic Link Weights Migration (GLWM) problem, which tries to find an optimal sequence of migration operations that will not cause network congestion while minimizing the number of migration operations. And then we propose an approximation algorithm for the GLWM problem. Simulation results reveal that our proposed algorithm performs better than existing algorithms.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2014 23rd International Conference on Computer Communication and Networks (ICCCN)

自引率

0.00%

发文量