千年虫:一种分组网络和电路交换网络的路由算法

2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563) Pub Date : 2002-08-07 DOI:10.1109/ECUMN.2002.1002083

M. Rombaut, G. Hébuterne, M. Priem

{"title":"千年虫:一种分组网络和电路交换网络的路由算法","authors":"M. Rombaut, G. Hébuterne, M. Priem","doi":"10.1109/ECUMN.2002.1002083","DOIUrl":null,"url":null,"abstract":"We present an heuristic method to compute a centralized routing scheme, that permits decreasing the maximal link load and improving the network reliability, when the flow matrix changes and when a link failure occurs on the network. The complexity of this algorithm can be compared to the complexity of the usual disjoint routing methods. The tests seem to show that the improvement is good whatever is the number of nodes of the network; it remains to confirm this improvement by analyzing larger graphs (1000 or 2000 nodes).","PeriodicalId":398555,"journal":{"name":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The mille feuilles: a routing algorithm for packet networks and circuit switched networks\",\"authors\":\"M. Rombaut, G. Hébuterne, M. Priem\",\"doi\":\"10.1109/ECUMN.2002.1002083\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an heuristic method to compute a centralized routing scheme, that permits decreasing the maximal link load and improving the network reliability, when the flow matrix changes and when a link failure occurs on the network. The complexity of this algorithm can be compared to the complexity of the usual disjoint routing methods. The tests seem to show that the improvement is good whatever is the number of nodes of the network; it remains to confirm this improvement by analyzing larger graphs (1000 or 2000 nodes).\",\"PeriodicalId\":398555,\"journal\":{\"name\":\"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)\",\"volume\":\"74 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECUMN.2002.1002083\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECUMN.2002.1002083","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文提出了一种启发式计算集中路由方案的方法，当网络流矩阵发生变化或链路发生故障时，可以降低最大链路负载并提高网络可靠性。该算法的复杂度可与通常的不相交路由方法的复杂度相比较。测试似乎表明，无论网络节点的数量是多少，这种改进都是好的;还需要通过分析更大的图(1000或2000个节点)来确认这种改进。

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

查看原文本刊更多论文

The mille feuilles: a routing algorithm for packet networks and circuit switched networks

We present an heuristic method to compute a centralized routing scheme, that permits decreasing the maximal link load and improving the network reliability, when the flow matrix changes and when a link failure occurs on the network. The complexity of this algorithm can be compared to the complexity of the usual disjoint routing methods. The tests seem to show that the improvement is good whatever is the number of nodes of the network; it remains to confirm this improvement by analyzing larger graphs (1000 or 2000 nodes).

求助全文

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

来源期刊

2nd European Conference on Universal Multiservice Networks. ECUMN'2001 (Cat. No.02EX563)

自引率

0.00%

发文量