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.     

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.     

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.     

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 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.     

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

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

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

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

光突发交换网络中最长队列优先调度组装机制

提出了光突发交换网络中的最长队列优先调度（LQF-SA）机制,将边缘节点的突发组装和突发调度两种技术紧密结合在一起.在现实网络中,业务通常是非均匀分布的,即在某些源宿对之间存在更大的业务流量.仿真结果表明,LQF-SA机制可以很好地完成非均匀分布业务流的组装.即使在均匀分布业务流输入下,LQF-SA机制在突发大小分布、组装效率和突发丢失率等方面也优于已提出的轮询调度组装（RR-SA）机制.     

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 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.     

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 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.     

Performance analysis of an improved burst-outputted model for an OBS core router

Differentiated probability outputted scheme (DPOS) is an improved burst-outputted paradigm in optical burst switching (OBS) core routers. In this paper, the blocking performance for multi-priority traffic in a DPOS applied OBS core router with limited buffers has been analyzed and discussed firstly. Several simulation results indicted that DPOS had a better performance in blocking than the outputted model presented in the previous work had. Besides, our proposed scheduling mechanism can supported the quality-of-service (QoS) efficiently for OBS networks.     

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

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

A maximum-efficiency-first multi-path route selection strategy for optical burst switching networks

In this paper, the impact of a path selection on other existing paths in optical burst switching (OBS) networks is studied by analyzing the contention among different traffic streams and the interaction between the route selection and traffic load balance. The results show that there exists a mutual reinforcement interaction among the traffic load of a path, the path burst loss ratio and the contention ability of the path when burst loss ratio based multi-path selection strategies are adopted, which may increase the unbalance of traffic and lead to severe congestion further. A maximum-efficiency-first multi-path selection strategy, which considers the performance of the burst flows and the impact of a path selection on existing OBS paths at the same time by a combined metric of route efficiency, is proposed to maximize the utility of the burst flows and minimize the increment of lost throughput on the path. The performance of the proposed multi-path selection strategy is evaluated through simulation. The results show that the presented strategy obviously outperforms the least burst loss ratio strategy and shortest path first strategy in terms of the burst loss ratio in the practical unbalanced background traffic, especially when the network is heavily loaded.     

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.     

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

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

光突发交换中支持区分业务的混合封装和改进的头部丢弃策略

介绍一种在光突发交换网中支持业务QoS,并减少分组到达乱序的突发包混合封装机制.通过将不同级别的分组组成相对独立的段,并进而封装到同一个突发包里,可减少分组到达乱序.结合改进的头部丢弃策略,可克服尾部丢弃法中存在的虚假冲突问题,能真正改善分组丢弃率.仿真结果表明,混合封装在结合改进的头部丢弃法之后,能很好地应用于具有QoS要求的光突发交换网中.