{"title":"具有多个服务质量参数的单播路由算法","authors":"Amarnath K. Koundinya, A. Negi, V. N. Sastry","doi":"10.1109/ISPAN.2004.1300531","DOIUrl":null,"url":null,"abstract":"Quality of service (QoS) is an important network service requirement to support various real time applications such as video on demand, remote-meeting systems, etc. While QoS parameters are specified by the applications it appears QoS support at routing level would be more appropriate. Here we consider an on-demand source routing modification to the Dijkstra's algorithm, which supports multi-parameter routing to find an optimal path according to the given optimality condition. The modified algorithm is analyzed with respect to its computational requirements and we prove that this algorithm finds a loop-free optimal path, if it exists.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Unicast routing algorithm with multiple quality-of-service parameters\",\"authors\":\"Amarnath K. Koundinya, A. Negi, V. N. Sastry\",\"doi\":\"10.1109/ISPAN.2004.1300531\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Quality of service (QoS) is an important network service requirement to support various real time applications such as video on demand, remote-meeting systems, etc. While QoS parameters are specified by the applications it appears QoS support at routing level would be more appropriate. Here we consider an on-demand source routing modification to the Dijkstra's algorithm, which supports multi-parameter routing to find an optimal path according to the given optimality condition. The modified algorithm is analyzed with respect to its computational requirements and we prove that this algorithm finds a loop-free optimal path, if it exists.\",\"PeriodicalId\":198404,\"journal\":{\"name\":\"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.2004.1300531\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.2004.1300531","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Unicast routing algorithm with multiple quality-of-service parameters
Quality of service (QoS) is an important network service requirement to support various real time applications such as video on demand, remote-meeting systems, etc. While QoS parameters are specified by the applications it appears QoS support at routing level would be more appropriate. Here we consider an on-demand source routing modification to the Dijkstra's algorithm, which supports multi-parameter routing to find an optimal path according to the given optimality condition. The modified algorithm is analyzed with respect to its computational requirements and we prove that this algorithm finds a loop-free optimal path, if it exists.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
