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

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

光突发交换网络试验平台

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

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

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

OBS网络中基于优先级与突发包分割的偏射路由机制

为了有效地降低突发包的丢失率和保证OBS网络中不同优先级业务的服务质量,提出了一种基于优先级与突发包分割的偏射路由机制.当冲突发生时,首先基于突发包的优先级进行"竞争突发包头部分割或者原突发包尾部分割"处理;无冲突部分直接在事先预留的输出数据信道上处理,冲突部分的分割突发包根据参数可调的偏射路由机制被偏射到最佳偏射路径上.仿真结果表明,该机制能够有效地降低整个网络的丢包率和端到端的延时,并且得到高优先级突发包的丢失率和延时低于低优先级突发包.由此可知,基于优先级与突发包分割的偏射路由机制能够有效地解决突发包的冲突问题,从而提高整个OBS网络的性能.     

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

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

光突发交换网络核心节点中QoS策略研究

对OBS网络核心节点中所采取的多种改善QoS的策略进行了研究并提出了一种反馈证实机制以减少数据突发的丢失.其原理是在BCP传输建立端到端通路的过程中,如果在某核心节点处不能成功预约波长信道,该节点将在数据突发离开边缘节点之前返送NACK证实信息,取消边缘节点的该数据突发调度输出计划,并将其重新缓冲排队以备再次调度发送.这样可以尽量为数据突发提供可靠的波长路径,减少数据突发的丢失.     

光突发与光电路混合交换边缘节点的设计与实现

提出了一种将光电路交换和光突发交换融合于同一网络的边缘节点设计方案.根据此方案，网络边缘节点能根据业务需求灵活选择交换方式.该方案在实际实验系统中进行了验证.结果表明，采用光电路交换方式，网络传输速率相对较快，而采用光突发交换方式，网络的带宽利用率更好.这两种交换方式共存于同一网络,一定程度上能提高网络的灵活性和适应性.     

一种适用于光突发交换的区分型资源预留机制

将边缘结点突发汇聚算法与核心结点资源预留机制有机结合，提出了一种适用于光突发交换的区分型资源预留机制.引入“突发流”的概念，在边缘结点采用基于线性预测的突发汇聚算法将输入IP分组汇聚为单个突发或突发流；在核心结点引入“搭载请求”的思想，对单个突发和突发流采用不同的资源预留方案.仿真结果表明区分型资源预留机制可以明显改善光突发交换网络的丢失性能.     

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

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

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

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

An optimal burst assembly approach employing traffic shaping (OBATS) for OBS

Optical burst switching (OBS) aims at combining the strengths of packet and circuit switching and is considered as a promising technology for implementing the next generation optical Internet, required to cope with the rapid growth of Internet traffic and the increased deployment of new services. In this paper, an optimal burst assembly approach employing traffic shaping (OBATS) for OBS networks has been proposed in order to improve network performance in terms of reduced blocking probability, congestion control and better utilization of bandwidth. Particularly, the proposed scheme aims at reducing the average delay experienced by the packets during the burstification process in optical burst switched (OBS) networks, for a given average size of the bursts produced. Reducing the packet burstification delay, for a given average burst size, is essential for real-time applications; correspondingly, increasing the average burst size for a given packet burstification delay is important for reducing the number of bursts injected into the network and the associated overhead imposed on the core nodes. Simulation results show that the proposed burst assembly approach gives better network performance in terms of burst drop, resource contention and delay as compared to conventional burst assembly approaches.     

Analysis of burst/packet assembly techniques in high-speed optical switching network

In the Optical Burst Switching (OBS) Network, the burst assembly technique is one of the challenging issues in the implementation of the system. It has the influence on the burst characteristic, which gives an impact on the network performance. Burst assembly is the process of assembling incoming data from the higher layer into bursts at the ingress edge node of the OBS network. The burst assembly mechanism must then place these packets into bursts based on some assembly policy. In this paper, the OBS system performance has been observed in simulated 12-node network based on Just-Enough-Time (JET) reservation protocol with various burst assembly techniques under the standard drop policy (DP) and the segmentation policy for contention resolution. The simulation results show that the performance of the proposed Adaptive-Threshold with Fixed Maximum Time Limitation (ATH-FMTL) burst assembly scheme is better than conventional burst assembly schemes in terms of loss probability and average assembly delay. Also, the proposed scheme avoids a sudden increase in the burst size and makes the burst sent out smoother as compared to conventional schemes.     

Comparison analysis of optical burst switched network architectures

Optical burst switching (OBS) is a promising paradigm for the next-generation Internet infrastructure. In this paper, a novel efficient network architecture for OBS has been presented and compared with conventional OBS architectures. To enhance OBS system performance, the architecture employs a novel proposed burst assembly algorithm, fiber delay lines (FDLs) and dynamic route selection technique. A queuing model is used to predict the system behavior for both classless and prioritized traffic. Simple closed-form expressions are obtained for the burst-loss probability of both classless and prioritized traffic. Numerical results show that the proposed architecture provides an accurate fit for the performance of the highest traffic class and lower bounds for the other traffic classes that are tighter than earlier known results.     

A new burst assembly technique for supporting QoS in optical burst switching networks

This letter proposes a new burst assembly technique for supporting QoS in optical burst switching (OBS) networks. It consists of the adaptive-threshold burst assembly mechanism and QoS-based random offset-time scheme. The assembly mechanism, which is fit well to multi-class burst assembly, not only matches with IP QoS mechanism based on packet classification, and also utilizes fairly and efficiently assembly capacity. Based on token-bucket model and burst segment selective discard (BSSD), the offset-time scheme can smooth the traffic to support OBS QoS. The simulation results show that the technique can improve the performance in terms of packet loss probability (PLP).     

A new flexible and enhancing bandwidth utilization burst dropping technique for an OBS network

Optical burst switching (OBS) has been proposed as a competitive hybrid switching technology to support the next generation optical Internet. However, due to their one-way resource reservation mechanism, OBS networks experience high bursts (thus packets) loss rate. In OBS networks, the contention is resolved either by dropping one of the contending bursts or more efficiently by dropping from one of the contending bursts only the parts that overlap with the other bursts. In both situations, only one data source will suffer the data loss in favor to the other. In this paper, a new burst flexible and enhancing bandwidth utilization burst dropping technique has been proposed for contention resolution in optical burst switched networks. When contention occurs, any part of a contending burst could be dropped, instead of only the head or tail of bursts. The proposed dropping scheme makes bandwidth utilization more efficient and flexible. Simulation results show that the proposed dropping scheme performs better than existing burst dropping schemes.     

Congestion prevention for reliable OBS

It is known that Internet traffic exhibits a structural self-similarity over a wide range of time scales. Existing performance evaluation studies in optical burst switching (OBS) networks show high contention performance degradation in the nodes under correlated traffic. Due to its buffer-less nature, OBS efficiency can be reduced by resource contention leading to burst loss. Several methods have been proposed to address this problem, most of them relying on reactive mechanisms, which increase the complexity of core nodes, hampering scalability. In this paper to have congestion prevention, an efficient scheme incorporating delayed reservation decision has been proposed which not only offers reduction in resource contention by maintaining the same node complexity as that in general OBS networks with optical buffers but also provides improvement in system's throughput. Simulations show the proposed scheme has better performance than existing schemes in terms of burst loss probability.     

Improved adaptive-threshold burst assembly in optical burst switching networks

An improved adaptive-threshold burst assembly algorithm is proposed to alleviate the limitation of conventional assembly schemes on data loss and delay. The algorithm will adjust the values of assembly factors according to variant traffic regions. And the simulation results show that, by using the adaptive-factor adaptive assembly scheme, the performance of networks is extensively enhanced in terms of burst loss probability and average queuing delay.     

An efficient scheme for optimizing channel utilization in OBS networks

Optical burst switching (OBS) is an emerging technology that allows variable size data bursts to be transported directly over DWDM links. In order to make OBS a viable solution, the wavelength scheduling algorithms need to be able to utilize the available wavelengths efficiently, while being able to operate fast enough to keep up with the burst incoming rate. Unfortunately, horizon scheduling cannot utilize the voids created by previously scheduled bursts, resulting in low bandwidth utilization. To date, Min-SV is the fastest scheduling algorithm that can schedule wavelengths efficiently. However, its complexity is O (log m) and it requires 10 log (m) memory accesses to schedule a single burst. This means that it can take upto several microseconds for each burst request, which is still too slow to make it a practical solution for OBS deployment. In this paper, an efficient scheme has been proposed for optimizing channel utilization in OBS networks. In the proposed approach, a burst is represented by an interval of time. The process of scheduling a number of bursts, thus, turns to be a process of fitting a set of the corresponding time intervals on a channel time line that represents a channel-time resource. By doing so, the scheduling process can be formulated as a combinatorial optimization problem. Then, graph theory is applied to schedule as many non-overlapping intervals as possible onto the channel time line. The underlying concept of the proposed scheduling scheme is that of briefly delaying the scheduling of a burst so that a much better decision can be made about a number of bursts all-together. This scheme is shown, through simulations, to improve performance in terms of burst loss probability, channel utilization, fairness-control and data throughput over existing schemes. Thus the proposed scheme is well suited for high performance networks in terms of reliability.