首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 78 毫秒
1.
The pheromone-based ant routing algorithm is a distributed routing algorithm with good scalability and robustness. A 2-D cellular automata (CA) model of the computer network was presented to analyze the algorithm. The results show that the procedure of establishing a stable route is self-organized towards the attractive peculiar state, and the duration of time for the routing establishment is power-law distributed. A practical ant routing protocol over an IP network was also presented, and two simulations were done to compare the performance dynamic and the load balancing performance between this protocol and the open shortest path first (OSPF) protocol. The results show that the ant routing protocol out-performs OSPF in these aspects.  相似文献   

2.
QoS routing is one of the key technologies for providing guaranteed service in IP networks. The paper focuses on the optimization problem for bandwidth constrained QoS routing, and proposes an optimal algorithm based on the global optimization of path bandwidth and hop counts. The main goal of the algorithm is to minimize the consumption of network resource, and at the same time to minimize the network congestion caused by irrational path selection. The simulation results show that our algorithm has lower call blocking rate and higher throughput than traditional algorithms.  相似文献   

3.
A new algorithm called spatially aware routing algorithm with enhanced learning (SAREL) is proposed to guarantee the rationality of route selecting in inter-vehicle communication scenario. Firstly, the traffic model is discussed and set up by using Poisson distribution. Then we analyze the process of traffic evaluation with enhanced learning, and exploit movement estimation to assist state memorization. The improvement of algorithm is provided at last compared with our previous work. Simulation results show that SAREL algorithm could achieve better performance in packet delivery ratio, especially when network connection ratio is average.  相似文献   

4.
Most of the work in traffic grooming has been in the area of providing efficient network designs in Wavelength division multiplexing (WDM). The objective of these traffic grooming algorithms is to reduce the cost of overall networks. In this paper, a routing algorithm based on transiently chaotic neural network is proposed to solve the problem in WDM logical topology. The objectives of the routing algorithm are ac commodating all traffic requirements and using less network resource. The simulation shows that the proposed algorithm is efficient in the routing selection, meanwhile the algorithm can use less network resource.  相似文献   

5.
Failure-insensitive routing is a good mechanism to avoid packet dropping and disconnection of forwarding when some links fail,but multiple failure links may bring routing loop for the mechanism. Backtracking routing algorithm based on inverse shortest path tree rooted at destination is presented. The feasible restoration routing is obtained through searching from the start of the failure link and tracing back to the leaves of the shortest path tree with the destination as the root. The packets are forwarded from the mounted point with smaller sequence to the mount point with bigger sequence to decrease the possible of loop in case of multi-failures. The simulations and analysis indicate that backtracking routing algorithm improves the network survivability especially for large network,at the cost of the computation complexity in the same order as failure insensitive routing.  相似文献   

6.
The phase transition of spiral waves in networks of Hodgkin-Huxley neurons induced by channel noise is investigated in detail.All neurons in the networks are coupled with small-world connections,and the results are compared with the case for regular networks,in which all neurons are completely coupled with nearest-neighbor connections.A statistical variable is defined to study the collective behavior and phase transition of the spiral wave due to the channel noise and topology of the network.The effect of small-world connection networks is described by local regular networks and long-range connection with certain probability p.The numerical results confirm that (1) a stable rotating spiral wave can be developed and maintain robust with low p,where the breakup of the spiral wave and turbulence result from increasing the probability p to a certain threshold;(2) appropriate intensity of the optimized channel noise can develop a spiral wave among turbulent states in small-world connection networks of H-H neurons;and (3) regular connection networks are more robust to channel noise than small-world connection networks.A spiral wave in a small-world network encounters instability more easily as the membrane temperature is increased to a certain high threshold.  相似文献   

7.
In this paper,a dynamic flow-regulation algorithm-oriented network overload control is proposed.It can proportion-ally distribute the load between the high-degree nodes and the low-degree nodes.According to the theoretical analysis,the net-work transmission performance of the proposed algorithm is in inverse proportion to the usage rate of the high-degree nodes.Simulations show that the new algorithm is more flexible and can enhance the network capability in most circumstances compared with the shortest path routing algorithm.Moreover,the compari-son with the efficient routing algorism also reveals the prominent performance of the new algorithm.  相似文献   

8.
We investigate the problem of efficiently provisioning connections of arbitrary bandwidth granularities in integrated optical Internet model, and propose a novel dynamic weighted fair routing algorithm (DWFA) that employs QoS-aware flexible adaptive unified routing strategies according to the priority and granularity of the traffic connection request. Performance simulation results of DWFA show that our adaptive approach performs better in terms of traffic blocking ratio, traffic blocking fairness and traffic average logical hop counts than traditional overlay sequential routing scheme such as optical-layer-first routing (OFR) and electrical-layer-first routing (EFR). DWFA is very suitable for solving QoS-based multi-layer integrated routing (MLIR) problem in the next generation multi-granularity integrated optical Internet.  相似文献   

9.
A Network-Based VPN Architecture Using Virtual Routing   总被引:2,自引:0,他引:2  
A network based Virtual Private Network (VPN) architecture by using fundamental routing mechanism is proposed. This network is a virtual overlay network based on the relay of IP-in-IP tunneling of virtual routing modules. The packet format employs the encapsulation of IPSec ESP (Encapsulating Security Payload), an impact path code and an extended DS (Differentiated Services) code to support multi-path routing and QoS. Comparing with other models of VPN, this network system can be deployed in the current network with little investment, and it is easy to implement. The simulation result shows its performance is better than the traditional VPN system of black box mode.  相似文献   

10.
The intrinsic routing policy of NS2—a network simulation tool— based on flat or hierarchical address has the disadvantage such as small topology scale,high resource consumption,low efficiency and so on.This paper proposes an IP based hierarchical routing strategy in network simulation to extend the topology scale and improve performance in simulating.Firstly,a stratification mechanism to identify IP address of nodes is described.Then,an algorithm of packet transmitting method(PTM) is presented for packet forwarding in the same subnet.Finally,algorithms of region partition(RP),routing computation based on region division(RCBRD) and routing distribution(RD) is proposed to implement regional segmentation,route calculation and route distribution for forwarding packets in different subnets respectively.The experiment results show that under the same condition,compared with plane address,the topology scale of the network simulation is extended two times and the consumption of time and memory during simulation is reduced by approximately 73%and 45.8% respectively.Compared with hierarchical address,the topology scale of the network simulation is expanded by more than 50%,and the consumption of time and memory is reduced by about 59.2% and 25% respectively.In addition,along with the growth of the node size,the proportion of reducing total simulation time and memory consumption would gradually increase.  相似文献   

11.
提出了一种Ad Hoc网络混合式分簇路由算法。在分簇的基础上,簇内使用先验式路由,簇间使用反应式路由,充分利用了分簇结构的特点和优势,将分簇算法与路由算法有机结合,有效地提高了网络的路由发现效率。与AODV,DSR的仿真结果进行比较表明,该算法路由控制开销小,路由速度快,占用带宽少,健壮性好。  相似文献   

12.
提出了一种组合交换器——FC-Switch,定义了该组合交换器的交换级连接模式,初步分析了该组合交换器的性能.研究了FC-Switch的四种路由算法,并在“天河一号”(TH-1A)实际网络测试平台上,对这四种路由算法的性能进行了对比测试.研究结果表明,通过合理选择交换级连接模式和路由算法,FC-Switch可获得高带宽低延迟的优良性能.  相似文献   

13.
传统的无线移动自组网路由协议无法实现能量均衡消耗,也不能很好的适应网络拓扑动态变化,为此提出了一种新的基于能量高效与移动预测的按需路由算法。该路由算法在路由发现时排除不稳定链路,让能量较多的节点优先参与路由请求分组的转发,同时通过预测链路连接时间采用主动式局部路由修复策略,在路径实际失效之前就完成修复工作。仿真实验表明,和传统的AODV协议相比,文中提出的算法在路由控制开销略有增加的情况下,提高了分组平均投递率,降低了数据分组端到端平均时延,同时能够实现网络中的能量高效,延长了网络寿命,因此具有较强的实用性。  相似文献   

14.
In recent years, Software-Defined Networks(SDNs) have become a promising technology to improve network utilization. However, limited flow table size and long deployment delays may result in low network performance in large-scale networks and a poor user experience. While a typical solution to this issue is routing aggregation(i.e., wildcard routing), the aggregation feasibility problem and reduced network performance may be encountered. To address this dilemma, we first design a novel wildcard routing scheme, called the Tag-based Rule Placement Scheme(TRPS). We then formulate a Hybrid Routing by Joint optimization of Per-flow routing and Tagbased routing(HR-JPT) problem, and prove its NP-hardness. An algorithm with a bounded approximation factor is designed for this problem, and the proposed methods are implemented on a Mininet platform. Extensive simulation results show that our methods are efficient for wildcard/hybrid routing. For example, our proposed tag-based wildcard rule placement scheme can reduce the number of required rules by about 65% on average compared with previous wildcard routing methods. Our proposed hybrid routing algorithm can increase network throughput by about 43% compared with existing hybrid routing solutions.  相似文献   

15.
在无线传感网络中,路由选择是高效使用网络、延长全网络寿命的关键之一.为了提高网络效率和节省网络整体能耗,提出了一种路由选择优化算法,该算法利用没连接到的邻居节点进行数据路由选择,以减少从源节点到目的节点的跳数,进而达到提高网络效率和节省能耗的目的.通过仿真实验对比分析了改进前后的实际效果,实验结果表明改进后的路由选择优化算法减少了ZigBee节点间路由的跳数和延迟,提高了路由效率,节省网络整体能耗.  相似文献   

16.
针对HWMP( Hybrid Wireless Mesh Protocol) 协议域间移动性管理方案中全网广播PREQ( Path Request) 消 息和代理更新消息造成网络拥塞的问题,提出HWMP 协议主动路由模式下新增节点的路由更新算法。对于 PREQ 消息的发送做出一定限制,改进了HWMP 协议域间节点移动性管理机制,减少了全网路由更新数据包的 数量,降低了网络的端到端时延。仿真结果表明,与HWMP 协议中的方案相比,AHWMP( Advanced Hybrid Wireless Mesh Protocol) 方案在网络平均吞吐量、网络平均端到端时延等方面具有更好的效果。  相似文献   

17.
针对当前路由算法由于无线传感器网络节点分布不均匀、节点能耗过快等因素严重影响其生存时间的问题,提出一种传感器节点分簇与最佳距离相融合的无线传感器网络路由算法.该算法先模拟生物细胞的连接过程实现传感器网络节点的分簇,再权衡网络生存时间和能量消耗间的关系,根据簇首与基站间的距离确定数据路由的最优路径,最后采用MATLAB R2014b工具箱编程实现路由算法.将该算法与其他算法进行对比实验,结果表明,该算法可以延长整个传感器网络的生存时间,有效减少网络能耗,提高了能量的利用率.  相似文献   

18.
多跳协作中继网络的能量分配及路由算法   总被引:2,自引:1,他引:1  
为了减少无线多跳网络的能量消耗,提出了一种协作路由算法. 在传统非协作路由的基础上,通过译码-转发与放大-转发混合的协作中继方式减少路由长度. 根据信道状态信息,推导了满足源节点和目的节点之间信道容量的前提下,节点所需的最小发射功率. 结合功率分配,提出了基于路由最小功率的协作路由算法及实现方式. 仿真实验结果表明,该能量分配方式和路由选择算法在保持低功耗的同时,降低了数据误码率,提高了节点的通信可靠性和能量利用率.   相似文献   

19.
OLSR路由协议中,MPR节点的选择以连接度为参考标准.实际上,随着节点的增加和移动速度的加快,由于某些MPR节点的空闲度降低而造成节点拥塞加剧,降低了网络的性能.以节点空闲度和连接度均衡考虑对MPR选择算法做出改进研究.实验结果表明,改进后的OLSR路由协议在数据传输成功率与时延等方面都有显著提高.  相似文献   

20.
一种基于地理位置的无线传感器网络服务质量路由算法   总被引:1,自引:0,他引:1  
基于传感器节点的地理位置信息与网络传输路径的能耗模型分析,提出一种无线传感器网络服务质量(QoS)路由算法.将多跳传输路径中的转发节点序列控制在以源节点与汇聚节点连线的一定区域内,尽量拟合源节点与汇聚节点连线传输,有效控制了传输路径.并对QoS路由算法提出改进,转发节点根据当前实时QoS约束动态地调整传输区域的大小以及优化下一跳选择机制,使传输路径最大程度拟合源节点和汇聚节点之间的连线,达到路径传输能耗最优.仿真实验表明,该QoS路由算法在满足网络QoS约束的同时,节省了网络的能耗,延长了网络生存时间.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号