有限波长转换能力的OBS网波长分配算法研究

结合国内外最新的研究动态,针对有限波长转换能力的光突发交换网中亟待解决的突发包资源竞争问题,探讨了各种传统的波长分配算法,并通过对其特点的分析和综合比较,提出了一种新的适合有限波长转换能力光突发交换网特点的动态波长分配算法,此算法可以实现更低的全网突发包阻塞率.     

有限波长转换的OBS竞争解决机制探讨

对下一代光互联干线网最有前景的交换方式,光突发交换的现状及未来商用化的挑战进行了简单介绍,针对有限波长转换能力的光突发结构进行了深入的网络分析和建模,并从全网预先的资源规划方面,提出了竞争解决方案的初步设想和今后工作的重点.     

一种波长转换受限WDM网络的动态路由和波长分配算法

本文基于分层图模型,提出了在节点波长转换范围受限和波长转换器数目受限情况下,解决WDM网络的动态路由和波长分配问题的一种算法.通过计算机仿真,研究了本算法的性能以及这两种波长转换受限情况对网络阻塞率的影响.     

一种新的应用于光突发交换网络保证流量均衡的波长调度算法

在现有波长调度方法(LAUC_VF)的基础上,结合跳数优先级技术和动态资源分配技术,提出了一种新的可以提供流量均衡的波长调度算法(HP_JET)。通过仿真,证明这种波长调度算法在改善全网阻塞率以及均衡流量方面比原有的波长调度算法有更好的性能。     

波长路由光突发交换及其关键技术

首先介绍了OBS的概念,并讨论了OBS关键技术——竞争问题。然后描述WROBS技术特点,并分析了其优势和存在的问题,最后讨论了WROBS的应用并对其进行了总结。     

OBS中基于分割和波长转换的冲突解决机制

提出了一种"先分割后波长转换"的冲突解决机制。当冲突发生时,首先对低优先级突发包进行分割;不冲突部分直接在事先预留的输出数据信道上处理,冲突部分通过WC转换到空闲的波长信道上。仿真结果表明,高优先级突发包的丢失率比低优先级的要低,并且各优先级突发包的丢失率随核心节点WC转换度的增加而降低。     

光突发交换网络中的偏射路由算法

首先对偏射路由算法的基本概念、竞争解决机制及其优缺点进行了论述,针对其存在的缺陷详细分析了两种改进的偏射路由算法,重点研究了改进的偏射路由算法的实现机制,并对今后偏射路由算法的研究重点和发展趋势表达了作者的观点。     

一种波长转换范围受限全光网中的波长分配算法

本文研究了波长转换范围受限全光网中的动态路由和波长分配问题,提出了一种固定备选路由条件下新的路由和波长分配算法.算法引入了波长相关性的概念,用波长关联权值定量描述了各路由的前后链路上不同波长之间的相互依赖关系.在建立连接时首先使用那些依赖性强,对其他路由影响小的波长,从全局的角度出发选择最优的路由和波长分配方案.计算机仿真表明,本文算法能够适用于稀疏网络和网状网,在均匀业务强度或者大部分业务量来自于长跳路由的情况下,本文算法能够显著降低网络阻塞概率和使用的波长转换器数目,有效提高系统性能.     

波长路由网络选路时的光信号质量限制研究

光网络中,路由与波长分配(RWA)算法是最优化网络性能的核心问题之一,传统的RWA算法都假设光网络的物理层状态是理想的,即不存在光信号传输损伤的问题.通过对这个缺陷的分析,将光信号的传输损伤问题充分考虑到路由与波长分配算法中,从算法的角度来实现对光信号的传输保护,这样做不仅能有效防止业务的物理损伤阻塞,还能极大地提高光网络的性能.     

SPN波长转换竞争解决的研究

对光分组交换中节点共享(SPN)的结构进行了理论分析,推导出SPN系统的丢包率公式,并对系统丢包率与负载、输入光纤端口数和每纤波长数的关系进行了数值计算。结果表明:当共享波长转换器的数目从0开始增加时,首先改善的是低负载的丢包率,当低负载的丢包率接近极限后,开始明显改善中负载的丢包率,最后改善高负载的丢包率。     

Analysis of OBS Networks With Limited Wavelength Conversion

Presented herein is a scalable framework for estimating path blocking probabilities in optical burst switched (OBS) networks where limited wavelength conversion is possible. Although presented under the guise of OBS, it is pertinent to a broader class of optical networks based on the principle of bufferless unacknowledged switching. By applying the framework to the NSFNET topology, it is shown that even the most limited conversion range may reduce path blocking probabilities by several orders of magnitude, compared with no wavelength conversion. Moreover, contrary to previous results derived for all-optical non-OBS networks with acknowledgement, OBS with full wavelength conversion achieves significantly lower blocking probabilities than OBS with limited wavelength conversion when the conversion range is small. Underpinning the framework is a generalization of the classical reduced load approximation. Assuming links evolve independently of each other allows decoupling of the network into its constituent links. A set of fixed-point equations describing the evolution of each conversion range are then solved by successive substitution to estimate link blocking probabilities. Having these link blocking probabilities, path blocking probabilities are evaluated. The complexity of the framework is dominated by the wavelength conversion range and is independent of the number of wavelengths per link under certain symmetry conditions. Both just-in-time (JIT) and just-enough-time (JET) scheduling are considered. Simulations are implemented to corroborate the accuracy of the framework.     

基于竞争控制的光突发交换条件偏射路由算法

光突发交换(OBS)网络中,偏射路由算法是有效地解决突发竞争、提高网络性能的一种重要措施,但通过分析发现,它可能会导致偏射路由上正常(非偏射)突发的丢失率上升.提出了一种基于竞争控制的条件偏射路由算法,根据定义的偏射条件检测函数,有条件的偏射或丢弃竞争突发来保证偏射路由上正常突发的QoS.仿真表明该算法可以很好地控制偏射突发对网络偏射路由上正常流量的影响.     

Performance of Adaptive Routing in Wavelength-Routed Networks with Wavelength Conversion Capability

This paper concerns itself with the performance of adaptive routing in wavelength-routed networks with wavelength conversion capability. Exploiting the concept of load balancing, we propose an adaptive weighted-shortest-cost-path (WSCP) routing strategy. The salient feature of WSCP is that it seeks the path that minimizes the resource cost while simultaneously maintaining the traffic load among the links as balanced as possible. In our simulation, we compare the blocking probability, average hops and link utilization of WSCP with traditional shortest-cost-path (SCP) strategy, fixed routing and alternate routing. The numerical results show that WSCP can enhance blocking performance and just lengthen hop distances a little longer. The improvement is more significant in denser networks or with more wavelengths. We also develop an analytical model to estimate blocking performance of WSCP and compare analyses with simulations. Because of the benefit from load balancing, the proposed WSCP strategy can be used as a path selection algorithm in traffic engineering.     

A Virtual Wavelength Translation Scheme for Routing in All-Optical Networks

This paper considers wavelength routed WDM networks where multiple fibers are used for each communication link. For such networks, the effect of wavelength translation can be achieved without explicit use of wavelength translators. We call this as virtual wavelength translation and study the routing issues considering dynamic lightpath allocation. Using multiple (or a bundle of) fibers for each link also allows us to have bundles of varying sizes to accommodate anticipated differences in traffic through different communication links of the network. The paper considers the blocking probabilities of all-optical networks when centralized and distributed lightpath allocation schemes are used.     

Optimal Multicast Routing and Wavelength Assignment on WDM Ring Networks Without Wavelength Conversion

We consider the multicast routing and wavelength assignment (MC-RWA) problem on WDM bidirectional ring networks without wavelength conversion. We give an integer programming formulation of the problem and propose an algorithm to solve it optimally. The algorithm is based on column generation and branch-and-price. We test the proposed algorithm on randomly generated data and the test results show that the algorithm gives optimal solutions to all of the test problems.     

一种基于门限的光突发交换受限偏射路由算法

提出了一种基于突发丢失门限的条件偏射路由算法（LDFD），该算法采用丢弃少量偏射的高优先级突发来保证偏射路由上较低优先级非偏射突发的服务质量（QoS）。当偏射的高优先级突发到达核心节点而该节点没有空闲数据信道时，就启用定义的偏射条件检测函数来判断是丢弃该突发还是允许其抢占非偏射的低优先级突发的资源，从而减少偏射突发与偏射路由上原有突发的竞争。仿真表明，该算法可以很好地控制偏射突发对偏射路由上正常流量的影响，并有效地提高整个网络的突发丢失性能。     

A Limited Deflection Routing Algorithm Based on Burst Loss Threshold in OBS Networks

1 Introduction The increase in the demand of transport capacity duetothe explosive growth of the Internet IP-based traffichas fueled the development of high-speed transmissionsystems andthe emergence of Wavelength Division Mul-tiplexing ( WDM) technology[1].Soin the near future ,it will be possible to support hundreds of wavelengths ofseveral Gigabit/s each. A new approach called OpticalBurst Switching (OBS)[2]that combines the best of op-tical circuit switching and optical packet switch…     

基于边缘节点波长调度方案的应用研究

给出一种较容易实现的波长调度方案,介绍了该方案中各部分的功能及相关的信息处理流程,并对几个关键问题进行了探讨。     

Scalability of Wavelength Division Multiplexed Optical Passive Star Networks with Range Limited Tunable Transceivers

The number of stations attached to a single optical passive star is limited by current state of the art in optical technology. Also, the wavelength range of tunable optical transceivers is limited by current technology. Many high performance computing applications require the use of large size regular topologies for communication between computing nodes. Scalability of passive star networks built with these two limitations becomes an important issue for building larger networks. This is the subject of our study in this paper. In a previous related work we explored the design issues for networks built on a single passive star employing transceivers of a limited tuning range. Here we extend that study by considering the problem of connecting several optical passive stars, each embedded with a given virtual topology, to create larger aggregate networks. The design issues are analyzed and a number of design rules are proposed for building such aggregate networks. We study the scalability of embedded optical passive stars by considering the most commonly employed virtual topologies—complete graph, mesh and hypercube.