光突发交换中交换矩阵配置时间的影响研究

光突发交换是近几年出现的一种很有前途的交换技术。在光突发交换网络的核心节点中,光交换矩阵是一个关键部件,其配置时间影响到光突发交换网络的性能。这种影响表现在对数据信道可用时间施加了限制。在考虑光交换矩阵配置时间的基础上给出了修正后的LAUC算法,并通过计算机仿真研究了这种配置时间对光突发交换性能的影响。结果表明,光交换矩阵配置时间的增大会导致输出数据信道利用率的降低,进而增大了数据丢失率。     

一种新的光突发交换网络信令协议与分析

提出了一种新的光突发交换网络信令协议,即DSH区分服务混合信令.根据实时（电路仿真）业务和非实时（数据）业务对QoS的不同要求分别采用TAW和JET信令控制协议,尤其是对TAW信令做了相应改进,使之更适合于OBS网络承载电路仿真业务.利用电路仿真业务发出的呼叫请求,在端到端的波长通道中建立虚通路,并在整个呼叫持续过程中保持虚通路的连接,这样可以保证电路仿真业务的端到端时延最小并避免信息丢失.通过理论分析和系统仿真,研究了DSH混合信令的性能及其对波长利用率和实时业务呼损率的影响.     

一种新颖的光突发交换网络中高效传输实时业务的协议

提出一种光突发交换网络中高效传输低速实时业务的虚时分复用协议(VTDM_RT).该协议的特点是信道不划分固定时隙,实时业务请求寻找空闲位置周期性占用信道,核心结点无须缓存,按照约定周期性转发实时业务数据.理论近似分析和仿真表明,该协议可以有效降低实时业务呼损率和数据丢弃率;实时业务速率越低,呼损率越低,波长利用率越高.     

光突发交换网络中基于LDPC码的丢包恢复机制(英文)

基于前向纠错编码理论,在光突发交换网络中提出一种丢包恢复机制来降低突发丢失率.构造了一种能对突发包进行在线编解码的低密度奇偶校验码.入口边缘节点通过对信息突发包进行在线编码产生冗余突发包,出口边缘节点利用译码算法从接收到的突发包中恢复出丢失的突发数据.另外,为信息突发包增加一个额外的偏置时间以减少冗余突发与信息突发竞争信道资源.通过OPNET仿真软件对不同丢包恢复机制的性能进行仿真,结果表明,与奇偶校验码提出的丢包恢复机制相比,具有更低的突发丢失率和良好的丢包恢复能力.     

基于GMPLS的光突发交换网络传输性能分析

针对基于多协议标记交换的光突发交换网络在组网过程中存在传输性能劣化的问题,采用最坏值的方法,从典型光交叉节点的串扰特性入手,分析推导了网络中多个节点级联后同频串扰对传输性能的影响,并通过仿真进行验证.分析结果表明,核心节点级联产生的串扰累积是导致该网络传输性能劣化的重要因素.     

光突发交换的交换控制策略和光缓存配置

光突发交换是面向下一代互联网的光交换模式.讨论了异步光突发交换系统的交换控制策略以及相应光缓存的优化配置策略.除了传统预约模式的交换策略,还研究了非预约和改进型预约模式,它们的性能评估由计算机仿真给出.结果表明:在条件相当情况下,改进型预约模式具有最低的丢包率.同时光缓存的配置对上述几类交换控制策略的性能都有很大影响,仿真结果指出:光缓存的粒度对系统性能具有重要影响,所讨论的几类交换模式都存在最佳时延粒度,研究结果对光交换矩阵的设计有指导意义.     

一种光突发交换网络中降低填充开销的突发组装算法(英文)

针对光突发交换(OBS)网络现有组装算法在输入业务量较小时组装填充开销较大的性能缺陷,提出了一种新的突发组装算法,称之为BPRA算法.该组装算法通过改变突发生成时间,在不增加端到端时延的条件下利用偏置时间来延长突发组装时间,从而可以有效降低填充空闲比特的数目.同时提出一个近似分析模型来计算空闲比特填充概率.分析和仿真结果表明BPRA算法可以明显降低组装填充开销.     

一种光突发交换网络中降低填充开销的突发组装算法

针对光突发交换（0BS）网络现有组装算法在输入业务量较小时组装填充开销较大的性能缺陷，提出了一种新的突发组装算法，称之为BPRA算法．该组装算法通过改变突发生成时间，在不增加端到端时延的条件下利用偏置时间来延长突发组装时间，从而可以有效降低填充空闲比特的数目．同时提出一个近似分析模型来计算空闲比特填充概率．分析和仿真结果表明BPRA算法可以明显降低组装填充开销．     

有优先权的光突发交换中光缓存的性能分析

分析了配置有限数量光纤时延线(FDLs)和优先权机制的光突发交换(pOBS)网络性能,建立了pOBS的网络模型和排队模型;并以模型为基础,比较了各级别数据包的排队等延时与FDLs单位、负荷强度比例的关系;比较了有和无FDLs时,包丢失率与FDLs单位、FDLs深度、系统负荷强度以及波长数的关系.研究发现;高优先级数据包的平均延时远小于其它数据包,负荷强度越大平均延时也越大,高优先级数据包的比例越大则低优先级数据包的延时越大且丢失率越高,加入有限数量和适当深度的FDLs、减小FDLs最小单位、增加波长数都能减小数据包的平均排队延时和丢失率.     

光突发交换网络试验平台

研究并实现了几种光突发交换网络的关键技术,包括高速的突发组装技术、突发调度技术及突发光发射及接收技术等,其中突发接收具有较高的灵敏度和小于80 ns的时钟数据恢复时间.在这些技术的基础上,建立了一个灵活且可扩展的光突发交换网络实验平台.在OBS网络平台上进行了TCP性能评估实验和多QoS业务传输实验。实验结果表明光突发网络中丢包率严重影响其上TCP的性能,但若丢包率小于0.1%,则TCP性能可得到一定程度的保证.光突发交换网络实验平台上的TCP传输实验还表明了OBS物理层带来的额外延时对上层TCP带宽有极大的影响.实验结果还验证了OBS网络中的QoS保证机制.     

A novel scheme based on minimum delay at the edges for optical burst switching networks

This paper proposes a novel scheme based on minimum delay at the edges (MDE) for optical burst switching (OBS) networks. This scheme is designed to overcome the long delay at the edge nodes of OBS networks. The MDE scheme features simultaneous burst assembly, channel scheduling, and pre-transmission of control packet. It also features estimated setup and explicit release (ESXR) signaling protocol. The MDE scheme can minimize the delay at the edge nodes for data packets, and improve the end-to-end latency performance for OBS networks. In addition, comparing with the conventional scheme, the performances of the MDE scheme are analyzed in this paper.     

Performance enhancement of optical burst switched networks

Optical burst switching (OBS) is an optical switching paradigm which offers a good tradeoff between the traditional optical circuit switching (OCS) and optical packet switching (OPS) since it has the relatively easy implementation of the first and the efficient bandwidth utilization of the second. Hence, OBS is a promising technology for the next generation optical Internet. A buffer-less OBS network can be implemented using ordinary optical communication equipment without the need for either wavelength converters or optical memories. In an OBS network, burst-loss performance is a critical concern. In OBS, the data-burst transmission is delayed by an offset time (relative to its burst control packet (BCP), or header) and the burst follows its header without waiting for an acknowledgment for resource reservation. Thus, a burst may be lost at an intermediate node due to contention, which is generally resolved according to the local routing and bandwidth information. The routing table maintained in each OBS node is generally pre-computed and fixed to forward the data bursts. Such a static forwarding feature might have limited efficiency to resolve contentions. Moreover, a burst may be lost and the network may be congested when a network element (e.g., fiber link) fails. In this paper, an efficient integrated scheme based on dynamic routing and burst segmentation has been proposed to improve reliability of data transport and network load balancing in optical burst switched networks. Simulation results demonstrate that the proposed approach reduces effectively blocking probability and hence contention. Further, it provides end-to-end throughput performance also. Hence, it establishes an appropriate tradeoff between loss rate and end-to-end throughput.     

An optimal protection and restoration scheme (OPARS) for optical networks

Protection and restoration are critical network design issues for optical networks since even a single failure for a short duration may result in huge data loss due to the large capacity of optical fibers. However, few studies have been done on these issues for optical burst switching (OBS) networks. Protection and restoration are essential mechanisms for guaranteeing more reliable traffic delivery services. But it is not easy to apply existing mechanisms to optical burst switching (OBS) networks due to its one-way reservation signaling and the statistical burst multiplexing. Thus, to achieve the high transmission performance and reliability simultaneously, unique properties of OBS must be considered in the design of protection scheme. In this paper, an optimal protection and restoration scheme (OPARS) has been introduced that not only optimizes the number of provisioned protection wavelengths adaptively based on the traffic load as well as the quality of service (QoS) requirements of bursts in high speed networks but also minimizes burst loss rates. In addition, the proposed scheme has been used as an efficient contention resolution technique. The simulation results verify that the proposed scheme improve the network resource and channel utilization while guaranteeing the targeted protection reliability and QoS requirements of bursts.     

Performance of a distributed WR-OBS control architecture

This paper proposes a new distributed wavelength-routed optical burst switching (WR-OBS) network architecture and two corresponding control protocols. By taking advantage of merits from both just enough time (JET) protocol and two-way signaling method, this new control architecture outperforms traditional JET OBS network in points of burst loss probability, system throughput and centralized WROBS network in network scalability confirmed by computer simulations. Further simulation is developed to compare the performance of the two control protocols, which leads to instructive discussion in real WR-OBS network design.     

一种新型的突发汇聚算法研究

分析了现有的突发汇聚算法,同时针对现有汇聚算法的一些特点,提出了一种新型突发包汇聚算法,可以实现在不同网络负载的情况下,根据到达边缘节点的速率同时结合网络的性能(丢包率),动态的调整突发包汇聚的门限值,从而实现了智能组包,克服了原有算法简单,不灵活的缺点.通过仿真结果可以得知,该算法可以明显改善光突发交换网络的丢包率和时延性能,能够很好地支持实时性要求很高的数据业务.     

Variable time-period optical switching:a novel OBS implementation

In this paper, we proposed a novel optical switching method based on optical burst switching (OBS), we call it variable time-period optical switching (VTPOS). It can both support circuit services and other immerged packet services. It has better usability of bandwidth, shorter offset and latency time than others of unidirectional transport signaling mechanisms for OBS. It supports deflection switching for improve blocking performance without the need of schedule buffer. It introduces a time pointer and phase indicator that made synchronous more precisely and requires less guard time, it also classifies the different services classes with a relative QoS model.     

Blocking and delay performance for differential output-ports choosing probability scheme applied optical burst switching network

Differential output-ports choosing probability (DOCP) scheme is a novel traffic outputting model for core router in optical burst switching (OBS) network. In this paper, we provide an analytical model for studying the performance of traffic blocking and delay in DOCP-applied OBS network. We first evaluate blocking probabilities using DOCP and confirm it by simulation. Then, in optical buffer-equipped OBS core router, we consider the average delay time for buffered traffic and the average total traffic queueing length in core router. The knowledge of delay performance is useful for the optical buffer architecture configuration in differential traffic scenario. Several results indicate that, under the same load condition, the blocking probabilities and the delay time will change along with the changeable ports choosing probability and the ratio between different length bursts in the OBS system.