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.     

A segmentation based channel scheduling scheme for improving channel utilization in OBS networks

Channel scheduling is an important aspect in optical burst switching (OBS) networks. OBS is a promising solution for the future Internet backbone. In OBS network a key issue is data channel scheduling. In this paper we propose a channel scheduling scheme to optimize channel utilization for OBS networks with segmentation. In this paper, we propose an efficient way to organize the void intervals. The channel scheduling method is compared with existing scheduling schemes. Simulation results show that both channel utilization and burst loss ratio performance improved as compared to existing scheduling schemes.     

An efficient fault localization or detection mechanism for high speed optical networks

Optical burst switching (OBS) has been considered as the gate through which the envisaged world of optical Internet will be conquered by implementing Internet Protocol (IP) software directly over a wavelength-division-multiplexing (WDM) optical layer (IP/WDM). The main feature for designing next generation optical networks is protecting and restoring high capacity WDM networks from the failures. Quick detection, identification and restoration make networks more strong and consistent even though the failures cannot be avoided. Hence, it is necessary to develop fast, efficient and dependable fault localization or detection mechanisms. In this paper, an efficient scheme for OBS networks has been proposed to provide fast restoration of links with minimum delay as well as blocking probability. By simulation results, it is shown that the proposed OBS scheme achieve less blocking probability and delay while getting higher throughput in comparison to conventional schemes.     

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

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

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.     

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.     

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.     

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.     

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.     

OBS网络中一种基于优先级和门限的偏射路由算法

为了解决偏射算法在偏射控制上的问题,提出了一种基于优先级和门限的偏射路由算法.该算法采用丢弃少量偏射的高优先级分割突发数据包来保证偏射路由上低优先级非偏射突发数据包的QoS.当冲突发生时,分割偏射优先级低的突发数据包,从而保护高优先级突发数据包|在偏射路由上,通过启用偏射检测函数来判断是允许偏射的分割突发数据包抢占资源或是丢弃偏射的分割突发数据包.仿真结果表明,虽然该算法增加了少量的端到端的传输时延,但这种算法可以很好地控制偏射突发对网络偏射路由上正常流量的影响,并且能够有效地降低整个网络的丢包率,很好地保护高优先级突发数据包的完整性.故这种方法能够有效地提高OBS网络的性能.     

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.     

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

Contention reduction and service differentiation in OBS networks

Optical burst switching (OBS) has been proposed to be a competitive switching technology for wavelength division networks (WDM) networks. In this switching technique, single burst loss due to contention influences loss of multiple data. Thus, burst loss ratio (BLR) is the main deciding factor for determining the performance of an OBS network. Also, inefficient data channel scheduling algorithm causes burst loss in OBS. In addition to this, the same service to all model of the current Internet is inadequate for the diverse quality of service expectations of Internet applications and users. In this paper, an efficient technique is proposed in which data burst is assembled from several Internet protocol (IP) packets in such a manner that the number of IP packets is changed according to the traffic load. In the proposed scheme, the burst is segmented because the segment located at the end of the contended burst has a greater chance of surviving contention (as the dropped segments are those at the beginning of the contending burst). Thus, the most important (or higher priority) information is enveloped in the last segmented. Further to prevent resource wastage due to over admitting of bursts, the proposed scheme is extended by admission control test for an output link without a fiber delay line (FDL) buffer. Also, modified latest available unscheduled channel with void filling (LAUC-VF) scheduling algorithm utilizing MPLS has been used to provide a scalable and manageable architecture for service differentiation (DiffServ) in IP networks. Simulation results demonstrate that the proposed technique has reduced burst loss rate and better quality of service (QoS) performance in comparison to existing techniques.     

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.     

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

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

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.     

Impairment-aware QoS provisioning in dual-header OBS networks

Signal degradation due to physical impairments may result in unacceptable bit-error rates of received signals at the destination. Based on earlier work, we study the impairment-aware quality of service (QoS) provisioning problem in dual-header optical burst switching (OBS) networks that employ two control packets for each data burst. At an OBS node, the proposed algorithm schedule bursts for transmission by searching for available resources using admission control and preemption. The algorithm also verifies signal quality. Simulation results show that this algorithm is effective in providing QoS support in OBS networks while considering physical impairment effects.     

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.     

A novel collision free WDM optical switching network

To avoid burst collision in OBS-WDM ring network, a novel scheme called Estimated Traffic based Longest Queue First (ETLQF) has been proposed. In it, the scheduler considers both the queue length and the incoming traffic. The scheduler can adjust the queue lengths in advance to cater to the incoming traffic, targeting to reduce cell loss ratio (CLR) and improve the buffer utilization. The simulation results show that the ETLQF in OBS ring networks not only reduces CLR by 10-60%, but also achieves high throughput while saving 65% of wavelengths, when compared to conventional schemes with only destination delay.     

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

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