共查询到20条相似文献,搜索用时 46 毫秒
1.
波分复用系统加密技术研究 总被引:2,自引:0,他引:2
波分复用系统是将多个独立的光波耦合复用到一根光纤中传输,从而更有效地提供带宽,让IP、ATM、SDH等数据通过统一的光纤层传输的系统。波分复用系统在改善网络性能的同时,也给网络的安全带来了一定的隐患。文中针对波分复用(WDM)自身特点及所面临的安全威胁,提出基于WDM的加密技术研究思路,为实现对WDM/OTN/ASON网络综合数据业务的安全保密奠定了基础。 相似文献
2.
WDM (WavelengthDivisionMultiplexing ,波分复用 )系统的应用使得大容量的业务日益集中于同一系统内 ,这同时提高了对网络自愈性能的要求 ,从而导致各种自愈技术的发展。因为光器件具有高速交换的优点 ,因而从光层对业务恢复具有极大的优越性。文中主要分析了几种典型的光层的自愈方法 相似文献
3.
本文介绍光网络的组成以及和电网络的联系,重点介绍了波分复用光纤网络的特点,通过选择光波长实现光交换的原理、WDM星形和环形光网络的构成等。 相似文献
4.
5.
6.
第一章 光波分复用系统的基本原理 总被引:3,自引:0,他引:3
介绍光波分复用系统的基本原理。分别介绍光波分复用器、掺饵光纤放大器;光波分复用技术的主要优点、协调要点;光通路的波长分配、目标传输距离和光缆传输衰减、波长转换器、光监控通路及每信道最小发送功率等光波分复用系统五大主要参数的选择考虑。 相似文献
8.
随着波分复用技术在传输网络上的进一步应用,波分复用系统的测试技术变得十分重要,探讨波分复用系统实际富余度及光通道代价的测试方法及相应问题。 相似文献
9.
10.
光开关是当今密集波分复用光通信网络中的关键器件,目前已成为研制开发的热点。文中介绍了几种主要的热门光开关结构及其最新进展情况。 相似文献
11.
In this letter, we study the protection problem in wavelength division multiplexing (WDM) optical networks, and propose a novel dynamic heuristic algorithm called differentiated reliable segment protection (DRSP). Differing from previous work, DRSP can effectively avoid the trap problem and is able to find a feasible solution for each connection request. Therefore, DRSP outperforms the previous work. Simulation results have shown to be promising. 相似文献
12.
13.
Wavelength division multiplexed (WDM) networks are matured to provide, scalable data centric infrastructure, capable of delivering flexible, value added, high speed and high bandwidth services directly from the optical (WDM) layer. But, providing fault-tolerance at an acceptable level of overhead in these networks has become a critical problem. This is due to the size of the current and future networks and diverse quality of service (QoS) requirements for multimedia and mission critical applications. Several distributed real-time applications require communication services with fault-tolerance apart from guaranteed timeliness at acceptable levels of overhead. Several methods exist in the literature which attempt to guarantee recovery in a timely and resource efficient manner. These methods are centered around a priori reservation of network resources called spare resources along a protection path. This protection path is usually routed from source to destination along a totally link disjoint path from primary path. This paper considers the problem of routing and wavelength assignment (RWA) in wavelength routed WDM optical networks. In particular, we propose an efficient algorithm to select routes and wavelengths to establish dependable connections (D-connections), called segmented protection paths. Our algorithm does not insist on the existence of totally disjoint paths to provide full protection. We present experimental results which suggest that our scheme is attractive enough in terms of average call acceptance ratio, spare wavelength utilization, and number of requests that can be satisfied for a given number of wavelengths assuming that the requests come one at time, and wavelengths are assigned according to fixed ordering. Furthermore, the results suggest that our scheme is practically applicable for medium and large sized networks, which improves number of requests that can be satisfied and helps in providing better QoS guarantees such as bounded failure recovery time and propagation delays without any compromise on the level of fault-tolerance for a given number of wavelengths and fibers. We conduct extensive simulation experiments to evaluate the effectiveness of the proposed scheme on different networks and compare with existing methods.This work was supported by the Department of Science and Technology, New Delhi, India. An earlier version of this paper was presented at Opticomm 2002 conference, July 29-August 2, Boston, USA. 相似文献
14.
15.
This paper investigates the problem of protecting multicast sessions in mesh wavelength‐division multiplexing (WDM) networks against single link failures, for example, a fiber cut in optical networks. First, we study the two characteristics of multicast sessions in mesh WDM networks with sparse light splitter configuration. Traditionally, a multicast tree does not contain any circles, and the first characteristic is that a multicast tree has better performance if it contains some circles. Note that a multicast tree has several branches. If a path is added between the leave nodes on different branches, the segment between them on the multicast tree is protected. Based the two characteristics, the survivable multicast sessions routing problem is formulated into an Integer Linear Programming (ILP). Then, a heuristic algorithm, named the adaptive shared segment protection (ASSP) algorithm, is proposed for multicast sessions. The ASSP algorithm need not previously identify the segments for a multicast tree. The segments are determined during the algorithm process. Comparisons are made between the ASSP and two other reported schemes, link disjoint trees (LDT) and shared disjoint paths (SDP), in terms of blocking probability and resource cost on CERNET and USNET topologies. Simulations show that the ASSP algorithm has better performance than other existing schemes. 相似文献
16.
17.
刘祺 《电信工程技术与标准化》2004,(6):50-53
光突发交换拥有光电路交换和光分组交换两种方式的主要特征,是未来光网络的一种有希望的实现形式,本文对wDM光突发交换网络的实现做了简要的介绍,主要从wDM光突发交换网络的生存性出发对相关问题进行了分析研究,并提出了相应的解决方案. 相似文献
18.
19.
波分复用技术(WDM)在主干传送网应用越来越普遍,WDM网络技术的研究也获得了迅速发展,综述了当前主干WDM网络的最新研究进展和发展趋势。 相似文献
20.
This paper studies the performance of various strategies for scheduling a combined load of unicast and multicast traffic in a broadcast WDM network. The performance measure of interest is schedule length, which directly affects both aggregate network throughput and average packet delay. Three different scheduling strategies are presented, namely: separate scheduling of unicast and multicast traffic, treating multicast traffic as a number of unicast messages, and treating unicast traffic as multicasts of size one. A lower bound on the schedule length for each strategy is first obtained. Subsequently, the strategies are compared against each other using extensive simulation experiments in order to establish the regions of operation, in terms of a number of relevant system parameters, for which each strategy performs best. Our main conclusions are as follows. Multicast traffic can be treated as unicast traffic, by replicating all multicast packets, under very limited circumstances. On the other hand, treating unicast traffic as a special case of multicast traffic with a group of size 1, produces short schedules in most cases. Alternatively, scheduling and transmitting each traffic component separately is also a good choice. 相似文献