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

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

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

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.     

Investigations on burst length in optical burst switched networks

In this paper, we investigate the performance of optical burst switched networks for erbium-doped fiber amplifiers (EDFAs) and semiconductor optical amplifiers (SOAs). We show that EDFAs are more suitable for burst switching as compared to SOAs. We further investigate the burst length for 18, 24.6 and 55 km optical switched network. It is observed that burst length should neither be very small nor very large. If the burst length is small, throughput will be less, and if the burst length is very large, delay will be very large. This is due to higher wait times incurred when packets are formed into larger bursts causing additional overall delay. It is observed that performance decreases up to a small burst length of 1500 μs, which is the minimum burst length required for the creation of the burst. Once this burst is created, there is significant improvement in the quality factor up to 3000 μs. After this burst length, the performance again degrades. Hence the burst length can be optimized for the best quality factor in optical burst switched networks. We further show that by increasing EDFA gain, the quality deteriorates as increasing the EDFA gain results in increased levels of additive phase noise, which can further induce nonlinearities.     

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.     

An adaptive reservation scheme for optical network

In this paper, the various Optical Burst Switching (OBS) reservation schemes have been examined in order to reduce data loss caused by either channel scheduling or resources. A novel multi-service OBS edge node with synchronized bandwidth reservation mechanism (SRM) has been proposed, which enables high-speed network transport nodes to dynamically reserve bandwidth needed for active data burst flows. The performance of the proposed mechanism is evaluated by means of NS-2 simulation. The results show that the packet delay is kept within the constraint for each traffic flow and the performance metrics such as burst loss rate, throughput and fairness are remarkably improved.     

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.     

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

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

Hybrid buffering architecture for packet contention resolution of an optical packet switch

Packet contention is a major issue in optical packet switching network and it is not a trivial task to resolve due to lack of optical RAM technology. In order to resolve contention optical buffering approach is used using fiber delay lines (FDLs). Yet there is a heavy packet loss rate due to unavailability of output port and free FDLs. This paper proposes a hybrid buffering architecture using feed-forward and feedback shared FLDs to resolve packet contention resolution of an optical packet switch. Feed-forward FDLs are used as primary buffer and feedback FDLs are implemented as supplementary buffer. Simulation result shows that proposed hybrid buffering switch achieves packet loss rate between 10⁻¹ and 10⁻² at heavy traffic load (ρ = 0.9) for a 32 × 32 switch using different FDL length.     

An optical MEMS-based dynamic capacity allocation scheme for handoff using moving extended cells in radio-over-fiber networks

We demonstrate a Dynamic Capacity Allocation scheme for the realization of Moving Extended Cells in Radio-over-Fiber networks. Our scheme exploits a reconfigurable MEMS-based Central Office architecture for routing of and switching between six data carrying wavelengths, forming in this way cell clusters that transmit the same information content and can move with the mobile user. Error free transmission through 25 km SMF is presented for a 5-cell MEC structure, with each optical channel carrying 500 Mb/s data subcarrier-modulated at 8.5 GHz.     

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

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

A new green multicast grooming protection algorithm in WDM optical networks

Since optical network carries a lot of traffic, survivability is very important to ensure the service continuity against network failures. Recently, multicast services become more popular to meet the huge multimedia demand in network, so that multicast survivability in optical network has got more attention. However, multicast survivability may lead to more energy consumption due to more redundant backup resources allocated. Since greening network is particularly important with the energy crisis keeping growing, green multicast survivability in optical network is a challenging issue. This paper focuses on the green multicast grooming protection problem in optical network and designs two auxiliary graphs that includes a virtual topology graph and an integrated graph to address the survivable multicast grooming, routing and wavelength assignment. Based on the auxiliary graphs, this paper proposes an efficient heuristic called green multicast grooming algorithm based on spanning path dedicated protection (GMG-SPDP), in which the network reliability and the energy efficiency are jointly taken into account. Simulation results show that, compared to other algorithms, the proposed GMG-SPDP not only has lower blocking probability and higher bandwidth utilization ratio, but also saves more energy.     

Performance analysis of an integrated scheme in optical burst switching high-speed networks

A new integrated scheme based on resource-reservation and adaptive network flow routing to alleviate contention in optical burst switching networks is proposed. The objective of the proposed scheme is to reduce the overall burst loss in the network and at the same time to avoid the packet out-of-sequence arrival problem. Simulations are carried out to assess the feasibility of the proposed scheme. Its performance is compared with that of contention resolution schemes based on conventional routing. Through extensive simulations, it is shown that the proposed scheme not only provides significantly better burst loss performance than the basic equal proportion and hop-length based traffic routing algorithms, but also is void of any packet re-orderings.     

A new protection algorithm with consideration of lightpath load in fault-tolerant GMPLS optical networks

In this paper, we study the survivability in GMPLS optical networks and propose a new algorithm called Protection based on Lightpath Load (PLL) to tolerate the single-fiber link failure. Based on the parameter, Boundary of Heavy-load Lightpath (BHL), PLL can effectively choose the protection execution whether on optical layer or on IP/MPLS layer, such that the bandwidth utilization and recovery complexity can be compromised. In PLL, if the number of Working Label Switching Path (WLSPs) carried on a Working Lightpath (WLP) exceeds the value of BHL, this WLP will be protected in optical layer; otherwise, these WLSPs carried on this WLP will be protected on IP/MPLS layer. Simulation results show that, compared to conventional protection algorithm, PLL not only can significantly reduce the recovery complexity but also can obtain satisfactory trade-off performance.     

A novel scheme of two-dimension time-stacked wavelength-time optical code label for optical packet switching network

A novel scheme of time-stacked optical code label based on optical code division multiple (OCDM) technique for optical packet switching network is proposed, in which two-dimensional wavelength-time OCDM code is used as the optical label. Packet loss rate and system characteristic based on the proposed scheme are studied. Results show that less packet loss rate of proposed scheme can be achieved as compared with that of one-dimension time-stacked optical code label system.     

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.     

K-dimensional protection structure (KDPS) for multi-link failure in data center optical networks

Currently, data center has become one of the most important application resources. Meanwhile, there is huge amount of data streams within a data center or among different data centers, which requires the transmission channel with high bandwidth and good reliability. Optical networks become the essential solution for the data center interconnection. Especially for intra data center networks, there are too many links for a limited number of nodes, which make the network so complex and vulnerable. A K-dimensional protection structure (KDPS) is proposed against multi-link failure in data center optical networks, and 3DPS is mainly introduced and analyzed in the paper. Two greedy algorithms are proposed to construct KDPS in static and dynamic optical networks respectively. Numerical results show that 3DPS can be constructed with more difficulty in dynamic optical networks, and the greedy algorithm can find the 3DPS much easier under three-link failures than under dual-link failures.