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

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

一种基于负载选择的光分组交换缓存结构

提出了一种基于业务负载选择的光分组交换(OPS)网络的光缓存结构,根据业务负载大小灵活选择缓存方式。输出缓存光纤延迟线(FDL)采用分段式共享机制配置,输出/反馈共享缓存模块采用简并式配置,以提高有限数目FDL的利用率。分析和仿真表明,这种可选择的缓存结构可以有效降低丢包率和OPS节点需求的FDL数目。     

共享有限范围多波长和全单波长转换器的光组播冲突解决方案

研究了一种有限范围多波长转换器(LMWC)反馈共享连接和全单波长转换器(FRWC)输出共享连接相结合的解决全光组播波长资源竞争的解决方案,并提出有限范围多波长转换器优先的波长变换调度算法,以最大双向匹配最小边长权重方法选择多波长转换器解决冲突光组播波长变换。仿真结果表明:所提的结构与输出共享全多波长转换器(FMWC)节点结构或输出共享FRWC节点结构相比,都能够明显降低光组播节点的分组丢包率(PLP),减少系统需求LM-WC多波长转换器的数目,提高多波长转换器的利用率;LMWC具有不同波长转换范围对光分组冲突解决性能也有影响。     

混合缓存型异步光分组交换的一种改进FF-VF算法

光纤延迟线（FDL）是异步光分组交换（OPS）采用的时域冲突解决方案,通过计算其分组丢失率（PLR）发现,在业务负载高,特别是业务负载大于0．7时,PLR性能较差。研究以FDL作为主要的常规缓存、以电存储器作为辅助缓存的光电混合缓存结构,并用改进的首选即中的填空（IFF-VF）算法调度冲突的分组,达到改善可变长OPS的PLR目的。分析和仿真结果表明,光电混合缓存和IFF-VF算法能改善可变长OPS在负载较高时的PLR性能,并减少FDL的数目。     

一种用于光组播冲突解决的节点结构及其调度策略

光分组在核心节点处的冲突解决问题是实现全光 组播分组交换的关键。本文提出了一种新型的解决光组播冲突的节 点结构,用于冲突解决的部分包括输出共享的网络编码模块和光纤延迟线(FDL)环 形反馈共享缓存(FDL-LSFB)模块。网络编码 模块将异或网络编码作为冲突解决方式,利用全光异或门将冲突组播进行网络编码并且改变 编码后分组波长,从而避免波长 冲突。而FDL-LSFB模块由子交换矩阵和FDL缓存组连接成环状,且冲突组 播可从任意子交换矩阵进出缓存模块, 使用少数的FDL可以提供大容量的光缓存、提高FDL利用率。针对FDL-LSFB模块冲突组播调 度问题,为减小缓存时延,设计了最小缓存长度级联控制算法(MLCBST),进而提出冲突光 组播的总调度策略。仿真结果表明,本文提出的组播节点结构和调度策略在降低丢包率(PLP)和减小缓存时延方面具有明显的效果。     

FDL结构竞争解决的研究

使用光纤延时线（FDL）来解决光分组交换中的竞争问题,研究系统丢包率、时延与输入端口数、输出端口数、FDL数之间的关系,并比较输入端口优先、FDL优先、输入端口和FDL优先级的三种光分组调度策略。结果表明：适当减少端口数,增大FDL数目可以使丢包率趋近于零;而适当增大端口数,减小FDL数目又可以使时延减小。因此,在使用FDL解决竞争冲突时,端口数和FDL数目的选择很重要,它们之间的关系大小直接影响到丢包率和时延的大小。     

基于优先级的OBS核心节点性能研究

设计了基于业务优先级的光突发交换核心节点模型,采用多级光纤延迟线的光缓存来提高交换网络的性能.交换节点在4个端口8条波长(4×8核心交换结构)的情况下,当光纤延迟线基本延迟单元为50μs、级数为8,负载为0.8时,丢包率小于0.01;为了满足不同业务服务质量的要求,将数据包按优先级划分,采用基于优先级的插空算法(VFPP),在相同缓存配置条件下使高优先级数据的丢包率降低到以下,在高负载下平均时延小于不区分优先级的情况.     

4端口8波长光突发交换网络设计

设计了4端口8波长光突发交换(OBS)网络实验系统,其包括1个核心交换节点、4个边缘节点和密集波分复用(DWDM)传输系统。在传输系统中,突发包(BPs)传输波长信道使用1 550 nm波段,而突发包头(BHPs)传输波长信道采用1310 nm波段。在核心交换节点,交换矩阵由8个4×4光开关组成,并运用光纤延迟线(FDL)解决OBS的拥塞。实验结果表明,该设计是成功的,且FDL能够降低核心节点的丢包率。     

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

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

异步光分组交换的缓存排序方案及性能

分析了简单的先到先服务(FCFS)光纤延迟线(FDL)循环占用方案性能,发现其分组丢失率(PLR)较高,提出3种输入分组按长度排序,寻找最小的FDL缓存优化分配方案.分析和仿真结果表明:约10%的分组排序后使3种方案都大大地能减小PLR,最小长度分组占用最小可用FDL缓存方案的性能最好.业务负载低于0.8时,排序的缓存方案对管理有限的FDL是有效的.     

一种新颖的全光分组交换节点结构及其性能分析

本文提出了一种共享波长转换器和光纤延迟线的全光分组交换结构,与传统的设计方法和实验报道相比,该结构提供了更灵活的冲突解决措施.为了获得与在交换系统输入级分别为每个波长信道提供波长转换器相等价的性能,本文给出了交换结构最多所需的转换器数量.仿真结果表明,本文结构是兼顾交换系统体积、成本和性能等三方面较理想的折衷方案.研究还表明,光纤数与每纤的波长数量之积愈大,本文结构所节约的转换器和延迟线数量将愈加可观.     

基于时频二维竞争解决机制的光数据包交换节点性能分析

针对光数据包交换的应用需求,提出了基于时频二维竞争解决机制的光数据包交换节点结构,建立了该节点基于排队论的丢包率分析模型,分析讨论了光交换节点竞争解决机制对丢包率的影响。输出端口归一化负载为0.8时,时频二维竞争解决机制在8波复用和8根延迟线结构下使丢包率降低至约10-7。数值分析结果表明,高端口负载下增加复用波长个数对减小端口丢包率比较有效,低端口负载下增加FDL延迟线数量对减小端口丢包率比较有效。     

Blocking and Delay Analysis of Single Wavelength Optical Buffer With General Packet Size Distribution

Buffers are essential components of any packet switch for resolving contentions among arriving packets. Currently, optical buffers are composed of fiber delay lines (FDL), whose blocking and delay behavior differ drastically from that of conventional RAM at least two-fold: 1) only multiples of discrete time delays can be offered to arriving packets; 2) a packet must be dropped if the maximum delay provided by optical buffer is not sufficient to avoid contention, this property is called balking. As a result, optical buffers only have finite time resolution, which may lead to excess load and prolong the packet delay. In this paper, a novel queueing model of optical buffer is proposed, and the closed-form expressions of blocking probability and mean delay are derived to explore the tradeoff between buffer performance and system parameters, such as the length of the optical buffer, the time granularity of FDLs, and to evaluate the overall impact of packet length distribution on the buffer performance.     

An analytical model for all-optical packet switching networks with finite FDL buffers

Signal loss and noise accumulation can cause fading in optical buffers implemented by fiber delay lines (FDLs). Optical packets that excessively recirculate through FDLs are easily dropped from their routing paths. Therefore, analytical models and packet scheduling schemes require additional considerations for FDL buffers. This work proposes an analytical model for all-optical packet switching networks with finite FDL buffers and a general class of scheduling schemes including many basic scheduling schemes. We intend to minimize the packet loss probability by ranking packets to achieve an optimal balance between latency and residual lifetime in the general class of scheduling schemes. The analytical model is based on a non-homogeneous Markovian analysis to study the effects of various scheduling schemes on packet loss probability and average latency. Analytical results show how various network parameters affect the optimal balance, and illustrate how properly balancing latency and residual distance can significantly improve network performance.     

时隙可变长分组缓存调度算法

提出了一种采用时隙处理光分组竞争冲突的基于光纤延迟线的光分组交换缓存算法——时隙可变长分组缓存调度算法SVPB(slotted variable-length-packet-capable buffer)。该算法根据先到先服务的排队原则,通过对到来的光分组进行时间轴分段处理,解决了FDLs作为缓存器的不足。从仿真结果得到,在网络负载较高时所提出的调度算法SVPB比已有的调度算法分组丢失率有明显的降低。     

A latency-aware scheduling algorithm for all-optical packet switching networks with FDL buffers

Optical buffers implemented by fiber delay lines (FDLs) have a volatile nature due to signal loss and noise accumulation. Packets suffer from excessive recirculation through FDLs, and they may be dropped eventually in their routing paths. Because of this, packet scheduling becomes more difficult in FDL buffers than in RAM buffers, and requires additional design considerations for reducing packet loss. We propose a latency-aware scheduling scheme and an analytical model for all-optical packet switching networks with FDL buffers. The latency-aware scheduling scheme is intended to minimize the packet loss rate of the networks by ranking packets in the optimal balance between latency and residual distance. The analytical model is based on non-homogeneous Markovian analysis to study the effect of the proposed scheduling scheme on packet loss rate and average delay. Furthermore, our numerical results show how various network parameters affect the optimal balance. We demonstrate quantitatively how to achieve the proper balance between latency and residual distance so that the network performance can be improved significantly. For instance, we find that under a given latency limit and light traffic load our scheduling scheme achieves a packet loss rate 71% lower than a scheduling scheme that ranks packets simply based on latency.     

OBS核心节点中FDL配置方式的研究

通过仿真,分析比较了在N×M交换节点中的分别采用共享式FDLs结构和非共享式FDLs结构的交换性能.结果表明,在负载为0.7、非共享式FDLs在级数大于24时,其丢包率小于10-6.而共享式FDLs在级数为24时,其丢包率大于0.1.非共享式FDLs的丢包率和平均时延水平都低于共享式的FDLs结构,交换性能更优异.     

光分组交换网络的冲突解决：用光纤延迟线还是波长转换器

该文研究了光分组网络的冲突处理问题,提出了两种异于传统设计方法的交换结构。研究表明:对于非突发性业务,非简并排列方式的光纤延迟线是成本最低的解决手段;而对于突发业务,将波长转换器和延迟线结合使用是兼顾分组丢弃性能,系统体积和成本的较好策略,文中基于此给出了系统设计原则,该原则可确保系统节约大量的波长转换器和延迟线,对改善系统的整体性能十分有利。     

A Totally Shared Optical Packet Switch: Dimensioning, Control Algorithm and Performance

In this paper, a novel optical packet switch is proposed, which uses a set of shared fiber delay lines (FDLs) and a set of shared tunable wavelength converters (TWCs) to resolve optical packet contentions. In addition, two control algorithms, i.e., Fiber-First (FF) and Wavelength-First (WF), are proposed to schedule optical packets. Performance of the novel switch is evaluated by means of simulation experiments. Simulation results show that based on either of these two control algorithms, the switch can achieve super performance without employing a lot of FDLs and TWCs. Moreover, the performance of FF and WF is compared. Detail analyses are also given in this paper.