面向分布式交互应用的全部到全部路由问题研究  

Research on All-to-all Routing Problem for Distributed Interactive Application

作　　者：李永 陆伟 LI Yong;LU Wei(School of Information Engineering,Yancheng Teachers University,Yancheng 224002,China)

机构地区：[1]盐城师范学院信息工程学院,江苏盐城224002

出　　处：《计算机技术与发展》2018年第12期91-95,共5页Computer Technology and Development

基　　金：国家自然科学基金(61603326);盐城师范学院自然科学基金项目(14YCKL016)

摘　　要：针对分布式交互应用(DIA)中的一类全部到全部路由问题进行研究,源根树和单棵共享树是DIA中全部到全部路由的两种极端方法。源根树为每一个需要发送数据的DIA节点都以它为根构造一棵数据分发树,该方法费用开销太大;而所有需要发送数据的DIA节点都基于单棵共享树进行数据分发树,又会造成流量集中,DIA延时无法保障。因此,需要对这两种方法进行权衡,提出基于多共享树研究DIA中的全部到全部路由问题(DARP)。为了确定多共享树的数目和根节点位置,构造了DARP的多目标优化模型,该模型在满足DIA的延时约束的前提下,最小化DIA数据分发总延时和DIA数据分发总代价;同时,针对DARP的多目标优化模型提出了求解DARP问题的禁忌遗传算法(DARP_TGA),并通过模拟仿真验证了该算法的有效性。Aiming at the all-to-all routing problem in distributed interactive application(DIA),source rooted tree and single shared treeare two extreme approaches in DIA.In source rooted tree,each DIA node that needs to send data constructs a data distribution tree rooteditself,which costs too much.But in single shared tree,all the DIA nodes that need to send data are based on single shared tree,which willcause traffic concentration,and DIA delay can't be guaranteed.Therefore,we need to trade off those two approaches,and propose tostudy the all-to-all routing problem in DIA(DARP)based on multiple shared trees.In order to determine the number and roots of multiple shared trees,we construct a multi-objective optimization model of DARP,which minimizes the total delay and the total cost underthe premise of satisfying the delay constraint of DIA.At the same time,a tabu-genetic algorithm for DARP problem(DARP_TGA)isproposed for DARP multi-objective optimization model,and the effectiveness of DARP_TGA is verified by simulation.

关 键 词：分布式交互应用 全部到全部路由 多共享树 禁忌遗传算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]