有限范围探测:基于qos的路由的分布式方法

Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001 Pub Date : 2001-10-08 DOI:10.1109/NCA.2001.962553

K. S. Teng, Muthucumaru Maheswaran

{"title":"有限范围探测:基于qos的路由的分布式方法","authors":"K. S. Teng, Muthucumaru Maheswaran","doi":"10.1109/NCA.2001.962553","DOIUrl":null,"url":null,"abstract":"Two new QoS-based unicast routing algorithms for high-speed internetworks are proposed as part of this work. Both algorithms, Limited-Scope Probing (LSP) and Limited-Scope Hop-by-Hop Probing (LSHP) use the route update messages generated by the Open Shortest-Path-First (OSPF) algorithm to create hybrid routing tables. The LSP and LSHP are semi-distributed routing algorithms. They assume that the network \"state\" information maintained by the OSPF is accurate in \"close\" vicinity of the maintaining node. Therefore, the LSP and LSHP propose to use source-based routing techniques to route along paths that are \"centrally\" computed by the node. The extent of the vicinity can be set by an appropriate parameter. Extensive simulations are performed to compare our algorithms with existing QoS-based unicast routing algorithms.","PeriodicalId":385607,"journal":{"name":"Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001","volume":"61 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Limited scope probing: a distributed approach for QoS-based routing\",\"authors\":\"K. S. Teng, Muthucumaru Maheswaran\",\"doi\":\"10.1109/NCA.2001.962553\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Two new QoS-based unicast routing algorithms for high-speed internetworks are proposed as part of this work. Both algorithms, Limited-Scope Probing (LSP) and Limited-Scope Hop-by-Hop Probing (LSHP) use the route update messages generated by the Open Shortest-Path-First (OSPF) algorithm to create hybrid routing tables. The LSP and LSHP are semi-distributed routing algorithms. They assume that the network \\\"state\\\" information maintained by the OSPF is accurate in \\\"close\\\" vicinity of the maintaining node. Therefore, the LSP and LSHP propose to use source-based routing techniques to route along paths that are \\\"centrally\\\" computed by the node. The extent of the vicinity can be set by an appropriate parameter. Extensive simulations are performed to compare our algorithms with existing QoS-based unicast routing algorithms.\",\"PeriodicalId\":385607,\"journal\":{\"name\":\"Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001\",\"volume\":\"61 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NCA.2001.962553\",\"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 IEEE International Symposium on Network Computing and Applications. NCA 2001","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCA.2001.962553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

作为这项工作的一部分，提出了两种新的基于qos的高速互联网单播路由算法。LSP (Limited-Scope Probing)算法和LSHP (Limited-Scope Hop-by-Hop Probing)算法都使用OSPF (Open short - path - first)算法生成的路由更新消息来创建混合路由表。LSP和LSHP是半分布式路由算法。它们假定由OSPF维护的网络“状态”信息在维护节点附近是准确的。因此，LSP和LSHP建议使用基于源的路由技术，沿着节点“集中”计算的路径进行路由。附近的范围可以通过适当的参数来设置。进行了大量的仿真，将我们的算法与现有的基于qos的单播路由算法进行比较。

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

查看原文本刊更多论文

Limited scope probing: a distributed approach for QoS-based routing

Two new QoS-based unicast routing algorithms for high-speed internetworks are proposed as part of this work. Both algorithms, Limited-Scope Probing (LSP) and Limited-Scope Hop-by-Hop Probing (LSHP) use the route update messages generated by the Open Shortest-Path-First (OSPF) algorithm to create hybrid routing tables. The LSP and LSHP are semi-distributed routing algorithms. They assume that the network "state" information maintained by the OSPF is accurate in "close" vicinity of the maintaining node. Therefore, the LSP and LSHP propose to use source-based routing techniques to route along paths that are "centrally" computed by the node. The extent of the vicinity can be set by an appropriate parameter. Extensive simulations are performed to compare our algorithms with existing QoS-based unicast routing algorithms.

求助全文

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

来源期刊

Proceedings IEEE International Symposium on Network Computing and Applications. NCA 2001

自引率

0.00%

发文量