检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张思豪 田建宇[1] 刘银良[1] 刘卫新[1] 刘经天 Zhang Sihao;Tian Jianyu;Liu Yinliang;Liu Weixin;Liu Jingtian(North Automatic Control Technology Institute,Taiyuan 030006,China)
机构地区:[1]北方自动控制技术研究所,山西太原030006
出 处:《信息技术与网络安全》2021年第5期74-79,共6页Information Technology and Network Security
摘 要:现有的以Web Service为主的SOA实现方案普遍存在占用通信带宽高、信息编码不适应窄带消息传递效率等问题,难以适应战术级作战部队高速机动、窄带网络、资源受限的作战特点。针对战术级作战信息系统在资源受限环境下实现服务化的需要,结合资源受限环境特点,分析现有负载均衡算法存在的不足,基于最小连接算法提出了一种动态权值分配算法。经过实验证明,该算法可有效提高资源受限下的高并发负载能力。The existing SOA implementation solutions based on Web Service generally have problems such as high communication bandwidth occupation and inadequacy of information coding for narrow-band message transmission efficiency,and it is difficult to adapt to the operational characteristics of tactical combat troops such as high-speed maneuverability,narrow-band network,and resource-constrained operations.In response to the need for tactical combat information systems to be service-oriented in resource-constrained environments,the paper combines the characteristics of resource-constrained environments and analyzes existing load balancing algorithms.Aiming at the shortcomings of the existing algorithms,a dynamic weight allocation algorithm is proposed based on the minimum connection algorithm.Experimental results prove that the algorithm can effectively improve the high concurrent load capacity under resource constraints.
分 类 号:TP393.0[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.170