End-to-End Latency Evaluation of the Sat5G Network Based on Stochastic Network Calculus

Simultaneous use of heterogeneous radio access technologies to increase the performance of real-time,reliability and capacity is an inherent feature of satellite-5G integrated network(Sat5G).However,there is still a lack of theoretical characterization of whether the network can satisfy the end-to-end transmission performance for latency-sensitive service.To this end,we build a tandem model considering the connection relationship between the various components in Sat5G network architecture,and give an end-to-end latency calculation function based on this model.By introducing stochastic network calculus,we derive the relationship between the end-to-end latency bound and the violation probability considering the traffic characteristics of multimedia.Numerical results demonstrate the impact of different burst states and different service rates on this relationship,which means the higher the burst of arrival traffic and the higher the average rate of arrival traffic,the greater the probability of end-to-end latency violation.The results will provide valuable guidelines for the traffic control and cache management in Sat5G network.

Analysis of effect factors-based stochastic network planning model

Looking at all the indeterminate factors as a whole and regarding activity durations as independent random variables, the traditional stochastic network planning models ignore the inevitable relationship and dependence among activity durations when more than one activity is possibly affected by the same indeterminate factors. On this basis of analysis of indeterminate effect factors of durations, the effect factors-based stochastic network planning （EFBSNP） model is proposed, which emphasizes on the effects of not only logistic and organizational relationships, but also the dependent relationships, due to indeterminate factors among activity durations on the project period. By virtue of indeterminate factor analysis the model extracts and describes the quantitatively indeterminate effect factors, and then takes into account the indeterminate factors effect schedule by using the Monte Carlo simulation technique. The method is flexible enough to deal with effect factors and is coincident with practice. A software has been developed to simplify the model-based calculation, in VisualStudio.NET language. Finally, a case study is included to demonstrate the applicability of the proposed model and comparison is made with some advantages over the existing models.

Exploring reservoir computing:Implementation via double stochastic nanowire networks

Neuromorphic computing,inspired by the human brain,uses memristor devices for complex tasks.Recent studies show that self-organizing random nanowires can implement neuromorphic information processing,enabling data analysis.This paper presents a model based on these nanowire networks,with an improved conductance variation profile.We suggest using these networks for temporal information processing via a reservoir computing scheme and propose an efficient data encoding method using voltage pulses.The nanowire network layer generates dynamic behaviors for pulse voltages,allowing time series prediction analysis.Our experiment uses a double stochastic nanowire network architecture for processing multiple input signals,outperforming traditional reservoir computing in terms of fewer nodes,enriched dynamics and improved prediction accuracy.Experimental results confirm the high accuracy of this architecture on multiple real-time series datasets,making neuromorphic nanowire networks promising for physical implementation of reservoir computing.

Decentralized Semi-Supervised Learning for Stochastic Configuration Networks Based on the Mean Teacher Method

The aim of this paper is to broaden the application of Stochastic Configuration Network (SCN) in the semi-supervised domain by utilizing common unlabeled data in daily life. It can enhance the classification accuracy of decentralized SCN algorithms while effectively protecting user privacy. To this end, we propose a decentralized semi-supervised learning algorithm for SCN, called DMT-SCN, which introduces teacher and student models by combining the idea of consistency regularization to improve the response speed of model iterations. In order to reduce the possible negative impact of unsupervised data on the model, we purposely change the way of adding noise to the unlabeled data. Simulation results show that the algorithm can effectively utilize unlabeled data to improve the classification accuracy of SCN training and is robust under different ground simulation environments.

Synchronization of stochastic complex networks with time-delayed coupling

Noise and time delay are inevitable in real-world networks. In this article, the framework of master stability function is generalized to stochastic complex networks with time-delayed coupling. The focus is on the effects of noise, time delay,and their inner interactions on the network synchronization. It is found that when there exists time-delayed coupling in the network and noise diffuses through all state variables of nodes, appropriately increasing the noise intensity can effectively improve the network synchronizability;otherwise, noise can be either beneficial or harmful. For stochastic networks, large time delays will lead to desynchronization. These findings provide valuable references for designing optimal complex networks in practical applications.

On applying stochastic network calculus

Performance evaluation plays a crucial role in the design of network systems. Many theoretical tools, including queueing theory, effective bandwidth and network calculus, have been proposed to provide modeling mechanisms and resuits. While these theories have been widely adopted for performance evaluation, each has its own limitation. With that network systems have become more complex and harder to describe, where a lot of uncertainty and randomness exists, to make performance evaluation of such systems tractable, some compromise is often necessary and helpful. Stochas- tic network calculus （SNC） is such a theoretical tool. While SNC is a relatively new theory, it is gaining increasing interest and popularity. In the current SNC literature, much attention has been paid on the development of the theory itself. In addition, researchers have also started applying SNC to performance analysis of various types of systems in recent years. The aim of this paper is to provide a tutorial on the new theoretical tool. Specifically, various SNC traffic models and SNC server models are reviewed. The focus is on how to apply SNC, for which, four critical steps are formalized and discussed. In addition, a list of SNC application topics/areas, where there may exist huge research potential, is presented.

Data-flow in mobile edge computing networks: end-to-end performance analysis using stochastic network calculus

Mobile edge computing(MEC) networks can provide a variety of services for different applications. End-to-end performance analysis of these services serves as a benchmark for the efficient planning of network resource allocation and routing strategies. In this paper, a performance analysis framework is proposed for the end-to-end data-flows in MEC networks based on stochastic network calculus(SNC). Due to the random nature of routing in MEC networks, probability parameters are introduced in the proposed analysis model to characterize this randomness into the derived expressions. Taking actual communication scenarios into consideration, the end-to-end performance of three network data-flows is analyzed, namely, voice over Internet protocol(VoIP), video, and file transfer protocol(FTP). These network data-flows adopt the preemptive priority scheduling scheme. Based on the arrival processes of these three data-flows, the effect of interference on their performances and the service capacity of each node in the MEC networks, closed-form expressions are derived for showing the relationship between delay, backlog upper bounds, and violation probability of the data-flows. Analytical and simulation results show that delay and backlog performances of the data-flows are influenced by the number of hops in the network and the random probability parameters of interference-flow(IF).

Data driven particle size estimation of hematite grinding process using stochastic configuration network with robust technique

As a production quality index of hematite grinding process,particle size(PS)is hard to be measured in real time.To achieve the PS estimation,this paper proposes a novel data driven model of PS using stochastic configuration network(SCN)with robust technique,namely,robust SCN(RSCN).Firstly,this paper proves the universal approximation property of RSCN with weighted least squares technique.Secondly,three robust algorithms are presented by employing M-estimation with Huber loss function,M-estimation with interquartile range(IQR)and nonparametric kernel density estimation(NKDE)function respectively to set the penalty weight.Comparison experiments are first carried out based on the UCI standard data sets to verify the effectiveness of these methods,and then the data-driven PS model based on the robust algorithms are established and verified.Experimental results show that the RSCN has an excellent performance for the PS estimation.

Passivity analysis for uncertain stochastic neural networks with discrete interval and distributed time-varying delays

The problem of passivity analysis is investigated for uncertain stochastic neural networks with discrete interval and distributed time-varying delays.The parameter uncertainties are assumed to be norm bounded and the delay is assumed to be time-varying and belongs to a given interval,which means that the lower and upper bounds of interval time-varying delays are available.By constructing proper Lyapunov-Krasovskii functional and employing a combination of the free-weighting matrix method and stochastic analysis technique,new delay-dependent passivity conditions are derived in terms of linear matrix inequalities（LMIs）.Finally,numerical examples are given to show the less conservatism of the proposed conditions.

Stochastic synchronization for time-varying complex dynamical networks

This paper studies the stochastic synchronization problem for time-varying complex dynamical networks. This model is totally different from some existing network models. Based on the Lyapunov stability theory, inequality techniques, and the properties of the Weiner process, some controllers and adaptive laws are designed to ensure achieving stochastic synchronization of a complex dynamical network model. A sufficient synchronization condition is given to ensure that the proposed network model is mean-square stable. Theoretical analysis and numerical simulation fully verify the main results.

Pinning impulsive synchronization of stochastic delayed coupled networks

In this paper, the pinning synchronization problem of stochastic delayed complex network （SDCN） is investigated by using a novel hybrid pinning controller. The proposed hybrid pinning controller is composed of adaptive controller and impulsive controller, where the two controllers are both added to a fraction of nodes in the network. Using the Lyapunov stability theory and the novel hybrid pinning controller, some sufficient conditions are derived for the exponential synchronization of such dynamical networks in mean square. Two numerical simulation examples are provided to verify the effectiveness of the proposed approach. The simulation results show that the proposed control scheme has a fast convergence rate compared with the conventional adaptive pinning method.

Stability of stochastic neural networks with Markovian jumping parameters

The global asymptotical stability for a class of stochastic delayed neural networks （SDNNs） with Maxkovian jumping parameters is considered. By applying Lyapunov functional method and Ito＇s differential rule, new delay-dependent stability conditions are derived. All results are expressed in terms of linear matrix inequality （LMI）, and a numerical example is presented to illustrate the correctness and less conservativeness of the proposed method.

Global synchronization of general delayed complex networks with stochastic disturbances

In this paper, global synchronization of general delayed complex networks with stochastic disturbances, which is a zero-mean real scalar Wiener process, is investigated. The networks under consideration are continuous-time networks with time-varying delay. Based on the stochastic Lyapunov stability theory, Ito＇s differential rule and the linear matrix inequality （LMI） optimization technique, several delay-dependent synchronous criteria are established, which guarantee the asymptotical mean-square synchronization of drive networks and response networks with stochastic disturbances. The criteria are expressed in terms of LMI, which can be easily solved using the Matlab LMI Control Toolbox. Finally, two examples show the effectiveness and feasibility of the proposed synchronous conditions.

Stochastic Geometric Analysis of the Uplink Throughput in Cognitive Radio Cellular Networks

This paper investigates the uplink throughput of Cognitive Radio Cellular Networks(CRCNs).As oppose to traditional performance evaluation schemes which mainly adopt complex system level simulations,we use the theoretical framework of stochastic geometry to provide a tractable and accurate analysis of the uplink throughput in the CRCN.By modelling the positions of User Equipments(UEs)and Base Stations(BSs)as Poisson Point Processes(PPPs),we analyse and derive expressions for the link rate and the cell throughput in the Primary(PR)and Secondary(SR)networks.The expressions show that the throughput of the CRCN is mainly affected by the density ratios between the UEs and the BSs in both the PR and SR networks.Besides,a comparative analysis of the link rate between random and regular BS deployments is concluded,and the results confirm the accuracy of our analysis.Furthermore,we define the cognitive throughput gain and derive an expression which is dominated by the traffic load in the PR network.

Robust stability analysis for Markovian jumping stochastic neural networks with mode-dependent time-varying interval delay and multiplicative noise

This paper is concerned with the problem of robust stability for a class of Markovian jumping stochastic neural networks （MJSNNs） subject to mode-dependent time-varying interval delay and state-multiplicative noise. Based on the Lyapunov-Krasovskii functional and a stochastic analysis approach, some new delay-dependent sufficient conditions are obtained in the linear matrix inequality （LMI） format such that delayed MJSNNs are globally asymptotically stable in the mean-square sense for all admissible uncertainties. An important feature of the results is that the stability criteria are dependent on not only the lower bound and upper bound of delay for all modes but also the covariance matrix consisting of the correlation coefficient. Numerical examples are given to illustrate the effectiveness.

Information Fusing Recognition of Traditional Chinese Medicine (TCM) Pulse State Based on Stochastic Fuzzy Neural Network

Based on the fuzzy characteristic of the pulse state and syndromes differentiation thinking mode of TCM, an information fusing recognition method of pulse states based on SFNN (Stochastic Fuzzy Neural Network) is presented in this paper. With the learning ability in parameters and structure, SFNN fuses the measurement information of three pulse-state sensors distributed in Cun, Guan, and Chi location of body for the pulse state recognition. The experimental results show that the percentage of correct recognition with new method is higher than that by single-data recognition one, with fewer off-line train numbers.

Linear matrix inequality approach for robust stability analysis for stochastic neural networks with time-varying delay

This paper studies the problem of linear matrix inequality （LMI） approach to robust stability analysis for stochastic neural networks with a time-varying delay. By developing a delay decomposition approach, the information of the delayed plant states can be taken into full consideration. Based on the new Lyapunov-Krasovskii functional, some inequality techniques and stochastic stability theory, new delay-dependent stability criteria are obtained in terms of LMIs. The proposed results prove the less conservatism, which are realized by choosing new Lyapunov matrices in the decomposed integral intervals. Finally, numerical examples are provided to demonstrate the less conservatism and effectiveness of the proposed LMI method.

The Fuzzy Modeling Algorithm for Complex Systems Based on Stochastic Neural Network

A fuzzy modeling method for complex systems is studied. The notation of general stochastic neural network (GSNN) is presented and a new modeling method is given based on the combination of the modified Takagi and Sugeno's (MTS) fuzzy model and one-order GSNN. Using expectation-maximization(EM) algorithm, parameter estimation and model selection procedures are given. It avoids the shortcomings brought by other methods such as BP algorithm, when the number of parameters is large, BP algorithm is still difficult to apply directly without fine tuning and subjective tinkering. Finally, the simulated example demonstrates the effectiveness.

Stability and Stabilization on Generalized Delay Stochastic Neural Network with Distributed Parameter

Inner stability and stabilization of Cohen-Grossberg generalized delay stochastic neural network with distributed parameter are discussed. The main method adopted is, combining inequality techniques, to apply Ito differential formula to the constructed average function with respect to spatial variables along the system considered under the integral operator. Some sufficient conditions are given.

Registration algorithm for sensor alignment based on stochastic fuzzy neural network

Multiple sensor registration is an important link in multi-sensors data fusion. The existed algorithm is all based on the assumption that system errors come from a fixed deviation set. But there are many other factors, which can result system errors. So traditional registration algorithms have limitation. This paper presents a registration algorithm for sensor alignment based on stochastic fuzzy neural network (SNFF), and utilized fuzzy clustering algorithm obtaining the number of fuzzy rules. Finally, the simulative result illuminate that this way could gain a satisfing result.