共查询到18条相似文献,搜索用时 171 毫秒
1.
2.
3.
4.
波分复用(WDM)技术的开发和应用使得网络中的信息容量得到了极大的提高,而网络中业务信息的多样化则促进了多播技术的应用和发展。多播的出现使网络的节点结构、虚拟拓扑连接方式及路由和流量疏导算法变得更加复杂多样。为此对光网络中各种多播方式及节点结构并对现有的路由和波长分配算法进行了评述。在此基础上提出了对这类光网络中的信息流量进行疏导时应遵循的几个基本原则,目的是提高波长容量的利用率,减少网络中所用的波长和分插复用器(ADM)数,降低网络的成本和费用。 相似文献
5.
在WDM网络中业务的带宽需求远低于一个波长所提供的带宽,业务量疏导可以聚集低速业务到大容量的光路中从而有效地利用波长带宽资源.目前大多数业务量疏导的研究限于环形网,考虑对WDM网状网中低速业务可靠疏导的文献更少.该文综合考虑WDM网状网生存性及业务量疏导,提出了基于波长分层图的共享保护业务量疏导算法(SPTG-LG,Shared Protection Traffic Grooming algorithm ba,sed on wavelength Layered-Graph),并对算法进行了仿真和分析. 相似文献
6.
7.
8.
针对节点功能不同光网络中的路由与波长分配问题,建立了一种具有节点功能区分的波分复用器(WDM)多波长光网络模型,根据节点功能将其分为A,B两类,并提出了波长等价弧、等价网络,以及等价多播树等概念.在此基础上基于节点功能区分的WDM光网络的特点和相应的路由和波长分配策略,提出了一种如何在此类WDM光网络中实现多播连接的快速有效的算法,分析了算法计算复杂度,指出了算法的优缺点. 相似文献
9.
10.
11.
光网络中基于组播树的静态业务疏导算法 总被引:2,自引:1,他引:1
为了减少波分复用(WDM)网络中波长资源消耗,将组播路由算法的思想运用于静态业务疏导的计算,通过建立业务疏导树来实现静态业务疏导.为了减少疏导树的数量,从而减少网络中波长资源的消耗,将节点间的业务请求分组归并,利用装包算法使业务分组的数量最少,并通过构建最小生成树实现传输路径共享.仿真结果表明,本文的算法可以有效地减少... 相似文献
12.
13.
为了解决波分复用(WDM)网状网络中的动态流量疏导问题,基于收发器节约辅助图模型,提出了一种资源效率疏导策略.它同时考虑收发器和波长链路两种网络资源的有效利用,根据当前的网络状态动态改变疏导策略,使网络不会由于某一种资源的缺乏而导致阻塞所有流量,避免了另一种资源因富余而造成的浪费,从而两种资源都能得到充分利用.在辅助图模型中,根据两种资源的可用数目比值,对各条边设置不同的权值函数,可轻易地实现该策略.仿真结果证明,不管是收发器资源受限还是波长资源受限,该策略都能取得较好的性能,降低了网络的阻塞率. 相似文献
14.
In this article, we consider the problem of traffic grooming in optical wavelength division multiplexed (WDM) mesh networks under static traffic conditions. The objective of this work is to minimize the network cost and in particular, the electronic port costs incurred for meeting a given performance objective. In earlier work, we have shown the benefits of limited grooming switch architectures, where only a subset of wavelengths in a network are equipped with expensive SONET Add Drop Multiplexers (SADM) that provide the grooming functionality. In this work, we also consider the wavelength conversion capability of such groomers. This can be achieved using a digital cross-connect (DCS) in the grooming switch to switch low-speed connections between the SADMs (and hence, between wavelengths). The grooming switch thus avoids the need for expensive optical wavelength converters. Based on these observations, we propose a limited conversion-based grooming architecture for optical WDM mesh networks. The local ports at every node in this architecture can be one of three types: an add-drop port, a grooming port that allows wavelength conversion or a grooming port that does not allow wavelength conversion. The problem studied is: given a static traffic model, where should the different ports be placed in a network? We formulate this as an optimization problem using an Integer Linear Programing (ILP) and present numerical results for the same. We also present a heuristic-based approach to solve the problem for larger networks. 相似文献
15.
为了解决WDM网状网络中的静态流量疏导问题,基于收发器节约辅助图模型,该文提出了一种最少费用疏导策略。它同时考虑收发器和波长链路两种网络资源的费用,为每条流量计算出一条费用最少的路径,以获得网络总费用最少的解决方案。根据两种资源费用的比值关系,给辅助图中的每条边分配不同的权值,使得路径的总权值最小代表了该路径的费用最少,从而就能够轻易地实现该策略。仿真结果证明,不管两种资源的费用比值如何变化,该策略的网络总费用始终是最少的。 相似文献
16.
Huan-Lin Liu Xiang Xue Yong Chen Qiang Fang Sheng Huang 《Photonic Network Communications》2013,26(2-3):95-102
With the growth of multi-granularity multicast applications, there comes into being a huge gap between the bandwidth of a wavelength provided and a multicast traffic required in the wavelength division multiplexing (WDM) networks. The dynamic multicast traffic-grooming is an effective way for WDM networks to improve the wavelength utilization and decrease the traffic blocking probability. A novel switching node architecture with the multicast switching matrix and traffic-grooming fabric is studied in the paper. Then, an efficient dynamic multicast traffic-grooming algorithm is proposed for the architecture. According to the ratio of network available grooming port number to network transceiver number, the proposed algorithm estimates whether the traffic-grooming port is a scarce resource for input traffic and chooses the appropriate grooming strategy. If the traffic-grooming port is scarce, the minimized use grooming port strategy is designed for the coming traffic. On the contrary, the minimized use node transceiver strategy is applied for the coming traffic. Simulation results show that the proposed algorithm can groom traffic efficiently with low blocking probability and high network throughput constraint by limiting number of node transceivers and grooming ports. 相似文献
17.
18.
To make dynamic traffic grooming faster and more efficient,and achieve an intelligent differentiated protection,a differentiated protection strategy with dynamic traffic grooming based on clustering(DPS-DTGC)was proposed.The whole network topology was allocated some clusters based on maximal independent set,in order to reduce the routing time consumption.Meanwhile,by the cooperation of layered auxiliary graph,residual capacity matrix and cluster aggregation layer,the traffic in inter- and intra- clusters would been groomed to realize the reasonable planning of resources and the higher efficiency of grooming.Furthermore,according to the proportion of different priority traffic in one wavelength ,the link importance was evaluated and a smart P-cycle was designed to give differentiated protection to the link.The simulation results show this strategy can make a better utilization of network resource.And with the increase of network load,it will gain a good performance in blocking rate. 相似文献