无拥塞路由重构:公式和示例

2014 48th Annual Conference on Information Sciences and Systems (CISS) Pub Date : 2014-03-19 DOI:10.1109/CISS.2014.6814142

Chiunlin Lim, N. Wu, A. Tang

{"title":"无拥塞路由重构:公式和示例","authors":"Chiunlin Lim, N. Wu, A. Tang","doi":"10.1109/CISS.2014.6814142","DOIUrl":null,"url":null,"abstract":"We consider the network-layer problem of avoiding congestion while reconfiguring the routing paths. We formulate a flow-based and a switch-based model. For the flow-based model, we demonstrate that an optimal sequence of minimum update steps could always be found when the dependency graph is acyclic. For the switch-based model, we find a way to translate a feasible flow-based sequence to a feasible switch-based sequence subject to a tree topology constraint on the routing paths.","PeriodicalId":169460,"journal":{"name":"2014 48th Annual Conference on Information Sciences and Systems (CISS)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Congestion-free routing reconfiguration: Formulation and examples\",\"authors\":\"Chiunlin Lim, N. Wu, A. Tang\",\"doi\":\"10.1109/CISS.2014.6814142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the network-layer problem of avoiding congestion while reconfiguring the routing paths. We formulate a flow-based and a switch-based model. For the flow-based model, we demonstrate that an optimal sequence of minimum update steps could always be found when the dependency graph is acyclic. For the switch-based model, we find a way to translate a feasible flow-based sequence to a feasible switch-based sequence subject to a tree topology constraint on the routing paths.\",\"PeriodicalId\":169460,\"journal\":{\"name\":\"2014 48th Annual Conference on Information Sciences and Systems (CISS)\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-03-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 48th Annual Conference on Information Sciences and Systems (CISS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CISS.2014.6814142\",\"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 48th Annual Conference on Information Sciences and Systems (CISS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISS.2014.6814142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

在重新配置路由路径时，我们考虑了避免拥塞的网络层问题。我们制定了一个基于流程和一个基于开关的模型。对于基于流的模型，我们证明了当依赖图为非循环时，总能找到最小更新步骤的最优序列。对于基于交换机的模型，我们找到了一种方法，在路由路径的树拓扑约束下，将可行的基于流的序列转换为可行的基于交换机的序列。

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

查看原文本刊更多论文

Congestion-free routing reconfiguration: Formulation and examples

We consider the network-layer problem of avoiding congestion while reconfiguring the routing paths. We formulate a flow-based and a switch-based model. For the flow-based model, we demonstrate that an optimal sequence of minimum update steps could always be found when the dependency graph is acyclic. For the switch-based model, we find a way to translate a feasible flow-based sequence to a feasible switch-based sequence subject to a tree topology constraint on the routing paths.

求助全文

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

来源期刊

2014 48th Annual Conference on Information Sciences and Systems (CISS)

自引率

0.00%

发文量