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.     

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.     

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.     

A novel optical burst switching architecture for high speed networks

A novel optical burst switching （OBS） high speed network architecture has been proposed. To verify its feasibility and evaluate its performance, just-enough-time （JET） signaling has been considered as a high performance protocol. In the proposed architecture, to avoid burst losses, firstly, a short-prior- confirmation-packet （SPCP） is sent over the control channel that simulates the events that the actual packet will experience. Once SPCP detects a drop at any of the intermediate nodes, the actual packet is not sent but the process repeats. In order to increase network utilization, cost effectiveness and to overcome some limitations of conventional OBS, inherent codes （e.g., orthogonal optical codes （OOC））, which are codified only in intensity, has been used. Through simulations, it shows that a decrease in burst loss probability, cost effectiveness and a gain in processing time are obtained when optical label processing is used as compared with electronic processing.     

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

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

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.     

United assembly algorithm for optical burst switching

Optical burst switching (OBS) is a promising optical switching technology. The burst assembly algorithm controls burst assembly, which significantly impacts performance of OBS network. This paper provides a new assembly algorithm, united assembly algorithm, which has more practicability than conventional algorithms. In addition, some factors impacting selections of parameters of this algorithm are discussed and the performance of this algorithm is studied by computer simulation.     

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.     

光突发交换中交换矩阵配置时间的影响研究

光突发交换是近几年出现的一种很有前途的交换技术。在光突发交换网络的核心节点中,光交换矩阵是一个关键部件,其配置时间影响到光突发交换网络的性能。这种影响表现在对数据信道可用时间施加了限制。在考虑光交换矩阵配置时间的基础上给出了修正后的LAUC算法,并通过计算机仿真研究了这种配置时间对光突发交换性能的影响。结果表明,光交换矩阵配置时间的增大会导致输出数据信道利用率的降低,进而增大了数据丢失率。     

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.     

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.     

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

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

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

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

Correction of out-of-FOV motion artifacts using convolutional neural network

PurposeSubject motion during MRI scan can result in severe degradation of image quality. Existing motion correction algorithms rely on the assumption that no information is missing during motions. However, this assumption does not hold when out-of-FOV motion happens. Currently available algorithms are not able to correct for image artifacts introduced by out-of-FOV motion. The purpose of this study is to demonstrate the feasibility of incorporating convolutional neural network (CNN) derived prior image into solving the out-of-FOV motion problem.Methods and materialsA modified U-net network was proposed to correct out-of-FOV motion artifacts by incorporating motion parameters into the loss function. A motion model based data fidelity term was applied in combination with the CNN prediction to further improve the motion correction performance. We trained the CNN on 1113 MPRAGE images with simulated oscillating and sudden motion trajectories, and compared our algorithm to a gradient-based autofocusing (AF) algorithm in both 2D and 3D images. Additional experiment was performed to demonstrate the feasibility of transferring the networks to different dataset. We also evaluated the robustness of this algorithm by adding Gaussian noise to the motion parameters. The motion correction performance was evaluated using mean square error (NMSE), peak signal-to-noise ratio (PSNR) and structural similarity index (SSIM).ResultsThe proposed algorithm outperformed AF-based algorithm for both 2D (NMSE: 0.0066 ± 0.0009 vs 0.0141 ± 0.008, P < .01; PSNR: 29.60 ± 0.74 vs 21.71 ± 0.27, P < .01; SSIM: 0.89 ± 0.014 vs 0.73 ± 0.004, P < .01) and 3D imaging (NMSE: 0.0067 ± 0.0008 vs 0.070 ± 0.021, P < .01; PSNR: 32.40 ± 1.63 vs 22.32 ± 2.378, P < .01; SSIM: 0.89 ± 0.01 vs 0.62 ± 0.03, P < .01). Robust reconstruction was achieved with 20% data missed due to the out-of-FOV motion.ConclusionIn conclusion, the proposed CNN-based motion correction algorithm can significantly reduce out-of-FOV motion artifacts and achieve better image quality compared to AF-based algorithm.     

A QoS-Guanranteed Scheduling Algorithm with High Throughput for Edge Nodes of Optical Burst Switching Networks

A scheduling algorithm for the edge nodes of optical burst switching (OBS) networks is proposed to guarantee the delay re quirement of services with different CoS (Class of Service) and provide lower burst loss ratio at the same time. The performance of edge nodes based on the proposed algorithm is presented.     

Effect of Residual Resist on Performance of Single-Mode 1 × 4 Optical Splitter in Photosensitive Polymer

Abstract

Polymer residues are generally left in the Y-junctions of the conventional splitters. Besides increased insertion loss, the Y-junction residue results in asymmetric distribution of power at device outputs. An analysis of the device performance in the presence of junction residue is presented and a design to overcome the non-uniformities in output power distribution brought about by the presence of the residue is proposed.     

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

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

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.     

Full-Duplex Radio-over-Fiber System Based on a Novel Octupling mm-Wave Generation Scheme

Abstract

A novel mm-wave generation scheme based on two phase modulators and two unbalanced Mach-Zehnder interferometers is proposed. Compared with the conventional Mach-Zehnder modulator-based scheme, the phase-modulator-based scheme can work steadily without an electrical control circuit for the DC bias, and it has smaller insertion loss. A full-duplex radio-over-fiber system was investigated by simulation, and its performance is not affected by chromatic dispersion for both downstream and upstream transmission. A 40-GHz mm-wave is generated from a 5-GHz driving signal. The system performance is analyzed by using eye diagrams and bit error rate. Results demonstrate that the performance is still very good, even after a 50-km transmission.