预先计算路径的QoS路由算法

Proceedings of Sixth International Conference on Computer Communications and Networks Pub Date : 1997-09-22 DOI:10.1109/ICCCN.1997.623320

C. Pornavalai, G. Chakraborty, N. Shiratori

{"title":"预先计算路径的QoS路由算法","authors":"C. Pornavalai, G. Chakraborty, N. Shiratori","doi":"10.1109/ICCCN.1997.623320","DOIUrl":null,"url":null,"abstract":"Routing with multiple QoS constraints is known to be a NP-complete problem. In our previous work (QoSR/sub BF/ algorithm), we have shown that, for a number of specific QoS constraints, this problem can be solved in polynomial time, when a weighted fair queueing (WFQ) service discipline is employed. QoSR/sub BF/ is an on-demand algorithm. We propose a number of QoS routing algorithms for pre-computed paths, when all or some of the flow specification parameters and the amount of bandwidth that has to be reserved are not known a priori. We also show that the size of the routing table could be reduced, as paths satisfying some conditions could be neglected.","PeriodicalId":305733,"journal":{"name":"Proceedings of Sixth International Conference on Computer Communications and Networks","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"QoS routing algorithms for pre-computed paths\",\"authors\":\"C. Pornavalai, G. Chakraborty, N. Shiratori\",\"doi\":\"10.1109/ICCCN.1997.623320\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Routing with multiple QoS constraints is known to be a NP-complete problem. In our previous work (QoSR/sub BF/ algorithm), we have shown that, for a number of specific QoS constraints, this problem can be solved in polynomial time, when a weighted fair queueing (WFQ) service discipline is employed. QoSR/sub BF/ is an on-demand algorithm. We propose a number of QoS routing algorithms for pre-computed paths, when all or some of the flow specification parameters and the amount of bandwidth that has to be reserved are not known a priori. We also show that the size of the routing table could be reduced, as paths satisfying some conditions could be neglected.\",\"PeriodicalId\":305733,\"journal\":{\"name\":\"Proceedings of Sixth International Conference on Computer Communications and Networks\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of Sixth International Conference on Computer Communications and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.1997.623320\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of Sixth International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.1997.623320","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

摘要

具有多个QoS约束的路由是一个np完全问题。在我们之前的工作(QoSR/sub BF/算法)中，我们已经证明，对于许多特定的QoS约束，当采用加权公平排队(WFQ)服务规则时，这个问题可以在多项式时间内解决。QoSR/sub BF/是一种按需算法。当所有或部分流规范参数和必须保留的带宽数量先验未知时，我们为预先计算的路径提出了许多QoS路由算法。我们还证明了路由表的大小可以减小，因为满足某些条件的路径可以被忽略。

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

查看原文本刊更多论文

QoS routing algorithms for pre-computed paths

Routing with multiple QoS constraints is known to be a NP-complete problem. In our previous work (QoSR/sub BF/ algorithm), we have shown that, for a number of specific QoS constraints, this problem can be solved in polynomial time, when a weighted fair queueing (WFQ) service discipline is employed. QoSR/sub BF/ is an on-demand algorithm. We propose a number of QoS routing algorithms for pre-computed paths, when all or some of the flow specification parameters and the amount of bandwidth that has to be reserved are not known a priori. We also show that the size of the routing table could be reduced, as paths satisfying some conditions could be neglected.

求助全文

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

来源期刊

Proceedings of Sixth International Conference on Computer Communications and Networks

自引率

0.00%

发文量