This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes （mQN） model. In this model, expressions are derived to calculate two pe...This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes （mQN） model. In this model, expressions are derived to calculate two performance metrics, namely, the queue node and system utilization factors. In order to demonstrate the flexibility and effectiveness of the mQN model in analyzing the performance of an mQN network router, two scenarios are performed. These scenarios investigated the variation of queue nodes and system utilization factors against queue nodes dropping probability for various system sizes and packets arrival routing probabilities. The performed scenarios demonstrated that the mQN analytical model is more flexible and effective when compared with experimental tests and computer simulations in assessing the performance of an mQN network router.展开更多
IP over WDM is being envisioned as one of the most attractive architectures for the next generation Internet. This paper introduces two novel backbone node structures for IP over WDM networks. These node structures ca...IP over WDM is being envisioned as one of the most attractive architectures for the next generation Internet. This paper introduces two novel backbone node structures for IP over WDM networks. These node structures can be used as improvement approaches to DPDP (default path and dedicated path) method. The flow classifiers, which are the main components of these node structures, and the performance metrics of these structures, are also discussed.展开更多
随着互联网的飞速发展,集群结构的下一代核心路由器已经成为研究的重点.在可扩展路由器中(clus- ter router),并行路由算法是关键问题之一.对于广泛部署的OSPF协议,最短路径树(SPT)的并行计算是其并行化的核心难点.本文提出了一种计算...随着互联网的飞速发展,集群结构的下一代核心路由器已经成为研究的重点.在可扩展路由器中(clus- ter router),并行路由算法是关键问题之一.对于广泛部署的OSPF协议,最短路径树(SPT)的并行计算是其并行化的核心难点.本文提出了一种计算最短路径树的算法-分区Dijkstra算法(D-D),分析了算法性能,并通过模拟实验验证了算法的性能.展开更多
由于传感器网络中的节点能量受限,因此如何减少节点的能量开销成为路由协议的研究目标.文中提出了一种低能耗的双层数据分发(An Energy-based Two Tier Data Dissemination Model,E-TTDD)算法.该算法采用斜格组建单元,把源节点和汇聚节...由于传感器网络中的节点能量受限,因此如何减少节点的能量开销成为路由协议的研究目标.文中提出了一种低能耗的双层数据分发(An Energy-based Two Tier Data Dissemination Model,E-TTDD)算法.该算法采用斜格组建单元,把源节点和汇聚节点附近的转发节点连接成一条直线,然后在以这条直线为中心以一定间隔的两条平行线之间搜索转发节点,从而使查询路径的能量开销降低.最后用Matlab进行性能仿真.结果表明,E-TTDD算法与原有TTDD算法相比,能量开销降低了3倍,同时延长了网络生存周期.展开更多
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.展开更多
文摘This paper presents the derivation of an analytical model for a multi-queue nodes network router, which is referred to as the multi-queue nodes （mQN） model. In this model, expressions are derived to calculate two performance metrics, namely, the queue node and system utilization factors. In order to demonstrate the flexibility and effectiveness of the mQN model in analyzing the performance of an mQN network router, two scenarios are performed. These scenarios investigated the variation of queue nodes and system utilization factors against queue nodes dropping probability for various system sizes and packets arrival routing probabilities. The performed scenarios demonstrated that the mQN analytical model is more flexible and effective when compared with experimental tests and computer simulations in assessing the performance of an mQN network router.
文摘IP over WDM is being envisioned as one of the most attractive architectures for the next generation Internet. This paper introduces two novel backbone node structures for IP over WDM networks. These node structures can be used as improvement approaches to DPDP (default path and dedicated path) method. The flow classifiers, which are the main components of these node structures, and the performance metrics of these structures, are also discussed.
基金Supported by the National Natural Science Foundation of China under Grant Nos.9060402960773150(国家自然科学基金)the National High-Teeh Research and Development Plan of China under Grant No.2077AA01Z219(国家高技术研究发展计划(863))
文摘随着互联网的飞速发展,集群结构的下一代核心路由器已经成为研究的重点.在可扩展路由器中(clus- ter router),并行路由算法是关键问题之一.对于广泛部署的OSPF协议,最短路径树(SPT)的并行计算是其并行化的核心难点.本文提出了一种计算最短路径树的算法-分区Dijkstra算法(D-D),分析了算法性能,并通过模拟实验验证了算法的性能.
文摘路由器节点承载WMNs(Wireless Mesh Networks)的主要业务,决定网络的整体性能,其业务性能建模与分析是当前研究的热点内容。本文基于802.11 OFDM物理层计算的分组平均服务时间,采用排队论分析WMN路由器节点业务性能的理论模型,给出节点业务性能的计算方法,通过理论分析与仿真验证模型的准确性,并给出使用归一化的模型参数的简化计算方法。分析表明,在相对稳定的网络环境中,路由器节点的性能与业务到达模型相关,需要采用不同的模型和方法分析VBR(Variable Bit Rate)和CBR(Constant Bit Rate)业务的性能;在动态的网络中,节点性能与业务到达过程无关,采用泊松到达可以准确地分析不同业务的性能。本文建模的基础是分组平均服务时间,使分析模型与实际的网络形态无关;基于归一化参数的算法也增大了模型的适应性,使其可以应用在网络规划设计、业务接入控制和分组调度等诸多方面。
文摘由于传感器网络中的节点能量受限,因此如何减少节点的能量开销成为路由协议的研究目标.文中提出了一种低能耗的双层数据分发(An Energy-based Two Tier Data Dissemination Model,E-TTDD)算法.该算法采用斜格组建单元,把源节点和汇聚节点附近的转发节点连接成一条直线,然后在以这条直线为中心以一定间隔的两条平行线之间搜索转发节点,从而使查询路径的能量开销降低.最后用Matlab进行性能仿真.结果表明,E-TTDD算法与原有TTDD算法相比,能量开销降低了3倍,同时延长了网络生存周期.
基金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.
