Multiple constrained QoS routing based on prey-predator model and ant colony algorithm

doi:10.3778/j.issn.1002-8331.2009.14.035

Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (14): 116-118.DOI: 10.3778/j.issn.1002-8331.2009.14.035

• 网络、通信、安全 • Previous Articles Next Articles

Multiple constrained QoS routing based on prey-predator model and ant colony algorithm

LONG Peng-fei,ZHANG Chun,HE Liang

College of Computer and Communicational Engineering，Changsha University of Science and Technology，Changsha 410076，China

Received:2008-03-19 Revised:2008-05-19 Online:2009-05-11 Published:2009-05-11
Contact: LONG Peng-fei

基于捕食模型与蚁群算法的多约束QoS路由选择

龙鹏飞,张纯,贺亮

长沙理工大学计算机与通信工程学院，长沙 410076

通讯作者: 龙鹏飞

Abstract

Abstract: The paper transforms multiple constrained QoS routing problem into the multi-objective problem which can satisfy the minimum delay，the minimum packet loss rate firstly and then the minimum cost by a multiple constrained assign-weigh chart aiming at it.The paper uses the prey-predator model to find the non-inferior set immediately by adjusting the objects right of the minimum delay and the minimum packet loss rate.Also the ant colony algorithm has accomplished ultimate routing with the minimum cost by using the ability of searching the global optimization.The experiment results show that the algorithm is effective.

Key words: multiple constrained QoS routing, multi-objective, prey-predator model, non-inferior set, ant colony algorithm

摘要： 针对多约束QoS路由选择问题，将其转化为一个多约束赋权图，求符合最小时延和最小丢包率且满足最小成本的多目标问题。利用捕食模型调整最小时延和最小丢包率这两个目标的权值，快速找到非劣解集；再结合蚁群算法很强的全局寻优能力，完成最小成本的路由选择。实例计算结果证明了算法的可行性。

关键词: 多约束QoS路由选择, 多目标, 捕食模型, 非劣解集, 蚁群算法

LONG Peng-fei,ZHANG Chun,HE Liang. Multiple constrained QoS routing based on prey-predator model and ant colony algorithm[J]. Computer Engineering and Applications, 2009, 45(14): 116-118.

龙鹏飞,张纯,贺亮. 基于捕食模型与蚁群算法的多约束QoS路由选择[J]. 计算机工程与应用, 2009, 45(14): 116-118.

[1]	ZHANG Bo, XU Liming, HUANG Zhiwei, YAO Xiaopeng. Multi-objective GANs Pareto Optimality Algorithm Using Gradient Strategy [J]. Computer Engineering and Applications, 2021, 57(9): 89-95.
[2]	ZHANG Xu, YUAN Xumei, YUAN Jige. Research on Methods for Supply-Demand Matching Decision-Making Based on Broker [J]. Computer Engineering and Applications, 2021, 57(9): 240-246.
[3]	SHI Chuntian, ZENG Yanyang, HOU Shouming. Summary of Application of Swarm Intelligence Algorithms in Image Segmentation [J]. Computer Engineering and Applications, 2021, 57(8): 36-47.
[4]	ZHANG Songcan, PU Jiexin, SI Yanna, SUN Lifan. Adaptive Improved Ant Colony Algorithm Based on Population Similarity and Its Application [J]. Computer Engineering and Applications, 2021, 57(8): 70-77.
[5]	BU Guannan, LIU Jianhua, JIANG Lei, ZHANG Dongyang. Ant Colony Algorithm with Adaptive Grouping [J]. Computer Engineering and Applications, 2021, 57(6): 67-73.
[6]	MA Xianghua, ZHANG Qian. Research on Improved Ant Colony Algorithm in Robots Path Planning [J]. Computer Engineering and Applications, 2021, 57(5): 210-215.
[7]	YANG Wei, WU Yingying, WANG Ting. Research on Configuration Optimization Problems of Shuttle-Carrier Storage and Retrieval System [J]. Computer Engineering and Applications, 2021, 57(4): 258-265.
[8]	LI Qian, JIANG Li, LIANG Changyong. Multi-objective Cold Chain Distribution Optimization Based on Fuzzy Time Window [J]. Computer Engineering and Applications, 2021, 57(23): 255-262.
[9]	CHEN Wanfen, WANG Yujia, LIN Weixing. Heterogeneous Ensemble Surrogate Assisted Multi-objective Particle Swarm Optimization Algorithm [J]. Computer Engineering and Applications, 2021, 57(23): 71-80.
[10]	HU Xiaobing, CHEN Shunian, ZHANG Yingfei, GU Shenghao. New Ripple-Spreading Algorithm for Multi-objective Path Optimization [J]. Computer Engineering and Applications, 2021, 57(23): 81-90.
[11]	LI Dahai, AI Zhigang, WANG Zhendong. Improved Yin-Yang-Pair Multi-objective Optimization Algorithm Based on Full-Combination Strategy [J]. Computer Engineering and Applications, 2021, 57(22): 110-124.
[12]	DU Shouxin, WU Tao. Study on Application of Double Population Hybrid Genetic Algorithm in Cut Order Planning [J]. Computer Engineering and Applications, 2021, 57(22): 182-189.
[13]	WANG Xiaoguang, YANG Peibei. Design and Effect Analysis of Digital Transformation of Shipping Logistics Enterprises [J]. Computer Engineering and Applications, 2021, 57(21): 241-247.
[14]	ZHANG Ziran, HUANG Weihua, CHEN Yang, ZHANG Zheng, LI Ziyuan. Improved Ant Colony Path Planning Algorithm Based on Bidirectional Search [J]. Computer Engineering and Applications, 2021, 57(21): 270-277.
[15]	DING Yi, ZHANG Chengcheng. External Trucks’ Appointment Optimization of Delivering Containers from Outside at Container Terminal [J]. Computer Engineering and Applications, 2021, 57(19): 267-273.

Multiple constrained QoS routing based on prey-predator model and ant colony algorithm

基于捕食模型与蚁群算法的多约束QoS路由选择

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics