基于粒子群优化的ABC支持QoS单播路由方案

2009 First Asian Conference on Intelligent Information and Database Systems Pub Date : 2009-04-01 DOI:10.1109/ACIIDS.2009.37

Xingwei Wang, Hai-Quan Yang, Min Huang, Lei Guo

{"title":"基于粒子群优化的ABC支持QoS单播路由方案","authors":"Xingwei Wang, Hai-Quan Yang, Min Huang, Lei Guo","doi":"10.1109/ACIIDS.2009.37","DOIUrl":null,"url":null,"abstract":"In this paper, a QoS unicast routing scheme withABC supported is proposed. With gaming analysis and particle swarm optimization algorithm, it tries to find a QoS unicast path with Pareto optimum under Nash equilibrium on both the network provider utility and the user utility achieved or approached. Simulation results have shown that it is both feasible and effective.","PeriodicalId":275776,"journal":{"name":"2009 First Asian Conference on Intelligent Information and Database Systems","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ABC Supporting QoS Unicast Routing Scheme with Particle Swarm Optimization\",\"authors\":\"Xingwei Wang, Hai-Quan Yang, Min Huang, Lei Guo\",\"doi\":\"10.1109/ACIIDS.2009.37\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, a QoS unicast routing scheme withABC supported is proposed. With gaming analysis and particle swarm optimization algorithm, it tries to find a QoS unicast path with Pareto optimum under Nash equilibrium on both the network provider utility and the user utility achieved or approached. Simulation results have shown that it is both feasible and effective.\",\"PeriodicalId\":275776,\"journal\":{\"name\":\"2009 First Asian Conference on Intelligent Information and Database Systems\",\"volume\":\"54 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 First Asian Conference on Intelligent Information and Database Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACIIDS.2009.37\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 First Asian Conference on Intelligent Information and Database Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACIIDS.2009.37","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

提出了一种支持abc的QoS单播路由方案。通过博弈分析和粒子群优化算法，在网络提供者效用和用户效用均达到或接近的纳什均衡下，寻求一条帕累托最优的QoS单播路径。仿真结果表明了该方法的可行性和有效性。

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

查看原文本刊更多论文

ABC Supporting QoS Unicast Routing Scheme with Particle Swarm Optimization

In this paper, a QoS unicast routing scheme withABC supported is proposed. With gaming analysis and particle swarm optimization algorithm, it tries to find a QoS unicast path with Pareto optimum under Nash equilibrium on both the network provider utility and the user utility achieved or approached. Simulation results have shown that it is both feasible and effective.

求助全文

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

来源期刊

2009 First Asian Conference on Intelligent Information and Database Systems

自引率

0.00%

发文量