{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
