一种基于遗传算法的多媒体应用QoS路由新方法

L. Barolli, A. Koyama, H. Sawada, T. Suganuma, N. Shiratori
{"title":"一种基于遗传算法的多媒体应用QoS路由新方法","authors":"L. Barolli, A. Koyama, H. Sawada, T. Suganuma, N. Shiratori","doi":"10.1109/CW.2002.1180892","DOIUrl":null,"url":null,"abstract":"In order to support multimedia communication over high speed networks, it is necessary to develop routing algorithms which use for routing more than one QoS parameter. This is because new services such as video on demand and remote meeting systems require better QoS. However, the problem of QoS routing is difficult and to find a feasible route with two independent path constraints is NP-complete. Therefore, QoS routing algorithms for high speed networks must be adaptive, flexible, and intelligent for efficient network management. In a previous work, we proposed a genetic algorithm (GA) based routing method. This method used only the delay time as a routing parameter. In this paper we improve the previous work in three aspects. The new QoS routing method uses two QoS parameters for routing. We implemented a new tree generating algorithm which generates and reduces the tree automatically. Furthermore, we carried out the simulations for different kinds of networks. The simulation results show that the proposed method has a better performance than a conventional GA based routing algorithm.","PeriodicalId":376322,"journal":{"name":"First International Symposium on Cyber Worlds, 2002. Proceedings.","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"A new QoS routing approach for multimedia applications based on genetic algorithms\",\"authors\":\"L. Barolli, A. Koyama, H. Sawada, T. Suganuma, N. Shiratori\",\"doi\":\"10.1109/CW.2002.1180892\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to support multimedia communication over high speed networks, it is necessary to develop routing algorithms which use for routing more than one QoS parameter. This is because new services such as video on demand and remote meeting systems require better QoS. However, the problem of QoS routing is difficult and to find a feasible route with two independent path constraints is NP-complete. Therefore, QoS routing algorithms for high speed networks must be adaptive, flexible, and intelligent for efficient network management. In a previous work, we proposed a genetic algorithm (GA) based routing method. This method used only the delay time as a routing parameter. In this paper we improve the previous work in three aspects. The new QoS routing method uses two QoS parameters for routing. We implemented a new tree generating algorithm which generates and reduces the tree automatically. Furthermore, we carried out the simulations for different kinds of networks. The simulation results show that the proposed method has a better performance than a conventional GA based routing algorithm.\",\"PeriodicalId\":376322,\"journal\":{\"name\":\"First International Symposium on Cyber Worlds, 2002. Proceedings.\",\"volume\":\"69 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-11-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"First International Symposium on Cyber Worlds, 2002. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CW.2002.1180892\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Symposium on Cyber Worlds, 2002. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CW.2002.1180892","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

摘要

为了支持高速网络上的多媒体通信,有必要开发用于路由多个QoS参数的路由算法。这是因为视频点播和远程会议系统等新业务需要更好的QoS。但是,QoS路由问题比较困难,找到具有两个独立路径约束的可行路由是np完全的。因此,高速网络的QoS路由算法必须具有自适应、灵活和智能化的特点,才能实现高效的网络管理。在之前的工作中,我们提出了一种基于遗传算法的路由方法。这种方法只使用延迟时间作为路由参数。本文从三个方面对前人的工作进行了改进。新的QoS路由方法使用两个QoS参数进行路由。我们实现了一种新的树生成算法,可以自动生成和缩减树。此外,我们还对不同类型的网络进行了仿真。仿真结果表明,该方法比传统的基于遗传算法的路由算法具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A new QoS routing approach for multimedia applications based on genetic algorithms
In order to support multimedia communication over high speed networks, it is necessary to develop routing algorithms which use for routing more than one QoS parameter. This is because new services such as video on demand and remote meeting systems require better QoS. However, the problem of QoS routing is difficult and to find a feasible route with two independent path constraints is NP-complete. Therefore, QoS routing algorithms for high speed networks must be adaptive, flexible, and intelligent for efficient network management. In a previous work, we proposed a genetic algorithm (GA) based routing method. This method used only the delay time as a routing parameter. In this paper we improve the previous work in three aspects. The new QoS routing method uses two QoS parameters for routing. We implemented a new tree generating algorithm which generates and reduces the tree automatically. Furthermore, we carried out the simulations for different kinds of networks. The simulation results show that the proposed method has a better performance than a conventional GA based routing algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信