光突发交换网络新型偏射路由方案研究

光突发交换(OBS)被认为是下一代光网络中的有效核心交换技术之一,设计OBS网络的最初目的之一是减小突发包丢失率.解决突发竞争的方法主要包括光缓存、波长变换、偏射路由和突发分段.提出一种改进偏射路由方案,并建立了数学模型,对改进方案的性能进行了仿真分析,结果表明改进方案能更好的提高网络整体性能.     

光突发交换网络中冲突解决方法研究

光突发交换（OBS）网络被认为是下一代光因特网的典型代表,其中,光突发数据包在节点的竞争问题是OBS网络中需要解决的关键问题之一。该文重点研究了突发数据包之间因争夺链路资源而导致冲突的四种竞争解决方案：波长转换、光缓存、偏射路由和突发包分割,并分析了它们的优缺点。在此基础上,提出了OBS网络中冲突解决方法的发展趋势——...     

OBS网突发包竞争问题的解决方案

光突发交换(OBS)是近几年出现的一种很有前途的新型光交换技术。由突发包之问竞争所导致的数据丢失是光突发交换网络所面临的一个重要问题，它影响到光突发交换能否走向实用化。为此提出了一种用于解决突发包之间竞争钧综合方案，并对它的性能进行了仿真研究。仿真结果表明，该方案可以大幅度地降低OBS网络中的数据丢失事。     

OBS网络中冲突解决方法研究

在OBS网络中,当两个或多个突发包要求在同一时刻,同一输出端口的同一波长上预留资源时．就会产生突发数据包的资源竞争。如何解决资源竞争问题是OBS技术能否最终走向实际应用的关键技术之一。文章首先介绍OBS的基本原理、网络结构、OBS网络的资源预约机制、边缘路由器的封装机制和资源调度机制,接着研究解决OBS网络中突发数据包之间争夺链路资源问题的竞争解决机制,随后详细的给出四种竞争解决方案：光缓存、波长转换、偏射路由和突发分段丢弃,并分析了它们的性能。在此基础上,文章最后提出了各种资源竞争解决方案相结合的联合解决机制的思想。     

光突发交换网络中基于突发包分段的联合冲突解决方法研究

光突发交换(OBS)技术由于结合了电的灵活处理和光的高速传输,成为构建下一代全光互联干线网最具前景的交换方式,其单向资源预留方式导致的突发包冲突是限制OBS走向实用的关键。基于突发包分段的光缓存冲突解决方法和基于突发包分段的波长转换冲突解决方法,首先通过对低优先级突发包进行分段解决冲突,然后对分段后冲突部分突发包进行光缓存或波长转换降低丢包率。对基于突发包分段的光缓存和基于突发包分段的波长转换两种冲突解决机制的性能进行了比较研究,仿真结果显示:两种机制都能够有效地降低整个网络的丢包率。当网络负荷较高时,采用基于突发包分段的光缓存方法对降低突发包的丢失率效果比较明显;当网络负荷较低时,采用基于突发包分段的波长转换方法能够更加有效地降低突发包的丢失率。     

OBS网络中基于优先级的先分割后缓存冲突解决方法

为了有效地降低突发包的丢失率和保证OBS网络中不同优先级业务的服务质量,提出了一种基于优先级的先分割后缓存冲突解决方法。该方法通过在多波长信道系统的输出数据信道上设置光纤延迟线组来缓存被分割的冲突突发包。当冲突发生时,首先基于突发包的优先级和处理完毕时间进行"竞争突发包头部分割或者原突发包尾部分割"处理;无冲突部分进行交换或者直接在事先预留的输出数据信道上处理,冲突部分的分割突发包进行光缓存。仿真结果表明,多波长信道系统中,高优先级突发包的丢失率低于低优先级突发包的丢失率。同时该方法在一定程度上可以有效地减少端到端的传输时延和整个网络的丢包率,从而提高整个OBS网络的性能。     

OBS网络中一种新型的避免冲突方法

突发包冲突在无光缓存能力的光突发交换(OBS)网络中是一个尚未解决的问题.在对JET协议进行改进的基础上,文章首次提出了一种新型的突发包冲突解决方案,分析了其可行性及相对传统算法的优势.     

OBS网络中的回退竞争解决机制研究

综述了光突发交换(OBS)网络中突发包竞争产生的原因及现有几种解决方案,分析了它们各自的优缺点.提出了具有回退竞争解决功能的OBS网络核心节点功能结构及新的回退信道划分方法,并将突发包优先级运用到回退竞争解决方案中.分析结果表明运用该方法可明显降低丢包率,增大网络吞吐量.     

解决光突发交换网竞争的新机制

文章提出了一种用于解决光突发交换(OBS)网中突发包之间竞争的新方案,并对它的性能进行了仿真研究。仿真结果表明,该方案可以大幅度降低OBS网络中的数据丢失率。     

OBS环网竞争解决办法的分析和比较

在光突发交换(OBS)基本概念的基础上,针对OBS网络,特别是OBS环网突发包竞争引起的突发包丢包等问题,介绍和比较了OBS网络中常用的突发包竞争解决办法.重点分析了几种适用于OBS环网的常用突发包竞争解决办法对网络吞吐量等主要性能的影响,指出了采用这几种竞争解决办法的网络的性能优劣,归纳总结了它们的优缺点.     

Performance of fiber delay‐line buffers in asynchronous packet‐based optical switching networks with wavelength conversion

A major challenge in asynchronous packet‐based optical networks is packet contention, which occurs when two or more packets head to the same output at the same time. To resolve contention in the optical domain, two primary approaches are wavelength conversion and fiber delay line (FDL) buffering. In wavelength conversion, a contending packet can be converted from one wavelength to another in order to avoid conflict. In FDL buffering, contending packets can be delayed for a fixed amount of time. While the performance of wavelength conversion and FDL buffering has been evaluated extensively in synchronous networks with fixed‐sized packets, in this paper, we study the performance of FDL buffers in asynchronous packet‐based optical networks with wavelength conversion. An analytical model is proposed to evaluate the performance in terms of packet loss probability and average delay. Extensive simulation and analytical results show that, with appropriate settings, FDL buffers can perform much better in switches with wavelength conversion than in switches with no conversion. Copyright © 2014 John Wiley & Sons, Ltd.     

Optimized Combination of Converter Pools and FDL Buffers for Contention Resolution in Optical Burst Switching

Optical burst switching (OBS) has attracted interest as a transport network architecture for the future optical Internet. As OBS relies on statistical multiplexing efficient contention resolution is a key issue in order to achieve a low burst loss probability. First, this paper discusses options and key design parameters for contention resolution in OBS. Then, it evaluates the performance of OBS nodes which employ shared wavelength converter pools and simple fiber delay line (FDL) buffers. Finally, optimized strategies for the order of probing a wavelength converter pool and an FDL buffer for contention resolution are presented and compared. It is shown that these strategies can be used to optimize performance for a given, for example, minimal cost, dimensioning of the wavelength converter pool and the FDL buffer.     

Contention resolution and QoS provisioning using sparse fiber delay lines in WDM networks

In this paper, we combine fiber delay lines (FDL) and optical wavelength conversion (OWC) as the solution for the burst contention problem in optical burst switching (OBS). We present a placement algorithm, k-WDS, for the sparse placement of FDLs at a set of selected nodes in the network. The algorithm can handle both uniform and non-uniform traffic patterns. Our extensive performance tests show that k-WDS provides more efficient placement of optical fiber delay lines than the well-known approach of placing the resources at nodes with the highest experienced burst loss. Performance results are also given to compare the benefit of using FDLs alone, OWCs alone, as well as a mixture of both FDLs and OWCs. A new algorithm, A-WDS, for the placement of an arbitrary numbers of FDLs and OWCs is presented and evaluated under different uniform and non-uniform traffic loads using network simulation of the NSFNET topology and randomly generated graphs. The paper is concluded by presenting the design of a cost-effective optical switch equipped with variable-delay FDL bank. Based on the switch design, a scheme to provide differentiated services for multiple classes of traffic is presented and evaluated.     

Analytical MMAP-Based Bounds for Packet Loss in Optical Packet Switching with Recirculating FDL Buffers

The major goal of optical packet switching (OPS) is to match switching technology to the huge capacities provided by (D)WDM. A crucial issue in packet switched networks is the avoidance of packet losses stemming from contention. In OPS, contention can be solved using a combination of exploitation of the wavelength domain (through wavelength conversion) and buffering. To provide optical buffering, fiber delay lines (FDLs) are used. In this paper, we focus on an optical packet switch with recirculating FDL buffers and wavelength converters. We introduce the Markovian arrival process with marked transitions (MMAP), which has very desirable properties as a traffic model for OPS performance assessment. Using this model, we determine lower and upper bounds for the packet loss rate (PLR) achieved by the aforementioned switch. The calculation of the PLR bounds through matrix analytical methods is repeated for a wide range of traffic conditions, including highly non-uniform traffic, both in space (i.e., packet destinations) and time (bursty traffic). The quality of these bounds is verified through comparison with simulation results.     

Parallel link server architecture: a novel contention avoidance mechanism in OBS networks

Optical burst switching (OBS) is thought to be the best way to adapt bursty traffic of IP-based next generation network services. However, there are a lot of challenges to make OBS networking a reality. Of most concern is burst contention avoidance. The major contention avoidance resolutions in literature are wavelength conversion, fiber delay lines, and deflecting routing. They are very vulnerable to network load and may suffer from severe data loss in case of heavy traffic. Even at moderate traffic, contention caused by using these methods lead to burst blocking and data losses. In this article, a novel contention avoidance technique is presented by using the parallel link server (PLS) architecture, which may overcome the lack of information at the edge node and the absence of global coordination among nodes. Using Poisson and Self-Similar traffic arrival models, the proposed mechanism is compared with the traditional single link server architecture through simulation in the 14-node national science foundation network. The numerical results show that this architecture, without additional other methods, can obtain burst blocking and data dropping probabilities with almost two orders of magnitudes less than those in the single link server architecture. Gains are achieved by less than 7% increase in end-to-end delay when carrying coordinated traffic and a load under 0.45.     

基于偏转路由与COCP的OBS网络竞争解决机制

主要研究解决光突发交换(OBS)网中突发数据包之间争夺链路资源问题的竞争解决机制.从时间域、波长域和空间域上探讨了解决冲突的方法,并给出了一种采用偏转路由机制和基于共享功能波长转换器的冲突部分转换方法(COCP)相结合的竞争解决方法.     

基于共享有限波长和参量波长转换器的冲突解决方案

研究了一种共享有限波长转换器(LRWC)和参量波长转换器(PWC)相结合的解决全光分组波长资源竞争的方案,并提出了PWC优先算法作为光分组交换中的波长竞争解决方案。仿真结果表明:本文结构与共享LRWC节点结构相比,减少了波长转换器的数目,并且能够明显降低光分组交换节点的分组丢包率(PLP),提高波长转换器的利用率。研究还发现,不同波长转换器配置方案对系统性能有影响。     

Buffered time-wavelength cross-connects: Architectures and performance evaluation

An all-optical approach to reduce the speed mismatch between electronic sources and high-speed wavelength channels is to time-division multiplex low-capacity circuits onto each wavelength. In such a Time-Wavelength-Switched Network (TWSN), the optical crossconnects (OXCs) are configured to switch time-wavelength-slots within the network. The OXCs can be deployed with a bank of fiber delay lines (FDLs) to improve the connection slot scheduling and decrease the connection blocking probability. In this paper, we consider the two broad scenarios of sharing a bank of FDLs: shared per output link (SPL) and shared per crossconnect (SPC). We present several OXC architectures and develop graph formulations that can be used to optimally solve the scheduling problem. We also incorporate wavelength conversion and feedback in these architectures and study the impact of various FDL configurations on a crossconnect’s performance. Results using numerical simulations show that the FDL configuration does in fact affect the performance of the OXC. We also evaluate the performance of an OXC equipped with an FDL bank for both the SPL and SPC scenarios by considering sparse wavelength converters (limited number of full range wavelength converters). Results show that using sparse converters along with FDLs could provide significant benefits.     

基于BD技术的光突发竞争解决方案

将BD法结合波长资源预留算法提出一种新的突发竞争解决方案。该方案通过在突发竞争时牺牲低优先级突发的传输完整性,以保证高优先级的业务的丢失率,同时降低了传输时延。最后对基于BD法的突发竞争解决方案进行了网络仿真,并和传统的传统基于额外偏置时间(JET)的方案比较,结果表明在平均数据丢失率相当的前提下,改进的BD法能有效的降低突发包的端对端时延。