基于遗传算法的多约束路由

2013 IEEE International Conference on RFID-Technologies and Applications (RFID-TA) Pub Date : 2013-09-01 DOI:10.1109/RFID-TA.2013.6694537

Nibras Abdullah, Mahmoud Baklizi, S. Ramadass, O. A. Al-wesabi

{"title":"基于遗传算法的多约束路由","authors":"Nibras Abdullah, Mahmoud Baklizi, S. Ramadass, O. A. Al-wesabi","doi":"10.1109/RFID-TA.2013.6694537","DOIUrl":null,"url":null,"abstract":"Different multimedia conferencing and telephony systems are available worldwide. The development of a method that can process more than one quality of service routing parameter and can meet communication system requirements is essential to support these systems within high-speed networks. This paper briefly presents a significant method that solves network routing protocol problems, such as finding the shortest and the most feasible path based on the genetic algorithm.","PeriodicalId":253369,"journal":{"name":"2013 IEEE International Conference on RFID-Technologies and Applications (RFID-TA)","volume":"62 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Multi-constrained routing using genetic algorithm\",\"authors\":\"Nibras Abdullah, Mahmoud Baklizi, S. Ramadass, O. A. Al-wesabi\",\"doi\":\"10.1109/RFID-TA.2013.6694537\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Different multimedia conferencing and telephony systems are available worldwide. The development of a method that can process more than one quality of service routing parameter and can meet communication system requirements is essential to support these systems within high-speed networks. This paper briefly presents a significant method that solves network routing protocol problems, such as finding the shortest and the most feasible path based on the genetic algorithm.\",\"PeriodicalId\":253369,\"journal\":{\"name\":\"2013 IEEE International Conference on RFID-Technologies and Applications (RFID-TA)\",\"volume\":\"62 3\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on RFID-Technologies and Applications (RFID-TA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RFID-TA.2013.6694537\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on RFID-Technologies and Applications (RFID-TA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RFID-TA.2013.6694537","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

世界各地都有不同的多媒体会议和电话系统。开发一种能够处理多个服务质量路由参数并能够满足通信系统要求的方法对于在高速网络中支持这些系统至关重要。简要介绍了一种基于遗传算法解决网络路由协议问题的重要方法，如寻找最短和最可行的路径。

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

查看原文本刊更多论文

Multi-constrained routing using genetic algorithm

Different multimedia conferencing and telephony systems are available worldwide. The development of a method that can process more than one quality of service routing parameter and can meet communication system requirements is essential to support these systems within high-speed networks. This paper briefly presents a significant method that solves network routing protocol problems, such as finding the shortest and the most feasible path based on the genetic algorithm.

求助全文

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

来源期刊

2013 IEEE International Conference on RFID-Technologies and Applications (RFID-TA)

自引率

0.00%

发文量