具有多个服务质量参数的单播路由算法

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI:10.1109/ISPAN.2004.1300531

Amarnath K. Koundinya, A. Negi, V. N. Sastry

{"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}

引用次数: 4

摘要

服务质量(QoS)是支持视频点播、远程会议系统等各种实时应用的重要网络服务要求。虽然QoS参数由应用程序指定，但在路由级别支持QoS似乎更合适。本文考虑了对Dijkstra算法的按需源路由改进，该算法支持多参数路由，根据给定的最优性条件找到最优路径。对改进算法的计算需求进行了分析，证明了该算法能找到一个无环最优路径，如果该路径存在的话。

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

查看原文本刊更多论文

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.

求助全文

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

来源期刊

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.

自引率

0.00%

发文量