首选链路用于时延约束下的最小开销路由

International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003 Pub Date : 2003-12-01 DOI:10.1109/ICNNSP.2003.1281182

Liuqing Chen, Hua-An Zhao

{"title":"首选链路用于时延约束下的最小开销路由","authors":"Liuqing Chen, Hua-An Zhao","doi":"10.1109/ICNNSP.2003.1281182","DOIUrl":null,"url":null,"abstract":"This paper presents two new preferred link functions: LBC(low bound on cost) and LBC/sub RDM/ (low bound on cost-residual delay maximum). Based on LBC and LBC/sub RDM/, we propose two algorithms DCLC LBC and DCLC LBCRDM for delay constrained least cost routing. The computation results of random networks show that the performances of DCLC LBC and DCLC LBCRDM are comparable, and they are obviously better than the algorithm DCLC-RDM.","PeriodicalId":336216,"journal":{"name":"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A preferred link functions for delay-constrained least-cost routing\",\"authors\":\"Liuqing Chen, Hua-An Zhao\",\"doi\":\"10.1109/ICNNSP.2003.1281182\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents two new preferred link functions: LBC(low bound on cost) and LBC/sub RDM/ (low bound on cost-residual delay maximum). Based on LBC and LBC/sub RDM/, we propose two algorithms DCLC LBC and DCLC LBCRDM for delay constrained least cost routing. The computation results of random networks show that the performances of DCLC LBC and DCLC LBCRDM are comparable, and they are obviously better than the algorithm DCLC-RDM.\",\"PeriodicalId\":336216,\"journal\":{\"name\":\"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICNNSP.2003.1281182\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICNNSP.2003.1281182","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文提出了两个新的首选链路函数:LBC(成本下界)和LBC/sub RDM/(成本剩余延迟最大值下界)。在LBC算法和LBC/sub RDM算法的基础上，提出了DCLC LBC算法和DCLC LBCRDM算法。随机网络的计算结果表明，DCLC LBC算法和DCLC LBCRDM算法的性能具有可比性，且明显优于DCLC- rdm算法。

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

查看原文本刊更多论文

A preferred link functions for delay-constrained least-cost routing

This paper presents two new preferred link functions: LBC(low bound on cost) and LBC/sub RDM/ (low bound on cost-residual delay maximum). Based on LBC and LBC/sub RDM/, we propose two algorithms DCLC LBC and DCLC LBCRDM for delay constrained least cost routing. The computation results of random networks show that the performances of DCLC LBC and DCLC LBCRDM are comparable, and they are obviously better than the algorithm DCLC-RDM.

求助全文

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

来源期刊

International Conference on Neural Networks and Signal Processing, 2003. Proceedings of the 2003

自引率

0.00%

发文量