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

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

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

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

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

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

一种FDL和LRWC相结合的光分组交换网络的性能分析

研究了FDL和有限长波长转换器(LRWC)相结合的方法来解决异步变长的分组交换网中的冲突问题,对这种冲突解决方案建立了数学模型并进行了理论分析,提出了一个用于修正最佳延迟单元的公式,即在负载较大的情况下,我们要求延迟单元较小,这样可显著的降低在此交换网中的分组丢失率;对系统丢包率与负载、FDL数目和最佳延迟单元的关系进行了研究和讨论,结果表明:在同样的输入负载情况下,有限长波长转换器(LRWC)的引入可以降低缓存的数量;对延迟单元的修正可以大大降低丢包率,同时系统的性能较之单独使用FDL时有较大的改善。     

光传送网向光分组交换网演进的策略探讨

光分组交换(OPS)是分组交换技术向光层的渗透和延伸,OPS网是未来光网络中承栽话音和数据等多种业务的理想平台.受IP业务的拉动以及目前不断发展的光交换技术的推动,OPS网络必将有着非常广阔的应用前景.文章描述了OPS传送网的分层结构以及网络组成结构,给出了近期、中期和远期3个发展阶段OPS传送网的分层参考模型,基于该参考模型,探讨了现有光传送网在3个发展阶段向OPS传送网演进的策略.     

可用于光分组交换网的一种新型2×1节点接收机

提出了一种可用于光分组交换的2×1节点接收机,其特征在于,缓存是由前馈和反馈形式的光纤延迟线(FDLs)组合实现的。理论分析和仿真结果表明:当前馈和反馈形式的FDLs均可使用时,尽量使用前馈FDL的BCS控制策略更有利于改善接收机的分组丢弃性能,结构能很好地应用于突发业务和非突发业务环境,而且控制复杂度也较低。     

光分组交换网的TCP性能研究

与传统光网络相比,光分组交换(OPS)网络具有高速、大吞吐量、低时延和能高效地承载IP业务等突出优点.而作为支撑下一代Internet发展的最有希望的骨干光网络,OPS网与传输控制协议/互联网协议(TCP/IP)的兼容性和支持度是一个值得深入研究的课题.文章以光突发交换(OBS)网为模型,对OPS网络中的TCP传输性能进行了研究.     

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

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

OBS网络中QoS优先级保证方案研究

文章把信道分组和PPJET(Preemptive Prioritized Just Enough Time)协议以及光纤延时线三者结合使用,提出了一种新的QoS调度方案D-PPJET(Developed-PPJET)协议.在该协议下,高优先级数据包可以被动态地调度到任何可用的信道上去,而低优先级数据包只能在规定的部分信道上调度,并利用光纤延时线(FDL)缓存机制为未成功调度的突发包提供二次调度的机会,这样高优先级业务包调度成功的机会就大大增加,为高优先级业务提供了保证,同时还使得低优先级突发分组丢失率下降.结果表明它能够大大地改善整个网络突发包的丢失率、信道吞吐量及信道利用率.     

自适应弹性环光缓存结构设计及其网络性能分析

最大缓存时间限制、时延粒度限制、光分组长度限制3大限制因素,对传统光缓存器的前馈型和反馈型两种结构进行了分析。分析表明,影响光缓存器性能的3大限制因素在两种结构中的相互制约关系限制了光缓存器性能的进一步提高。在此基础上提出的一种自适应弹性环光缓存器(E-FLOB)结合了两种传统结构的优势,并分离了3大限制因素间的相互制约关系。结构分析显示,E-FLOB在缓存级数为16时可减少反馈型光缓存器噪声积累约3个数量级。网络性能仿真表明,弹性环结构比前馈型结构使用更少的缓存级数,获得比两种传统结构更低的分组丢失率。     

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.     

Routing Strategies to Minimize Packet Loss in an Optical Packet Switched Network 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. We study optical packet switches with recirculating fiber delay line (FDL) buffers. Through simulation, we have assessed the logical performance of a single optical packet router (OPR), focusing on packet loss rate (PLR). By verifying that our scheduling algorithm does not alter the traffic profile characteristics from in- to output, we illustrate how the single node results can be used to assess network-wide performance. We use the capability of assessing end-to-end PLRs to develop network-wide routing algorithms designed to minimize the maximal PLR occurring in the network. In case studies on pan-European networks, we first compare two algorithm variants and thereafter we compare the PLR-based routing algorithm with both load balancing and shortest path routing. While load balancing achieves PLRs that are multiple orders of magnitude lower than shortest path routing, the PLR-based algorithm can reach PLRs up to two orders of magnitude better. The improvement in PLR comes at the price of only a small increase in used bandwidth (a few percent). Subsequently we show that the discussed PLR-based routing algorithm can be easily extended to multiple priorities. By introducing multiple priorities we can keep the loss rates for high priority traffic very low. However, it may lead to an increase of the obtained minimal max-PLR value for low priority traffic. But as we prove this increase to be limited, the cost of introducing multiple priorities is small.     

Scheduling Algorithms for a Slotted Packet Switch with either Fixed or Variable Length Packets

We address the problem of congestion resolution in optical packet switching (OPS). We consider a fairly generic all-optical packet switch architecture with a feedback optical buffer constituted of fiber delay lines (FDL). Two alternatives of switching granularity are addressed for a switch operating in a slotted transfer mode: switching at the slot level (i.e., fixed length packets of a single slot) or at the burst level (variable length packets that are integer multiples of the slot length). For both cases, we show that in spite of the limited queuing resources, acceptable performance in terms of packet loss can be achieved for reasonable hardware resources with an appropriate design of the time/wavelength scheduling algorithms. Depending on the switching units (slots or bursts), an adapted scheduling algorithm needs to be deployed to exploit the bandwidth and buffer resources most efficiently.     

适用于Pbit/s光分组交换网络的丢包率下限模型

文章针对通过优化路由来改善光分组交换网络性能这一方法进行了深入地分析。文章认为在输出光缓存结构下可以计算出网络丢包率下限的理论模型,通过将该模型得到的丢包率下限与在已有路由算法下由仿真得到的丢包率进行比较,能够预测出最佳路由算法下的丢包率,从而进一步预测通过优化路由所能获得的最大性能提升。     

异步光分组交换的光电混合队列及调度

研究了以光纤延迟线作为主要的常规缓存,以电存储器作为辅助缓存的光电混合缓存的光电混合缓存结构,并用改进的FF-VF算法调度冲突的分组,达到改善长度可变光分组交换的分组丢失率目的.分析和仿真结果都表明,光电混合缓存和改进的FF-VF算法能改善可变长光分组交换在负载较高时的分组丢失率性能,并减少光纤延迟线的数目.     

光分组交换网络中光纤延迟线缓存技术

光分组交换网是全光网络发展的必然趋势.然而,光分组交换网络发展的瓶颈是光缓存技术.目前,在光域比较现实的还是采用光纤延迟线(FDL)作光缓存.重点研究了光纤延迟线光缓存技术,对FDL光缓存技术进行了深入的分析和归纳,并对每一种光纤延迟线光缓存调度策略的优缺点都进行了细致的分析.最后指出了光纤延迟线光缓存技术的未来研究重点和发展方向.     

A framework for fiber delay‐line buffers in packet‐based asynchronous multifiber optical networks (PAMFONET)

A major challenge in packet‐based optical networks is packet contention, which occurs when two or more packets are heading to the same output at the same time. To resolve contention in the optical domain, a fundamental approach is fiber delay‐line (FDL) buffering, in which packets can be delayed for a fixed amount of time. In the literature, the performance of FDL buffering has been studied extensively. However, most existing works are based on an assumption that there is only one fiber per link in the network. In this paper, we address the architecture and performance of FDL buffers in packet‐based asynchronous multifiber optical networks (PAMFONET), in which each link in the network may consist of multiple optical fibers. We propose a framework for FDL buffers in PAMFONET, in which we provide three essential architectures and corresponding packet scheduling policies. Extensive simulation results show that, with appropriate settings, the same number of FDLs can lead to better performance in multifiber networks than in single‐fiber networks. Copyright © 2011 John Wiley & Sons, Ltd.     

Buffering management schemes for optical variable length packets under limited packet sorting

This paper studies several buffering strategies for optical packet switching (OPS) under limited packet sorting. Three schemes, which are able to sort newly arrived packets based on packet’s length as well as capability of finding the minimum buffer occupancy, are analyzed and compared. Results show that all three proposed schemes could improve OPS performance considerably in terms of probability of packet loss (PPL) and probability of information loss (PIL). In addition, the simulation results show that not all the newly arrived packets need to be sorted in order to obtain minimum packet loss probability. Since the amount of packets and thus the packet processing time is significant in OPS, it is possible that not all the packets can be processed using one of the buffering strategies. An important finding of this paper is that if only 10% of the packets are sorted, the PPL is comparable to the minimum packet loss value obtained when 100% of the packets are sorted.