计算机科学 ›› 2015, Vol. 42 ›› Issue (10): 95-100.

• 网络与通信 • 上一篇    下一篇

分布式星群网络中基于蚁群算法的通信量分类路由

姜楠,何元智   

  1. 解放军理工大学通信工程学院 南京210007;中国电子设备系统工程公司研究所 北京100141,中国电子设备系统工程公司研究所 北京100141
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金重点项目(61231011,61032004)资助

ACO Based Traffic Classified Routing Algorithm in Distributed Satellite Cluster Network

JIANG Nan and HE Yuan-zhi   

  • Online:2018-11-14 Published:2018-11-14

摘要: 给出了一种分布式星群网络(Distributed Satellite Cluster Network,DSCN)体系架构,阐明了DSCN拓扑变化的特点。在分析网络状态获取方式和路由计算方法的基础上,提出了一种适用于DSCN的基于蚁群算法的通信量分类路由(Ant Colony Optimization Based Traffic Classified Routing,ATCR)算法。ATCR算法将通信量分为时延敏感型通信量A、带宽敏感型通信量B以及提供尽力而为服务的通信量C,并对蚁群算法(Ant Colony Optimization,ACO)收敛慢的缺点进行了改进。仿真实验表明,ATCR算法提高了收敛速度,可以有效平衡网络流量。通信量A和C的端到端时延要小于未采用通信量分类的改进ACO算法。由于减少了重负载链路的数量及拥塞引起的丢包,ATCR算法在分组递交率上的表现优于改进的ACO算法。

关键词: 分布式星群网络,蚁群算法,通信量分类,端到端时延,分组递交率

Abstract: The architecture of distributed satellite cluster network (DSCN) was presented and the characteristics of DSCN topology change were illustrated.On the basis of analyzing the acquisition method of network status and route calculation,we proposed an ant colony optimization based traffic classified routing (ATCR) algorithm for DSCN.In ATCR,traffic is divided into three classes,traffic class A takes minimized end to end delay as optimization target,traffic class B takes maximize throughput and traffic class C provides best-effort service.ATCR improves the shortcoming of slow convergence in ant colony optimization (ACO).Simulation results show that ATCR algorithm can improve the convergence speed and balance network traffic effectively.The end-to-end delay of traffic class A and class B is less than MACO algorithm which does not use traffic classification.ATCR has a better performance on packet delivery ratio than MACO,because ATCR reduces the number of heavy load link as well as packet loss caused by congestion.

Key words: DSCN,ACO,Traffic classification,End-to-end delay,Packet delivery ratio

[1] Brown O,Eremenko B.The Value Proposition for Fractionated Space Architectures[J].AAIA Reinventing Space Conference,2006(7506):1-22
[2] Orndorff G A,Zink B F,CosbyJ D.Clustered Architecture for Responsive Space[J].AAIA Reinventing Space Conference,2007(1002):1-14
[3] Lu Y,Zhao Y,Sun F,et al.Dynamic Fault-tolerant Routingbased on FSA for LEO satellite networks[J].IEEE Transactions on Computers,2013,62(10):1945-1958
[4] Rao Y,Wang R.Agent-based load balancing routing for LEOsatellite networks[J].Computer Networks,2010,54(17):3187-3195
[5] Na Z,Gao Z,Cui Y,et al.Agent-Based Distributed RoutingAlgorithm with Traffic Prediction for LEO Satellite Network[J].International Journal of Future Generation Communication and Networking,2013,6(3):67-84
[6] Mohorcic M,Svigelj A,Kandus G.Traffic class dependent routing in ISL networks[J].IEEE Transactions on Aerospace and Electronic Systems,2004,40(4):1160-1172
[7] Rao Y,Wang R.Performance of QoS routing using genetic algorithm for Polar-orbit LEO satellite networks[J].AEU-International Journal of Electronics and Communications,2011,65(6):530-538
[8] Long F,Sun F,Yang Z.A Novel Routing Algorithm Based on Multi-Objective Optimization for Satellite Networks[J].Journal of Networks,2011,6(2):238-246
[9] Werner M,Delucchi C,Vogel H J.ATM-based routing in LEO/MEO satellite networks with inter-satellite links[J].IEEE Journal on Selected Areas in Communications,1997,15(1):69-82
[10] Ekici E,Akyildiz I F,Bender M D.A distributed routing algorithm for datagram traffic in LEO Satellite networks[J].IEEE/ACM Transactions on Networking,2001,9(2):137-147
[11] Mohorcic M,Svigelj A,Kandus G.Demographically weightedtraffic flow models for adaptive routing in packet-switched non-geostationary satellite meshed networks[J].Computer Networks,2003(43):113-131
[12] Liao T,Stützle T,Montes de Oca M A,et al.A unified ant colony optimization algorithm for continuous optimization[J].European Journal of Operational Research,2014,234(3):597-609

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!