摘要
基于尽力而为服务模式的Internet,在支持群组命令传输过程中,容易产生路径竞争问题.定义出有效路径统计网络,并进一步定义出基于有效路径统计网络的群组多约束多目标优化问题.提出一种群组命令传输算法.该算法,分别定义出模糊球体划分、连续空间蚁群搜索及重叠区域解可信度衰减策略.实验从服务延迟率和传输成功率两个方面,验证了该算法在支持群组命令传输过程的有效性.
It is a problem that the best-effort service model standing for group command transmission causes path competition. To solve the problem,this paper firstly defines effective path statistics network( EPSN) based on Internet,and further describes group multi-constraints multi-objectives optimization problem based on the EPSN. This paper proposes a group command transmission algorithm. The algorithm defines fuzzy ball division,continuous space ant colony optimization and overlapped area solution reliability reduction respectively. The experiment tests validity of the algorithm from service delay rate and transmission success rate.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2016年第2期413-419,共7页
Acta Electronica Sinica
基金
国家自然科学基金(No.60970012)
高等学校博士学科点专项科研博导基金(No.20113120110008)
上海重点科技攻关项目(No.14511107902)
上海市工程中心建设项目(No.GCZX14014)
上海智能家居大规模物联共性技术工程中心项目(No.GCZX14014)
上海市一流学科建设项目(No.XTKX2012)
沪江基金研究基地专项(No.C14001)
关键词
群组命令传输
群组多约束多目标优化
路径竞争
蚁群算法
group command transmission
group multi-constraints multi-objectives optimization problem
path competition
ant colony optimization