On burst rescheduling in OBS networks with partial wavelength conversion capability

The core nodes in an optical burst switching (OBS) network are normally equipped with wavelength converters (WCs) to reduce the burst loss probability. Since WCs are expensive and still immature technologically, it is desirable to reduce the number of WCs in the network and to have partial wavelength conversion capability at the core nodes. Nevertheless, a majority of algorithms in the literature are proposed under the full wavelength conversion assumption. As a result, they do not consider the burst loss caused by insufficient WCs, i.e., bursts dropped due to the unavailability of free WCs to convert them to unused wavelengths. In this paper, we demonstrate how to use burst rescheduling to decrease the burst loss due to insufficient WCs and hence cut down on the overall burst loss probability in OBS networks. Two burst rescheduling algorithms are proposed. Their effectiveness in reducing the overall burst loss probability is verified through simulation experiments.     

Restoration in all-optical GMPLS networks with limited wavelength conversion

A new generation of optical components and the advance of the Generalized Multi-Protocol Label Switching (GMPLS) control plane supporting dynamic provisioning and restoration of optical connections (i.e., lightpaths), brings the vision of the dynamic all-optical network closer to reality. An emerging technology is the conversion between wavelengths, which removes the wavelength continuity constraint, thus allowing an easier and more flexible connection allocation. A limitation in the number of wavelength converters impairs their benefits especially during the restoration phase, when many simultaneous recovery attempts must share residual resources.This paper investigates the restoration performance of GMPLS-controlled all-optical networks with limited wavelength converter deployment. We investigate how different restoration methods, namely span restoration, segment restoration, and end-to-end restoration are affected by the availability of a limited number of wavelength converters at each node. For this purpose an enhanced wavelength assignment scheme compliant with GMPLS signaling is exploited, aiming at saving converters by assigning a higher preference to wavelengths not requiring conversion. An extensive simulation study has been conducted comparing the performance of this scheme to the most advanced scheme based on standard GMPLS signaling for the three restoration methods.Simulation results show that the enhanced wavelength assignment scheme significantly reduces the number of wavelength converters (WCs) necessary to achieve good recovery performance. The enhanced scheme especially improves span restoration performance, where the matching between the stubs’ and recovery segment wavelength may require a WC. End-to-end restoration is the least affected, due to a higher degree of freedom in the route choice, while segment restoration performance lies in between.     

分布式功能块控制应用的性能分析

IEC61499功能块逐渐被工业采纳。本文针对分布式功能块控制应用（DFBCA）缺乏性能分析方法的情况，提出了一种基于随机Petri网的DFBCA性能分析方法。该方法以DFBCA的运行状态为着手点，利用Petri网易于表示系统中可能发生的各种状态变化及其关系的特点，将DFBCA转换为随机Petri网模型。再利用随机Petri网模型与马尔可夫链（MC）同构的特征，将随机Petri网模型转换为MC。得到的MC为DFBCA的性能分析提供了数学基础。最后基于MC的状态转移矩阵和稳态概率，对在每个状态中的驻留时间、变迁的利用率、变迁的标记流速、子系统延时时间等性能指标进行了分析。通过具体的示例说明了这种性能分析方法的可行性。     

基于Markov链模型的MANET连通性分析

提出一种基于Markov链模型的移动Ad hoc网络（MANET）连通性分析方法。建立节点可靠性分析的Markov链模型,使之便于计算节点的可靠性概率。基于此,建立网络剩余节点数以及故障节点数状态转移的Markov链模型,并推导出计算节点随机网络连通概率的公式。通过Matlab仿真验证了理论分析的正确性。     

基于ACO和SPN的FMS故障诊断和可用性评价方法

提出一种柔性制造系统(FMS)的故障诊断和可用性评价方法;针对传统的随机Petri网在解决FMS故障诊断上极大受限于底层马尔科夫链规模而容易产生状态爆炸的问题,首先,将蚁群优化算法(ACO)融入随机有色网(SPN)中,提出并定义了一种能对柔性制造系统的故障进行诊断的诊断器;然后,通过马尔科夫链计算制造单元的可用性,得到FMS到诊断器的映射,从而可以得到FMS中所有可能生产过程;最后,在经典FMS可用性评价方法的基础上,引入覆盖因子,提出了一种新的对FMS生产过程进行可用性评价的方法;仿真实验显示了覆盖因子对系统可用性的影响,通过与传统方法进行比较,表明覆盖因子越大,FMS的可用性越高。     

无线传感器网络无标度容错拓扑的连锁故障诊断算法

针对随机节点故障所引发的连锁故障问题,为了尽可能地降低连锁故障对无线传感器网络所造成的损害,提出了一种无线传感器网络无标度容错拓扑的连锁故障诊断算法,该算法基于单一节点故障时负载重新分配给相邻节点的情况,提出一种连锁故障下的负载再分配模型,分析了单一节点故障时所产生的连锁故障规模。采用相邻节点的连锁故障诊断算法来研究传感器网络的负载参数和连锁故障规模之间的关系,尽可能地减少连锁故障所带来的节点损失。仿真结果表明,该算法有效地抑制了由于负载过大所引发的连锁负载效应,在减少网络节点的损失上起到了较好的效果。     

一种IPMCS的实时性评估方法

针对缺少对工业过程测量和控制系统(IPMCS)实时性评估研究的情况,提出了一种利用随机Petri网评估IPMCS实时性的方法.首先利用FB为IPMCS建模,转换为SPN模型;然后利用SPN模型与马尔可夫链(MC)同构的特征,转换为MC.最后基于MC的状态转移矩阵和稳态概率,对IPMCS的实时性进行评估,得到了量化的实时性数据.以具体示例的形式来说明如何对IPMCS的实时性进行评估.这种方法能给出量化的实时性数据,可以为IPMCS的设计提供参考.     

WSN中一种目标追踪在线节点调度算法

针对目标追踪无线传感器网络节点能量有限、感知信息存在不确定性等问题,提出一种基于部分可观察马尔可夫决策过程的在线节点调度算法。通过状态转移函数和观察函数描述移动目标的不确定性,根据奖赏函数平衡追踪性能和节点能量消耗,并构造有限深度的可达信念与或树降低运算复杂度,实现调度策略在线求解。实验结果表明,该算法能平衡目标追踪质量与节点能量消耗,且满足实时性 要求。     

Shared-per-wavelength asynchronous optical packet switching: A comparative analysis

This paper compares four different architectures for sharing wavelength converters in asynchronous optical packet switches with variable-length packets. The first two architectures are the well-known shared-per-node (SPN) and shared-per-link (SPL) architectures, while the other two are the shared-per-input-wavelength (SPIW) architecture, recently proposed as an optical switch architecture in synchronous context only, which is extended here to the asynchronous scenario, and an original scheme called shared-per-output-wavelength (SPOW) architecture that we propose in the current article. We introduce novel analytical models to evaluate packet loss probabilities for SPIW and SPOW architectures in asynchronous context based on Markov chains and fixed-point iterations for the particular scenario of Poisson input traffic and exponentially distributed packet lengths. The models also account for unbalanced traffic whose impact is thoroughly studied. These models are validated by comparison with simulations which demonstrate that they are remarkably accurate. In terms of performance, the SPOW scheme provides blocking performance very close to the SPN scheme while maintaining almost the same complexity of the space switch, and employing less expensive wavelength converters. On the other hand, the SPIW scheme allows less complexity in terms of number of optical gates required, while it substantially outperforms the widely accepted SPL scheme. The authors therefore believe that the SPIW and SPOW schemes are promising alternatives to the conventional SPN and SPL schemes for the implementation of next-generation optical packet switching systems.     

分布式多媒体服务组合中的异常预测算法

为提高分布式多媒体服务组合系统中路径的健壮性和可靠性,提出一种基于Markov链和加权朴素贝叶斯分类器(WNBC)的异常预测算法。该算法利用Markov模型预测系统节点的资源状态信息,使用WNBC对预测的节点状态进行分类,以判断节点是否可能发生异常。实验结果表明,该算法能根据节点的状态信息预测系统节点的不同异常状态,性能较同类算法有较大的改善。     

Random generation of industrial pipelines’ data using Markov chain model

Random generation of data sets is a vital step in simulation modeling. It involves in generating the variation associated with the real system behavior. In the industrial fabrication of construction components, unique products such as pipelines are produced. The fabrication processes are dependent on pipelines features, and complexity; randomly generating pipelines structure is imperative in the simulation of such processes. This paper investigates the nature of industrial pipelines and proposes a Markov chain model to randomly generate pipelines data structure. The performance of Markov chain model was tested against real pipelines through a three-stage validation process. The validation process includes (1) a validation based on the number of components and the pipelines components correlation analysis, (2) clustering-based model validation, and (3) model validation using similarity distances between pipelines feature vectors. The Markov chain model was found to generate a reasonable pipelines data structure when compared with real pipelines. It was found that 89% of the generated pipelines share similar properties equivalent to 0.88 (a scale from 0 (not identical) to 1 (identical)) to 85.5% of the original pipelines.     

An SPN-Based Integrated Model for Web Prefetching and Caching

The World Wide Web has become the primary means for information dissemination. Due to the limited resources of the network bandwidth, users always suffer from long time waiting. Web prefetching and web caching are the primary approaches to reducing the user perceived access latency and improving the quality of services. In this paper, a Stochastic Petri Nets （SPN） based integrated web prefetching and caching model （IWPCM） is presented and the performance evaluation of IWPCM is made. The performance metrics, access latency, throughput, HR （hit ratio） and BHR （byte hit ratio） are analyzed and discussed. Simulations show that compared with caching only model （CM）, IWPCM can further improve the throughput, HR and BHR efficiently and reduce the access latency. The performance evaluation based on the SPN model can provide a basis for implementation of web prefetching and caching and the combination of web prefetching and caching holds the promise of improving the QoS of web systems.     

无线传感器网络能量最优的QoS路由发现方法

针对无线传感器网络的动态网络环境和节点能源受限,且通常无法补充的能源特性等不利因素,提出了一种可以实现能量最优的QoS路由发现方法。该方法利用节点选择机制和节点邻居表来建立满足QoS带宽需求的可供选择的节点集合,从而减少路由发现过程中的所要监测的节点数量。所提方法还构建了无线传感器网络的能量评价模型和节点能耗权重模型,使用遗传算法从可供选择的节点集合中构建可实现能量最优的QoS路由,自适应的实现对节点调度,从而延长无线传感器网络的寿命。通过实验仿真与分析,给出了实现无线传感器网络能量最优的遗传算法控制参数的选择区间。实验结果显示:该方法对无线传感器网络具有更好的适应性,且能保证其有更长的寿命。     

一种随机Petri网的模糊同构方法研究

随机Petri网（SPN）可以同构于一个连续时间马尔可夫链,但在进行系统性能分析时,其状态空间随着系统规模的增大而呈指数性增长,造成系统无法同构分析,结合模糊数学理论提出一种模糊同构（FIM）方法,该方法可以约简复杂状态空间以便同构分析,最后应用该方法分析欧洲列车控制系统（ETCS）在移动闭塞区间条件下无线通信的可靠性,以验证该方法的可行性。     

一种改进的Markov预测模型方法

马尔可夫（Markov）模型的链式结构简便易行,适合作为一个预测模型来预测用户的页面访问模式。针对Markov原始预测模型算法时间和空间高开销的缺点,引入聚类方法对模型进行改进,以有效降低原始Markov预测模型计算开销。改进的Markov模型虽较好地克服了原始Markov模型的缺陷,但在提高效率的同时,模型的预测准确度有所降低。不过由于是将高阶Markov模型类别预测和低阶Markov模型页面预测相结合,和原始低阶Markov模型页面预测相比,准确性具有一定优势。     

启用节点睡眠态的6LoWPAN网络节能研究

为了降低6LoWPAN网络节点能耗,本文提出了一种启用节点睡眠态的信道竞争接入机制:节点可于超帧退避期内适时睡眠和超帧睡眠期内睡眠。应用该机制对网络MAC协议建模,并对模型进行了数学推导。基于本模型,对节点平均能耗、网络数据包发送稳态概率和数据包服务时间进行了数学分析,并研究了协议参数NB和minBE对网络性能的影响。数学分析表明,该模型较好地描述了6LoWPAN网络信道竞争接入机制,该机制有效降低了节点的平均能耗,协议性能得到较大改善。     

基于马尔可夫链的IEEE802.15.4网络防丢包信道访问机制研究

为了降低802.15.4MAC层数据帧丢包率,在分析丢包率的原因基础上,提出了一种基于Markov链的信道竞争机制模型。通过对网络发送、退避和信道检测状态的稳态概率进行数学推导,研究了信道碰撞和数据帧的丢包率分析式;最后研究了参数数据包到达速率、节点数量、误码率、后退指数、后退等待次数对碰撞概率和丢包率的影响。实验结果表明,与节点无休眠态的802.15.4网络相比,节点丢包率平均降低了23.7%,模型较好地描述了提出的MAC层信道访问机制,合理的网络参数设置能够优化数据帧丢包率,研究结果对无线传感网的应用提供可靠传输优化参考。     

一种基于预取的集群服务器调度算法

针对集群服务器LARD调度算法只能利用已有缓存的问题，提出一种基于预取的算法Prefetch-LARD,该算法从Web访问日志中挖掘页面之间的转移概率，建立马尔科夫链模型，在调度请求时利用概率关系提前将下一次可能访问的文档从节点磁盘取到本地cache中，提高了请求的缓存命中率；算法还采用了加权的节点超载判断方法，以提高集群节点的负载均衡度，实验表明，在同样的测试环境下，Prefetch-LARD算法比LARD算法的缓存命中率提高26．9％，系统的吞吐量相应提高18．8％．     

Markowitz's mean-variance portfolio selection with regime switching: from discrete-time models to their continuous-time limits

We study a discrete-time version of Markowitz's mean-variance portfolio selection problem where the market parameters depend on the market mode (regime) that jumps among a finite number of states. The random regime switching is delineated by a finite-state Markov chain, based on which a discrete-time Markov modulated portfolio selection model is presented. Such models either arise from multiperiod portfolio selections or result from numerical solution of continuous-time problems. The natural connections between discrete-time models and their continuous-time counterpart are revealed. Since the Markov chain frequently has a large state space, to reduce the complexity, an aggregated process with smaller state-space is introduced and the underlying portfolio selection is formulated as a two-time-scale problem. We prove that the process of interest yields a switching diffusion limit using weak convergence methods. Next, based on the optimal control of the limit process obtained from our recent work, we devise portfolio selection strategies for the original problem and demonstrate their asymptotic optimality.     

A novel dynamic fault restoration mechanism using cluster allocation approach in WDM mesh networks

This work describes a novel distributed algorithm, called the Cluster Allocation Algorithm (CAA), for the restoration scheme in a WDM mesh network. The nodes search for neighboring nodes and establish the relationship between them to build numerous logical clusters. Each cluster has a unique manager, called Cluster Head (CH) that searches for routing path, wavelength assignment (RWA) and restoration paths upon receiving requests from its cluster members. Some clusters might comprise only one CH, and cluster members in each cluster can be directly connected to CH. The communication among clusters is also negotiated through the manager. The selected restoration path is pre-computed from the CH to the destination node with the minimum cost function. Therefore, restoration paths can be sought with quick assignment of wavelength routings when the link, node or channel failure occurs based on the status of traffic load, number of nodes and transmission time. The primary aim of this work is to use clusters near faults to share the restoration load throughout the mesh network. The system performance of the CAA is compared with p-cycle, double cycle and DMRA methodologies in terms of restoration time and non-restoration ratio.