共查询到19条相似文献,搜索用时 140 毫秒
1.
2.
基于ANN的双重选路算法实现ATM路由选择 总被引:1,自引:0,他引:1
本文研究人工神经网络用于ATM网络路由选择问题.通过引入等效带宽的概念,利用Hopfield网络求解一般通信网路由选择的原理,求解ATM网络最优选路问题.本文以降低呼损率和运算复杂度为目标,提出双重选路算法,在运算复杂度和路由最优化之间取得折衷.计算机仿真结果表明,ATM双重选路算法有效降低了呼损率. 相似文献
3.
该文研究WDM网状网在软管(Hose)不确定业务量模型下的鲁棒抗毁问题,提出一种基于Valiant负载平衡(Valiant Load Balancing, VLB)以及共享保护机制的分段保护算法VLB-SSP (VLB-based Shared Segment Protection) 算法。该算法遵照共享保护的思想配置波长,并通过分割保护环的方式来满足恢复时间的要求。仿真表明,相对于专用通道VLB保护算法和均匀负载平衡保护方案,VLB-SSP算法不仅具有较小的全网代价,同时也提高了恢复的速度。 相似文献
4.
5.
6.
7.
研究了动态业务下,无波长变换的波分复用全光风采用固定选路时的波长分配问题,提出了一种中心式的波长分配算法-最小影响算法。该算法能精确地描述某个波长的分配对全网状态的影响,因而能够更有效地使用网络资源。计算机仿真表明,如果用阻塞概率来衡量,该波长分配算法优于文献中已有的典型算法。 相似文献
8.
9.
传统的量子通信网络采用空分机制,受链路中密钥分发率最低的链路限制。在大规模的量子通信网络中,链路资源浪费将更为显著,呼损率也很高。提出一种结合了分布式链路聚合算法和分布式业务聚合算法,可以支持多种业务,提供第三层路由功能以及服务质量保证的量子通信网络的路由策略。基于OPNET对呼损率的进行了仿真验证。结果表明,在保证安全性的同时可以提高瓶颈链路速率,降低系统呼损率,提高了服务质量。 相似文献
10.
11.
IP over WDM网络中一种新型虚拓扑构造算法 总被引:1,自引:0,他引:1
对IP over WDM的虚拓扑设计算法进行了研究,选择网络整体流量的均衡性作为优化目标,提出了一种新型的虚拓扑构造算法。在算法中,选择负载分布方差作为评价流量均衡性的指标,并给出其定义和计算方法。主要针对拥塞概率性能,在光层和IP层将提出的新型虚拓扑构造算法与其他算法进行比较。在光层的算法比较部分,选择负载均衡启发式路由算法(RLBH,routing with load balancing heuristics)与提出的算法进行比较;在IP层的算法比较部分,选择固定路径最小拥塞路由算法(FPLC,fixed-path least-congestion)与提出的算法进行比较,并对比较结果进行了讨论。比较结果显示在拥塞概率性能方面,提出的新型虚拓扑构造算法优于RLBH算法和FPLC算法。 相似文献
12.
为了解决虚拟光网络映射中带宽阻塞率较高以及底层资源消耗不均匀问题,论文提出一种基于时间域-频谱域碎片感知的虚拟网络映射(FA-VNM)算法。该文综合考虑频隙在时间域和频谱域上的碎片问题,设计时频联合碎片公式最小化分配过程中的频谱碎片。进一步,为了均衡网络中的资源消耗,在FA-VNM算法基础上提出基于节点度数的负载均衡感知虚拟网络映射(LB-VNM)算法,设计物理节点平均资源承载能力的公式,优先映射物理节点平均资源承载能力大的节点;为了均衡路径上资源使用,考虑路径权重值,并根据每条路径的权重值对虚拟链路进行映射,从而降低阻塞率。仿真结果表明,所提算法能有效降低阻塞率,提高资源利用率。 相似文献
13.
在超密集异构无线网络中,针对城区交通高峰期,大规模车载终端短时间聚集性移动引起的网络拥塞问题,该文提出一种考虑负载均衡和用户体验(LBUE)的垂直切换算法。首先,引入网络环境感知模型预测网络未来的拥塞程度,并提出一个融合自组织网络的网络架构,缓解网络拥塞。其次,定义业务适应度和负收益因子,并提出一种基于秩和比(RSR)的自适应切换判决算法,为用户筛选出当前环境下满意度最高的目标网络。实验结果表明,该算法能够有效降低终端接入网络的阻塞率和掉话率,实现网络间负载均衡并提升用户体验。 相似文献
14.
部分共享波长转换光网络动态路由的改进算法 总被引:4,自引:4,他引:0
提出了一种应用于部分共享波长转换(PWC)的波长路由光网络(WRON)中的基于节点阻塞的动态路由算法,它不需要共享复杂的波长转换信息,而是将各节点的阻塞特性考虑到路由过程中。为评价算法性能,在14节点的国家科学基金网(NSFNET)拓扑中进行了仿真。结果表明,新的路由算法显著改善了网络的阻塞性能和建路失败的概率,尤其是随着网络负载的降低,网络性能的改善更显著。 相似文献
15.
在大型复杂软件定义网络中,为提高网络负载均衡,减少控制器与交换机间的传播时延,该文提出一种基于效率区间的负载均衡在线优化算法。在初始静态网络中,通过贪心算法选择初始控制器集合,并以其为根节点构建M棵改进代价的最小生成树(MST),确定初始M个负载均衡的子网;当网络流量发生变化时,通过广度优先搜索(BFS)调整子网间交换机映射关系使其满足效率区间,保证任意时刻网络的负载均衡。算法均以网络连通性为基础,且均以传播时延为目标重新更新控制器集合。仿真实验表明,该算法在保证任意时刻网络负载均衡的同时,可以保证较低的传播时延,与Pareto模拟退火算法、改进的K-Means算法等相比,可以使网络负载均衡情况平均提高40.65%。 相似文献
16.
In this paper, a new hierarchical multihop routing algorithm and its performance evaluation is presented for fully dynamic wireless networks. The routing algorithm operates on a virtual topology obtained by partitioning the routing information for mobile terminals and mobile base stations into a hierarchical, distributed database. Based on the virtual topology, each mobile base station stores a fraction of the routing information to balance the complexity of the location-update and the path-finding operations. Mobility of the network entities changes the load distribution and causes processing and memory bottlenecks in some parts of the network. However, since the network routing elements are also mobile, their movement can be used to distribute the load. Thus, new load balancing schemes are intoduced to distribute the routing overhead uniformly among the mobile base stations. The performance of the hierarchical multihop routing algorithm is investigated through simulations. It is shown that the routing protocol can cope with high mobility and deliver packets to the destinations successfully. 相似文献
17.
An efficient dynamic distributed optical link establish method in intelligent all-optical networks 总被引:1,自引:0,他引:1
In this article, an efficient, fast, and dynamic distributed optical link setup method is proposed. Two kinds of novel optical
fast link release mechanisms (Ahead and Timeout Release) are presented for an optical-link establishment. They can dramatically
reduce the blocking probability. For dynamic routing detection, a new kind of dynamic weighted Dijkstra algorithm (DW-DA)
along with dynamic optical link load balancing is described. A variable mutation and crossover rates of a genetic algorithm
(VMCR-GA) is used for fast wavelength assignment with two-novel-wavelength assignment rules in a wavelength relationship graph,
which can reduce the necessary wavelengths and link establishment time. Through simulation giving the blocking probability
and the time for link establishment on several well-known networks, the effectiveness of this method has been verified. The
blocking probability of the network can be reduced significantly below that of normal routing and wavelength assignment (RWA).
Furthermore, the calculating time for reaching the minimum blocking probability can be reduced dramatically.
相似文献
Jun HeEmail: |
18.
19.
Load balancing is an important problem for structured peer-to-peer systems. We are particularly interested in the consumption of network bandwidth for routing traffic and in the usage of computer resources for object storage. In this paper, we investigate the possibility to simultaneously balance these two types of load. We present a structured peer-to-peer overlay that efficiently performs such simultaneous load balancing. The overlay is constructed by partitioning the nodes of a de Bruijn graph and by allocating the partitions to the peers. Peers balance network bandwidth consumption by repartitioning the nodes. Balancing of computer resources for storage is enabled by dissociating the actual storage location of an object from the location of its search key. The paper presents and analyzes the protocols required to maintain the overlay structure and perform load balancing. We demonstrate their efficiency by simulation. We also compare our proposed overlay network with other approaches. 相似文献