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.     

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

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.     

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

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

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

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

Lag Synchronization Between Two Coupled Networks via Open-Plus-Closed-Loop and Adaptive Controls

In this paper,we study lag synchronization between two coupled networks and apply two types of control schemes,including the open-plus-closed-loop(OPCL) and adaptive controls.We then design the corresponding control algorithms according to the OPCL and adaptive feedback schemes.With the designed controllers,we obtain two theorems on the lag synchronization based on Lyapunov stability theory and Barbalat's lemma.Finally we provide numerical examples to show the effectiveness of the obtained controllers and see that the adaptive control is stronger than the OPCL control when realizing the lag synchronization between two coupled networks with different coupling structures.     

A robust adaptive hybrid feedback cancellation scheme for hearing aids in the presence of outliers

It has been demonstrated that the Filtered-x Wilcoxon LMS (FxWLMS) based adaptive filter mitigates the effect of the outliers acquired by the microphone signal of hearing aids by minimizing the Wilcoxon norm and hence shows better cancellation performance than the existing Filtered-x LMS (FxLMS) algorithm. The prediction error method based adaptive feedback canceller (PEMAFC) reduces the bias present in the estimate of the feedback path due to the continuous adaptive filtering (CAF). However, the impulse response of the measured feedback path is close to zero for the first many samples due to the delay introduced by ADC converters and then contains few significant values, which results in slow convergence rate when an adaptive filter is used to model the same. To overcome this limitation, we propose a proportionate normalized WLMS (PNWLMS) algorithm based PEMAFC (P-PNWLMS) for feedback cancellation in hearing aid in the presence of outliers. Further, with an objective to improve the convergence rate and performance accuracy simultaneously, this paper proposes a novel convex PNWLMS (CPNWLMS) algorithm which incorporates convex combination of PNWLMS and WLMS algorithms. The weight update equations are derived for PEMAFC trained by PNWLMS (P-PNWLMS) and CPNWLMS (P-CPNWLMS) algorithms respectively. The results of the simulation study show improved performance of the proposed CPNWLMS based adaptive filter over its component filters.     

Control of modulated vibration using an enhanced adaptive filtering algorithm based on model-based approach

Conventional adaptive filtering algorithms, typically limited to the control of single or multiple sinusoids, are not appropriate to control modulated vibrations, especially in the presence of rich side band structures. To overcome this deficiency, a new control algorithm is proposed that introduces a feedback loop with the model predictive sliding mode control (MPSMC) in the adaptive filtering system. Several amplitude and frequency modulation cases are first computationally studied, and conventional and proposed methods are comparatively evaluated in terms of estimation error, performance in time and frequency domains, stability, and uncertainty in the reference signal. To experimentally validate the proposed algorithm, an active strut (with longitudinal vibrations) is constructed. Overall, the proposed adaptive algorithm yields superior reductions at the main frequencies and at side bands; also, good attenuation is found on a broadband basis.     

Variable step-size based method for acoustic feedback modeling and neutralization in active noise control systems

This paper investigates the issue of the acoustic feedback during online operation of active noise control (ANC) systems. In the existing approach, two FIR filters are used for this task: adaptive for feedback path modeling (FBPM) and fixed for feedback neutralization (FBN). Previously, a simplified method is proposed where these two tasks of modeling and neutralization have been combined into one feedback path modeling and neutralization (FBPMN) adaptive filter. Here we introduce an intuition based variable step size (VSS) parameter, for LMS equation of FBPMN filter. This VSS is motivated from the fact that the error signal of FBPMN filter contains a disturbance-component that is decreasing in nature. The computer simulations are carried out for single-channel and multichannel ANC systems. It is demonstrated that the proposed method achieves better performance than the existing methods.     

Design and analysis of a BLPC vocoder-based adaptive feedback cancellation with probe noise

The band-limited linear predictive coding (BLPC) vocoder-based adaptive feedback cancellation (AFC) removes the high-frequency bias, while the low frequency bias persists between the desired input signal and the loudspeaker signal in the estimate of the feedback path. In this paper, we present a BLPC vocoder-based adaptive feedback canceller with probe noise with an objective of reducing the low-frequency bias in digital hearing-aids. A step-wise mathematical analysis of the proposed feedback canceller is presented employing the recursive least square and normalized least mean square adaptive algorithms. It is observed that the optimal solution of the feedback path is unbiased for an unshaped probe noise, but is biased for a shaped probe signal; the bias term does not consist of correlation between the desired input and the loudspeaker output. The identifiability conditions are analysed and it is shown that a delay, greater than or equal to the length of the adaptive filter, must be introduced in the forward path to achieve an unbiased feedback path estimate. Algorithm analysis and computer simulations presented in this paper justify the reason for selecting the proposed design over the existing BLPC vocoder-based feedback cancellation algorithm.     

A novel differentiated services supporting scheme for optical burst switched networks

In this letter, we analyze the drawback of tail-dropping contention resolution in optical burst switched networks. Once contention occurs, we adopt modified head-dropping policy to resolve contention. This policy drops the head of the contending burst only if the overlapping region of the two bursts is less than the whole contending burst size, otherwise drops the whole contending burst. In order to have a better support of differentiated service, a new burst assembly policy, namely, Priority-based proportional mixed burst assembly, is proposed. Simulation results show that the proposed scheme performs very well in terms of performance metrics such as the times of contention and packet loss probability.     

随机性参数自适应的混沌同步

对两个不同参数的混沌系统进行随机性参数自适应控制，选取合适的控制律和反馈系数，导致其同步.以Henon映射为例进行数值模拟，结果表明，由于控制周期和反馈系数的随机变化，具有一定的实用意义. 关键词： Henon映射 混沌同步 随机性自适应控制     

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

基于间歇性参数自适应控制的混沌同步

提出了在两个不同参数混沌系统的同步中基于间歇性参数自适应的控制方法.在选择合适的间歇反馈周期N和反馈系数r的情况下,可以获得满意的同步结果.以logistic映射为例进行了计算机模拟.结果表明:适当选取反馈系数r,可以以很小的控制代价实现预定的同步目的. 关键词： 混沌同步 间歇控制 自适应控制     

粒子群优化算法在自适应偏振模色散补偿中的性能研究

反馈控制算法是偏振模色散的自适应补偿器的关键组成部分,将粒子群优化算法(PSO)引入到偏振模色散自适应补偿系统中。该算法的优点是具有快速收敛到全局最佳值的能力、避免搜索陷入局部极值的能力、抗噪声能力和多自由度控制能力。理论上分析了粒子群优化算法的两个分类———全局邻居结构粒子群优化(GPSO)和局部邻居结构粒子群优化(LPSO)在搜索全局最佳值方面的能力优劣,给出了局部邻居结构粒子群优化算法成功率达100%的三种邻居拓扑结构。实验表明:在补偿一阶偏振模色散时,全局邻居结构和局部邻居结构搜索全局最佳的成功率都能满足要求,全局邻居结构算法收敛速度快。而在补偿二阶偏振模色散时,全局邻居结构成功率降低,而局部邻居结构仍可以满足要求。     

延迟自反馈控制Hindmarsh-Rose神经元的混沌运动

利用线性时间延迟自反馈方法,研究单个Hindmarsh-Rose（H-R）神经元模型混沌动力学模式的控制问题.分别将增益因子和时间延迟作为控制参数,通过数值模拟分析,发现在增益因子和时间延迟两个参数组合的一些范围内,混沌动力学模式的H-R神经元运动可自动被控制成时间间隔意义上的单峰、2峰、3峰及4峰的周期或多倍周期模式.延迟时间的选取并无特别要求,不必和嵌入在混沌吸引子内的某不稳周期轨道的周期相同,延迟控制自适应地引导混沌轨到相应的放电峰峰间隔的周期模式上. 关键词： H-R神经元 延迟反馈控制 混沌放电模式 峰峰间隔周期     

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

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

Robust modeling of acoustic paths using a sparse adaptive algorithm

Acoustic impulse response functions are generally sparse in nature and traditionally these are modeled by adaptive finite impulse response (FIR) filters trained using a least mean square (LMS) algorithm. The conventional LMS algorithm is not effective in modeling sparse systems and sparse LMS algorithms have been recently developed to improve the modeling in such scenarios. However, the traditional sparse LMS algorithms are not robust to disturbances at the error sensor and may diverge in some scenarios. With an objective to overcome this limitation of conventional sparse adaptive algorithm, this paper presents a robust sparse adaptive algorithm. The new algorithm has been shown to effectively model sparse systems in a robust manner. In addition, the algorithm has been successfully applied in modeling the acoustic feedback path in a behind the ear digital hearing aid.     

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.