共查询到20条相似文献,搜索用时 111 毫秒
1.
2.
近年来,光纤传输技术的发展使网络传输带宽不断增长,特别是波分复用(WDM)技术的引入使电信运营商可以把他们的网络容量提高数十倍。新技术的使用为网络设计和规划提出新的课题,作者主要讨论骨干WDM传送网的规划方法。 相似文献
3.
生存性是WDM(波分复用)光网络的核心技术之一,对多播业务而言,IpC(智能P圈保护)是一种具有快速、高效等特点的保护算法。文章提出一种EIpC(增强型智能P圈)保护方案,包括分段和路径IpC算法,分段和路径IpC算法分别为每个分段和路径寻找新的P圈。理论分析和仿真结果表明,路径IpC在资源利用率、P圈构造个数以及圈平均覆盖度等方面最优,分段IpC次之,传统(链路)IpC最低。在先验效率方面,链路IpC最优,分段IpC次之,路径IpC最低。 相似文献
4.
波分复用技术(WDM)在主干传送网应用越来越普遍,WDM网络技术的研究也获得了迅速发展,综述了当前主干WDM网络的最新研究进展和发展趋势。 相似文献
5.
6.
7.
8.
9.
10.
针对如何选择一个优化的P圈来达到最小化空闲容量和较高的计算速度这个问题,提出了一种新的启发式算法HPS-RSC(迭代选择和简化一系列P圈),通过在EON和USA两种网络拓扑图中的仿真结果表明,这种新的算法使冗余度的范围控制在3.5%以内,并且在较大的网络中这种算法的优越性更加明显. 相似文献
11.
12.
Intelligent methods for automatic protection and restoration are critical in optical transport mesh networks. This paper discusses the problem of quality-of-service (QoS)-based protection in terms of the protection-switching time and availability for end-to-end lightpaths in a WDM mesh network. We analyze the backup lightpath-sharing problem in such networks and study the correlation of the working lightpaths and the impact of the correlation on the sharing of the backup lightpaths. We present a multi-protocol-label-switching (MPLS) control-based fully distributed algorithm to solve the protection problem. The proposed algorithm includes intelligent and automatic procedures to set up, take down, activate, restore, and manage backup lightpaths. It greatly reduces the required resources for protection by allowing the sharing of network resources by multiple backup lightpaths. At the same time, it guarantees, if possible, to satisfy the availability requirement even with resource sharing by taking the correlation of working lightpaths into consideration. A simple analysis of the proposed algorithm in terms of computation time and message complexity indicates that the implementation of the algorithm is practical. The illustrative studies that compare the performance of 1:1, unlimited sharing, and QoS-based backup sharing algorithms indicate that QoS-based sharing achieves comparable performance as unlimited sharing, which is much better than the 1:1 backup scheme in terms of connection blocking probability, average number of connections in the network for a given offered load, and network resource utilization. 相似文献
13.
在WDM网络中业务的带宽需求远低于一个波长所提供的带宽,业务量疏导可以聚集低速业务到大容量的光路中从而有效地利用波长带宽资源.目前大多数业务量疏导的研究限于环形网,考虑对WDM网状网中低速业务可靠疏导的文献更少.该文综合考虑WDM网状网生存性及业务量疏导,提出了基于波长分层图的共享保护业务量疏导算法(SPTG-LG,Shared Protection Traffic Grooming algorithm ba,sed on wavelength Layered-Graph),并对算法进行了仿真和分析. 相似文献
14.
15.
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. 相似文献
16.
该文研究了WDM网状网中双链路失效问题,在假定所有链路共享风险链路组(Share Risk Link Group, SRLG)分离的条件下,提出了一种动态共享路径保护(Dynamic Shared-Path Protection,DSPP)算法。DSPP能根据网络状态动态调整链路代价,为每条业务请求选择一条最小代价的工作路由和两条最小代价且SRLG分离的保护路由。仿真表明,DSPP不仅能完全保护双链路失效,并且能在资源利用率、阻塞率和保护切换时间之间进行性能折衷。 相似文献
17.
业务量疏导WDM网状网中的动态子通路保护算法 总被引:1,自引:0,他引:1
该文研究了业务量疏导WDM网状网中的生存性问题,提出一种自适应子通路保护(ASPP)算法。该算法根据网络当前状态以及到达业务连接请求的带宽要求动态调整链路权值;在此基础上选择一条最短路作为工作通路,然后将该通路分为互不重叠的n段子通路(每段经过的链路数为m),并分别找出各自的保护通路。仿真结果表明:ASPP既可以保证业务连接的可靠性要求,同时又允许网络管理者根据一定优化策略调整m值,从而可以在资源利用率和恢复时间之间进行折中。 相似文献
18.
19.
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. 相似文献