A novel burst-outputted model in an OBS core router

In this paper, the performances of a novel burst-outputted model which based on differentiated probability in an optical burst switching (OBS) core router have been proposed and analyzed. Different from the same probability to select output-port model in previous works, proposed model gives a burst-outputted process with different probabilities, which based on the fact that, output-ports may lead to variable distance with the same destination. The burst blocking probability, the system-passed rate, the average output-port occupied value and the efficiency have been given and discussed.     

Performance analysis of an improved burst-outputted scheme in a limited buffer equipped OBS core node

Burst-outputted performance will be affected by the outputting scheme in optical burst switching (OBS) core nodes. In this paper, we have evaluated the performance of an improved burst-outputted scheme in an OBS core node, in which fiber delay lines (FDLs) based limited optical buffer has been equipped. Different from the previous works which only consider the same probability to select output-port for burst, the proposed scheme gives a burst-outputted process based on different port selected probability. Simulation results have indicated that, performance evaluation parameters are changed with the output-port selected probability and the different number of FDLs in an optical buffer.     

一种改进型光可分突发交换性能分析模型

提出了一种改进型光可分突发交换性能分析模型(Modified Optical Composite Burst Switching,MOCBS).该模型考虑了截断剩余造成的影响,通过分析截断概率、平均截断剩余长度,得到截断剩余造成的分组丢弃概率,从而更准确地估计分组丢失率.在此基础上,推导出支持区分服务的POCBS(Prioritized OCBS)性能分析公式.仿真验证了MOCBS的准确性以及POCBS分析公式的有效性.     

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

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

Performance analysis and improvement of loss recovery mechanisms in star OBS networks

In OBS networks, burst loss affects negatively the performance of the higher layers. Proactive loss recovery mechanisms, such as burst cloning, have the advantage of low burst delay but it suffers from low bandwidth utilization. However, reactive loss recovery mechanisms, such as burst retransmission, have the advantage of high bandwidth utilization but at the cost of high burst delay. In this paper, we present an analysis of this trade-off and we propose two new schemes to improve bandwidth utilization while keeping burst delay as low as possible in star OBS networks. The first scheme controls the retransmissions. The second scheme combines burst cloning and burst retransmission mechanisms. Analytical and simulation results show that the both schemes achieve high bandwidth utilization. The results confirm also that compared to basic burst retransmission scheme, the first scheme reduces burst delay only at moderate and high load, however, the second scheme reduce delay at every load.     

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

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

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.     

Blocking improvement for high priority in differentiated OBS networks through preemption and buffer-limitation

Delay preemption that combines the techniques of preemption and small buffers is an efficient solution for burst contention. However, due to the phenomenon of over-usage on buffer, the low-loss demand of high priority is not ensured especially in high traffic states. In this article, to improve the blocking of delay preemption, we propose a modified scheme named limited delay preemption based priority (limited-DPP) that constrains the buffered right of low priority within the moderate and high traffic states. To validate the efficiency of limited-DPP, the comprehensive analysis and simulation are performed in terms of loss and buffering time.     

TCP在光突发交换试验网络中性能的实验研究

在光突发交换试验网络中对TCP的性能进行了实验研究.首先研究了丢包对网络性能的影响,表明突发包丢失将导致TCP吞吐量的快速下降,并且丢包率越高,可用的TCP传输带宽越窄.然后分别详细研究了OBS试验网络中的延时损伤和报文段关联增益,以及对TCP传输性能的影响.最后综合考虑这些因素.实验结果表明,在本OBS试验网络中存在一个不随丢包率变化的最优化突发包组装时间250us使得可用TCP带宽最大化.为了最大限度地提高TCP的传输性能,组包时间应该选择等于或稍大于这个最优值.     

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.     

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.     

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.     

Distributed queue optical burst switched ring—A MAC protocol with zero blocking for OBS ring networks

Optical burst switching is a switching technology that is able to provide viable switching for optical internet with the present day technology. This paper presents a new medium access protocol for wavelength division multiplexing based optical burst switched metro ring network namely distributed queue optical burst switched ring (DQOBSR). It is a slotted, distributed queue access protocol with fixed bus structure and simple wavelength assignment. The topology consists of two unidirectional, counter rotating rings and the medium access protocol is based on distributed queuing. The protocol provides zero blocking with acceptable access delays. A mathematical model is also presented to determine the mean access delay which is the important performance parameter for the protocol. The simulation and model based results are compared and found to be in good agreement.     

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.     

光突发交换边缘路由器性能分析

本文详细分析了各种因素对光突发交换边缘路由器的性能的影响.结果显示,不同服务等级的时延要求可以通过控制组装的最大时延得以保证;不同等级数据包长的大范围变动会导致信道分配的不公平性;边缘节点越多,丢包率越高;在总输出容量一定的情况下,增加输出数据信道数可以在获得低的丢包率的同时达到较高的通道利用率,但随着边缘节点数的增加,增加输出信道数对丢包率的改善作用下降.     

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

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

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.     

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.     

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

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

光突发交换网中一种新的有优先权的冲突解决方案

提出了一种解决不同优先级突发包之间资源竞争的方案,分析了该方案下不同优先级的性能(时延和丢包率) .研究结果表明：高优先级突发包的平均时延和丢包率都远小于低优先级突发包,因此该方案能为高优先级突发包提供很好的QoS保障.