共查询到17条相似文献,搜索用时 93 毫秒
1.
2.
该文研究WDM网状网在软管(Hose)不确定业务量模型下的鲁棒抗毁问题,提出一种基于Valiant负载平衡(Valiant Load Balancing, VLB)以及共享保护机制的分段保护算法VLB-SSP (VLB-based Shared Segment Protection) 算法。该算法遵照共享保护的思想配置波长,并通过分割保护环的方式来满足恢复时间的要求。仿真表明,相对于专用通道VLB保护算法和均匀负载平衡保护方案,VLB-SSP算法不仅具有较小的全网代价,同时也提高了恢复的速度。 相似文献
3.
4.
在WDM网络中业务的带宽需求远低于一个波长所提供的带宽,业务量疏导可以聚集低速业务到大容量的光路中从而有效地利用波长带宽资源.目前大多数业务量疏导的研究限于环形网,考虑对WDM网状网中低速业务可靠疏导的文献更少.该文综合考虑WDM网状网生存性及业务量疏导,提出了基于波长分层图的共享保护业务量疏导算法(SPTG-LG,Shared Protection Traffic Grooming algorithm ba,sed on wavelength Layered-Graph),并对算法进行了仿真和分析. 相似文献
5.
6.
7.
提出了一个改进的稀疏分光器配置约束下的改进算法。在稀疏分光器配置约柬下,多播路由不再是图论中“树”的形状,多播路由可能存在逻辑圈。现有的多播路由算法没有考虑这个特点,对此算法作了一下改进,通过仿真证明改进算法提高了网络性能。 相似文献
8.
提出了一个改进的稀疏分光器配置约束下的改进算法。在稀疏分光器配置约束下,多播路由不再是图论中”树”的形状,多播路由可能存在逻辑圈。现有的多播路由算法没有考虑这个特点,改进对此算法作了一下改进,通过仿真证明改进算法提高了网络性能。 相似文献
9.
本文研究了网状WDM网中的SRLG(Shared Risk Link Groups:共享风险链路组)分离约束下的静态共享通路保护设计问题-给定网络物理拓扑、业务量需求矩阵和工作路由,为每个波长需求确定保护路由,使得所需的备份资源最小.这个问题可以用整数线形规划公式来描述.由于这是一个NP-C问题,因此,本文提出一种启发式算法MSC(Maximally Share the Capacity)加以解决,该算法的核心思想是改变链路权重使得保护路由之间尽量共享资源.仿真结果表明,本文算法能有效地降低所需的备份资源,提高了网络的资源利用率. 相似文献
10.
11.
In this paper, we investigate the problem of dynamically establishing dependable connections in wavelength division multiplexing (WDM) mesh networks with traffic-grooming capabilities. We first develop a new wavelength-plane graph (WPG) to represent the current state of the network. We then propose a dynamic shared sub-path protection (SSPP) scheme based on this WPG. To establish a dependable connection, SSPP first searches a primary path for each connection request, and then it segments the found path into several equal-length sub-paths, and computes their corresponding backup paths, respectively. If two sub-paths in SSPP are fiber-disjoint then their backup paths can share backup resources to obtain optimal spare capacity. Based on dynamic traffic with different load, the performance of SSPP has been investigated via simulations. The results show that SSPP can make the tradeoffs between resource utilization and restoration time. 相似文献
12.
This paper studies a traffic grooming in wavelength-division multiplexing (WDM) mesh networks for the SONET/SDH streams requested between node pairs. The traffic could be groomed at the access node before converting to an optical signal carried in the all-optical network. We design a virtual topology with a given physical topology to satisfy multiple objectives and constraints. The grooming problem of a static demand is considered as an optimization problem. The traditional algorithms found in the literatures mostly focus on a single objective either to maximize the performance or to minimize the cost. We propose a multi-objective evolutionary algorithm to solve a grooming problem that optimizes multiple objectives all together at the same time. In this paper we consider the optimization of three objectives: maximize the traffic throughput, minimize the number of transceivers, and minimize the average propagation delay or average hop counts. The simulation results show that our approach is superior to an existing heuristic approaches in an acceptable running time. 相似文献
13.
该文研究了WDM网状网中双链路失效问题,在假定所有链路共享风险链路组(Share Risk Link Group, SRLG)分离的条件下,提出了一种动态共享路径保护(Dynamic Shared-Path Protection,DSPP)算法。DSPP能根据网络状态动态调整链路代价,为每条业务请求选择一条最小代价的工作路由和两条最小代价且SRLG分离的保护路由。仿真表明,DSPP不仅能完全保护双链路失效,并且能在资源利用率、阻塞率和保护切换时间之间进行性能折衷。 相似文献
14.
Dynamic Survivability in WDM Mesh Networks Under Dynamic Traffic 总被引:3,自引:0,他引:3
Network survivability is a crucial requirement in WDM mesh networks. In this paper, we systematically consider the problem of dynamic survivability with dynamic single link failure in WDM networks under dynamic traffic demands. Specifically, we investigate various protection schemes, such as dedicated path protection (DPP), shared path protection (SPP), dedicated link protection (DLP), shared link protection (SLP), and two restoration schemes, path restoration (PR) and link restoration (LR). Moreover, two new shared protection methods are proposed, i.e., SRLG-based shared link protection (SRLG-SLP) and SRLG-based shared path protection (SRLG-SPP). The SRLG (shared risk link group) constraint defines the availability of protection resources to a working path, which requires that any two working paths sharing the same risk of failure (or in the same SRLG) cannot share the same protection resources. Furthermore, in our study, we consider a more practical dynamic single-link failure model, in which the link-failure-interarrival time and link-failure-holding time are considered as two independent parameters. Based on this link-failure model, extensive simulations are done to analyze and compare the dynamic survivable performance of various protection and restoration schemes. Resource utilization, protection efficiency, restoration efficiency, and service disruption ratio are employed as survivable performance metrics versus traffic load, link-failure frequency, and link-failure reparation time to evaluate the survivable performance. Many meaningful results are given. In addition, we show that the developed SRLG-SLP and SRLG-SPP protection schemes perform very well in terms of protection efficiency and service disruption ratio, while sacrificing some performance in terms of resource utilization. 相似文献
15.
16.
Grooming of Arbitrary Traffic in Optical WDM Mesh Networks Using a Genetic Algorithm 总被引:1,自引:0,他引:1
In this paper, a genetic algorithm is proposed for grooming of arbitrary traffic in optical mesh networks. Traffic streams are routed in the wavelength division multiplexing (WDM) grooming networks that comprise both fiber links and established lightpaths. Chromosomes are split into multiple versions when multiple shortest routes are found. The selection strategy is based on a comparison between chromosomes. A variety of cost functions are proposed for the routing algorithm and two comparison methods are considered in the selection procedure. Computer simulations are performed with randomly generated traffic patterns. The results show that the algorithm is effective for traffic grooming (TG) problems, and also for routing and wavelength assignment problems. 相似文献