A virtual node placement strategy based on service-aware is proposed for an information acquisition platform. The performance preferences and types of services in the information acquisition platform are analyzed as w...A virtual node placement strategy based on service-aware is proposed for an information acquisition platform. The performance preferences and types of services in the information acquisition platform are analyzed as well as a comparison of the running time of services both in virtual node centralized and decentralized placing. All physical hosts are divided into different sub-clusters by using the analytic hierarchy process( AHP),in order to fit service of different performance preferences. In the sub-cluster,both load balance and quality of service are taken into account. Comparing with the heuristic algorithm,the experiment results show that the proposed placement strategy is running for a shorter time. And comparing with the virtual node placement strategy provided by OpenStack,the experiment results show that the proposed placement strategy can improve the execution speed of service in the information acquisition platform,and also can balance the load which improves resources utilization.展开更多
The focus of this paper is on base functionalities required for UAV-based rapid deployment of an ad hoc communication infrastructure in the initial phases of rescue operations.The main idea is to use heterogeneous tea...The focus of this paper is on base functionalities required for UAV-based rapid deployment of an ad hoc communication infrastructure in the initial phases of rescue operations.The main idea is to use heterogeneous teams of UAVs to deploy communication kits that include routers,and are used in the generation of ad hoc Wireless Mesh Networks(WMN).Several fundamental problems are considered and algorithms are proposed to solve these problems.The Router Node Placement problem(RNP)and a generalization of it that takes into account additional constraints arising in actual field usage is considered first.The RNP problem tries to determine how to optimally place routers in a WMN.A new algorithm,the RRT-WMN algorithm,is proposed to solve this problem.It is based in part on a novel use of the Rapidly Exploring Random Trees(RRT)algorithm used in motion planning.A comparative empirical evaluation between the RRT-WMN algorithm and existing techniques such as the Covariance Matrix Adaptation Evolution Strategy(CMA-ES)and Particle Swarm Optimization(PSO),shows that the RRT-WMN algorithm has far better performance both in amount of time taken and regional coverage as the generalized RNP problem scales to realistic scenarios.The Gateway Node Placement Problem(GNP)tries to determine how to locate a minimal number of gateway nodes in a WMN backbone network while satisfying a number of Quality of Service(QoS)constraints.Two alternatives are proposed for solving the combined RNP-GNP problem.The first approach combines the RRT-WMN algorithm with a preexisting graph clustering algorithm.The second approach,WMNbyAreaDecomposition,proposes a novel divide-and-conquer algorithm that recursively partitions a target deployment area into a set of disjoint regions,thus creating a number of simpler RNP problems that are then solved concurrently.Both algorithms are evaluated on real-world GIS models of different size and complexity.WMNbyAreaDecomposition is shown to outperform existing algorithms using 73%to 92%fewer router nodes while at the same time satisfying all QoS requirements.展开更多
针对命名数据网络(named data networking,NDN)中缓存冗余高、资源利用率低的问题,提出基于数据冗余包的协同缓存放置策略(cooperative cache placement strategy based on da-ta redundancy packet,CCPS-DRP)。该策略先对网络进行社区...针对命名数据网络(named data networking,NDN)中缓存冗余高、资源利用率低的问题,提出基于数据冗余包的协同缓存放置策略(cooperative cache placement strategy based on da-ta redundancy packet,CCPS-DRP)。该策略先对网络进行社区划分,再利用复杂网络中节点介数确定关键路由节点,将数据冗余包中的相同数据副本存放于其中,并动态管理冗余数据副本,实现关键节点集中管理与动态冗余清理的协同机制,以减少相同数据内容的重复缓存,使路由节点中的缓存容量得到充分利用,降低网络负载。实验结果表明,无论在均匀分布或高度偏斜分布的场景下,还是在严格资源限制或有较高资源的场景下,CCPS-DRP在缓存命中率和平均请求时延方面的性能均明显优于常见的随处缓存策略、概率缓存策略等,其通过协同缓存与冗余控制显著提升了网络性能。展开更多
基金Supported by the National Natural Science Foundation of China(No.61100189,61370215,61370211,61402137)the National Key Technology R&D Program(No.2012BAH45B01)the Open Project Foundation of Information Security Evaluation Center of Civil Aviation,Civil Aviation University of China(No.CAAC-ISECCA-201703)
文摘A virtual node placement strategy based on service-aware is proposed for an information acquisition platform. The performance preferences and types of services in the information acquisition platform are analyzed as well as a comparison of the running time of services both in virtual node centralized and decentralized placing. All physical hosts are divided into different sub-clusters by using the analytic hierarchy process( AHP),in order to fit service of different performance preferences. In the sub-cluster,both load balance and quality of service are taken into account. Comparing with the heuristic algorithm,the experiment results show that the proposed placement strategy is running for a shorter time. And comparing with the virtual node placement strategy provided by OpenStack,the experiment results show that the proposed placement strategy can improve the execution speed of service in the information acquisition platform,and also can balance the load which improves resources utilization.
基金Supported by the ELLIIT Network Organization for Information and Communication Technology,Swedenthe Swedish Foundation for Strategic Research SSF(Smart Systems Project RIT15-0097)+2 种基金the Wallenberg AI,Autonomous Systems and Software Program:WASP WARA-PS ProjectThe 3rd author is also supported by an RExperts Program Grant 2020A1313030098 fromthe Guangdong Department of Science and Technology,China and a Sichuan Province International Science and Technology Innovation Cooperation Project Grant 2020YFH0160.
文摘The focus of this paper is on base functionalities required for UAV-based rapid deployment of an ad hoc communication infrastructure in the initial phases of rescue operations.The main idea is to use heterogeneous teams of UAVs to deploy communication kits that include routers,and are used in the generation of ad hoc Wireless Mesh Networks(WMN).Several fundamental problems are considered and algorithms are proposed to solve these problems.The Router Node Placement problem(RNP)and a generalization of it that takes into account additional constraints arising in actual field usage is considered first.The RNP problem tries to determine how to optimally place routers in a WMN.A new algorithm,the RRT-WMN algorithm,is proposed to solve this problem.It is based in part on a novel use of the Rapidly Exploring Random Trees(RRT)algorithm used in motion planning.A comparative empirical evaluation between the RRT-WMN algorithm and existing techniques such as the Covariance Matrix Adaptation Evolution Strategy(CMA-ES)and Particle Swarm Optimization(PSO),shows that the RRT-WMN algorithm has far better performance both in amount of time taken and regional coverage as the generalized RNP problem scales to realistic scenarios.The Gateway Node Placement Problem(GNP)tries to determine how to locate a minimal number of gateway nodes in a WMN backbone network while satisfying a number of Quality of Service(QoS)constraints.Two alternatives are proposed for solving the combined RNP-GNP problem.The first approach combines the RRT-WMN algorithm with a preexisting graph clustering algorithm.The second approach,WMNbyAreaDecomposition,proposes a novel divide-and-conquer algorithm that recursively partitions a target deployment area into a set of disjoint regions,thus creating a number of simpler RNP problems that are then solved concurrently.Both algorithms are evaluated on real-world GIS models of different size and complexity.WMNbyAreaDecomposition is shown to outperform existing algorithms using 73%to 92%fewer router nodes while at the same time satisfying all QoS requirements.
文摘针对命名数据网络(named data networking,NDN)中缓存冗余高、资源利用率低的问题,提出基于数据冗余包的协同缓存放置策略(cooperative cache placement strategy based on da-ta redundancy packet,CCPS-DRP)。该策略先对网络进行社区划分,再利用复杂网络中节点介数确定关键路由节点,将数据冗余包中的相同数据副本存放于其中,并动态管理冗余数据副本,实现关键节点集中管理与动态冗余清理的协同机制,以减少相同数据内容的重复缓存,使路由节点中的缓存容量得到充分利用,降低网络负载。实验结果表明,无论在均匀分布或高度偏斜分布的场景下,还是在严格资源限制或有较高资源的场景下,CCPS-DRP在缓存命中率和平均请求时延方面的性能均明显优于常见的随处缓存策略、概率缓存策略等,其通过协同缓存与冗余控制显著提升了网络性能。
基金国家自然科学基金(the National Natural Science Foundation of China under Grant No.90405016)教育部新世纪优秀人才支持计划(the New Century Excellent Talents in University Foundation of China)陕西省自然科学基金(the Natural Science Foundation of Shaanxi Province of China under Grant No.2006A05)。
