ANALYTICAL MODELS BASED DISCRETE-TIME QUEUEING FOR THE CONGESTED NETWORK

Congestion is one of the well-studied problems in computer networks,which occurs when the request for network resources exceeds the buffer capacity.Many active queue management techniques such as BLUE and RED have been proposed in the literature to control congestions in early stages.In this paper,we propose two discrete-time queueing network analytical models to drop the arrival packets in preliminary stages when the network becomes congested.The first model is based on Lambda Decreasing and it drops packets from a probability value to another higher value according to the buffer length.Whereas the second proposed model drops packets linearly based on the current queue length.We compare the performance of both our models with the original BLUE in order to decide which of these methods offers better quality of service.The comparison is done in terms of packet dropping probability,average queue length,throughput ratio,average queueing delay,and packet loss rate.

Effects of pooling,specialization,and discretionary task completion on queueing performance

Pooling,unpooling/specialization,and discretionary task completion are typical operational strategies in queueing systems that arise in healthcare,call centers,and online sales.These strategies may have advantages and disadvantages in different operational environments.This paper uses the M/M/1 and M/M/2 queues to study the impact of pooling,specialization,and discretionary task completion on the average queue length.Closed-form solutions for the average M/M/2 queue length are derived.Computational examples illustrate how the average queue length changes with the strength of pooling,specialization,and discretionary task completion.Finally,several conjectures are made in the paper.

A Complete and Simple Solution to a Discrete-Time Finite-Capacity BMAP/D/c Queue

We consider a discrete-time multi-server finite-capacity queueing system with correlated batch arrivals and deterministic service times (of single slot), which has a variety of potential applications in slotted digital telecommunication systems and other related areas. For this queueing system, we present, based on Markov chain analysis, not only the steady-state distributions but also the transient distributions of the system length and of the system waiting time in a simple and unified manner. From these distributions, important performance measures of practical interest can be easily obtained. Numerical examples concerning the superposition of certain video traffics are presented at the end.

Discrete-time Markov-based dynamic control approach for compressed sampling

To solve the problem that the signal sparsity level is time-varying and not known as a priori in most cases,a signal sparsity level prediction and optimal sampling rate determination scheme is proposed.The discrete-time Markov chain is used to model the signal sparsity level and analyze the transition between different states.According to the current state,the signal sparsity level state in the next sampling period and its probability are predicted.Furthermore,based on the prediction results,a dynamic control approach is proposed to find out the optimal sampling rate with the aim of maximizing the expected reward which considers both the energy consumption and the recovery accuracy.The proposed approach can balance the tradeoff between the energy consumption and the recovery accuracy.Simulation results show that the proposed dynamic control approach can significantly improve the sampling performance compared with the existing approach.

TRANSIENT SOLUTION FOR QUEUE-LENGTH DISTRIBUTION OF Geometry/G/1 QUEUEING MODEL

In this paper, the Geometry/G/1 queueing model with inter-arrival times generated by a geometric（parameter p） distribution according to a late arrival system with delayed access and service times independently distributed with distribution {gj }, j≥ 1 is studied. By a simple method （techniques of probability decomposition, renewal process theory） that is different from the techniques used by Hunter（1983）, the transient property of the queue with initial state i（i ≥ 0） is discussed. The recursion expression for u -transform of transient queue-length distribution at any time point n^＋ is obtained, and the recursion expression of the limiting queue length distribution is also obtained.

A NEW AND DIRECT METHOD OF ANALYSIS THE DEPARTURE PROCESSES OF SINGLE SERVER QUEUEING SYSTEMS

In this paper, using the stochastic decomposition and renewal theory we provide the direct method for analysis the departure process of single sever M/G/1 queueing system, and further discuss the departure process of GI/G/1 queueing system. The method provided in this paper is new and concise, which make us see dearly the structure of the departure process of a single server queueing system.

The queueing model for quantum key distribution network

This paper develops a QKD （quantum key distribution）-based queueing model to investigate the data delay on QKD link and network, especially that based on trusted relays. It shows the mean packet delay performance of the QKD system. Furthermore, it proposes a key buffering policy which could effectively improve the delay performance in practice. The results will be helpful for quality of service in practical QKD systems.

A novel reaching law approach of quasi-sliding-mode control for uncertain discrete-time systems

A novel discrete-time reaching law was proposed for uncertain discrete-time system,which contained process noise and measurement noise.The proposed method reserves all the advantages of discrete-time reaching law,which not only decreases the band width of sliding mode and strengthens the system robustness,but also improves the dynamic performance and stability capability of the system.Moreover,a discrete-time sliding mode control strategy based on Kalman filter method was designed,and Kalman filter was employed to eliminate the influence of system noise.Simulation results show that there is no chattering phenomenon in the output of controller and the state variables of controlled system,and the proposed algorithm is also feasible and has strong robustness to external disturbances.

Attitude sensor fault diagnosis based on Kalman filter of discrete-time descriptor system

To diagnose the fault of attitude sensors in satellites, this paper proposes a novel approach based on the Kalman filter of the discrete-time descriptor system. By regarding the sensor fault term as the auxiliary state vector, the attitude measurement system subjected to the attitude sensor fault is modeled by the discrete-time descriptor system. The condition of estimability of such systems is given. And then a Kalman filter of the discrete-time descriptor system is established based on the methodology of the maximum likelihood estimation. With the descriptor Kalman filter, the state vector of the original system and sensor fault can be estimated simultaneously. The proposed method is able to esti-mate an abrupt sensor fault as well as the incipient one. Moreover, it is also effective in the multiple faults scenario. Simulations are conducted to confirm the effectiveness of the proposed method.

FUNCTIONAL ANALYSIS METHOD FOR THE M/G/1 QUEUEING MODEL WITH OPTIONAL SECOND SERVICE

By studying the spectral properties of the underlying operator corresponding to the M/G/1 queueing model with optional second service we obtain that the time-dependent solution of the model strongly converges to its steady-state solution. We also show that the time-dependent queueing size at the departure point converges to the corresponding steady-state queueing size at the departure point.

Adaptive Control and Function Projective Synchronization in 2D Discrete-Time Chaotic Systems

This study addresses the adaptive control and function projective synchronization problems between 2D Rulkov discrete-time system and Network discrete-time system. Based on backstepping design with three controllers, a systematic, concrete and automatic scheme is developed to investigate the function projective synchronization of discretetime chaotic systems. In addition, the adaptive control function is applied to achieve the state synchronization of two discrete-time systems. Numerical results demonstrate the effectiveness of the proposed control scheme.

LMI-based robust control of uncertain discrete-time piecewise affine systems

The main contribution of this paper is to present stability synthesis results for discrete-time piecewise affine （PWA） systems with polytopic time-varying uncertainties and for discrete-time PWA systems with norm-bounded uncertainties respectively.The basic idea of the proposed approaches is to construct piecewise-quadratic （PWQ） Lyapunov functions to guarantee the stability of the closed-loop systems.The partition information of the PWA systems is taken into account and each polytopic operating region is outer approximated by an ellipsoid,then sufficient conditions for the robust stabilization are derived and expressed as a set of linear matrix inequalities （LMIs）.Two examples are given to illustrate the proposed theoretical results.

Approximation law for discrete-time variable structure control systems

Two approximation laws of sliding mode for discrete-time variable structure control systems are proposed to overcome the limitations of the exponential approximation law and the variable rate approximation law. By applying the proposed approximation laws of sliding mode to discrete-time variable structure control systems, the stability of origin can be guaranteed, and the chattering along the switching surface caused by discrete-time variable structure control can be restrained effectively. In designing of approximation laws, the problem that the system control input is restricted is also considered, which is very important in practical systems. Finally a simulation example shows the effectiveness of the two approximation laws proposed.

LMI Consensus Condition for Discrete-time Multi-agent Systems

This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all agents to the same vector. The design condition is expressed in the form of a linear matrix inequality. Finally, a simulation example is presented and a comparison is made to demonstrate the effectiveness of the developed methodology.

Stability analysis and stabilization for discrete-time singular delay systems

Stability analysis and stabilization for discrete-time singular delay systems are addressed,respectively.Firstly,a sufficient condition for regularity,causality and stability for discrete-time singular delay systems is derived.Then,by applying the skill of matrix theory,the state feedback controller is designed to guarantee the closed-loop discrete-time singular delay systems to be regular,casual and stable.Finally,numerical examples are given to demonstrate the effectiveness of the proposed method.

Variable structure control with sliding mode prediction for discrete-time nonlinear systems

A new variable structure control algorithm based on sliding mode prediction for a class of discrete-time nonlinear systems is presented. By employing a special model to predict future sliding mode value, and combining feedback correction and receding horizon optimization methods which are extensively applied on predictive control strategy, a discrete-time variable structure control law is constructed. The closed-loop systems are proved to have robustness to uncertainties with unspecified boundaries. Numerical simulation and pendulum experiment results illustrate that the closed-loop systems possess desired performance, such as strong robustness, fast convergence and chattering elimination.

Discrete-time movement model of a group of trains on a rail line with stochastic disturbance

This paper presents a discrete-time model to describe the movements of a group of trains, in which some operational strategies, including traction operation, braking operation and impact of stochastic disturbance, are defined. To show the dynamic characteristics of train traffic flow with stochastic disturbance, some numerical experiments on a railway line are simulated. The computational results show that the discrete-time movement model can well describe the movements of trains on a rail line with the moving-block signalling system. Comparing with the results of no disturbance, it finds that the traffic capacity of the rail line will decrease with the influence of stochastic disturbance. Additionally, the delays incurred by stochastic disturbance can be propagated to the subsequent trains, and then prolong their traversing time on the rail line. It can provide auxiliary information for rescheduling trains When the stochastic disturbance occurs on the railway.

Robust stability and H-infinity control for uncertain discrete-time Markovian jump singular systems

The robust stability and stabilization, and H-infinity control problems for discrete-time Markovian jump singular systems with parameter uncertainties are discussed. Based on the restricted system equivalent （r.s.e.） transformation and by introducing new state vectors, the singular system is transformed into a discrete-time Markovian jump standard linear system, and the linear matrix inequality （LMI） conditions for the discrete-time Markovian jump singular systems to be regular, causal, stochastically stable, and stochastically stable with 7- disturbance attenuation are obtained, respectively. With these conditions, the robust state feedback stochastic stabilization problem and H-infinity control problem are solved, and the LMI conditions are obtained. A numerical example illustrates the effectiveness of the method given in the oaoer.

Suboptimal Robust Stabilization of Discrete-time Mismatched Nonlinear System

This paper proposes a discrete-time robust control technique for an uncertain nonlinear system. The uncertainty mainly affects the system dynamics due to mismatched parameter variation which is bounded by a predefined known function. In order to compensate the effect of uncertainty, a robust control input is derived by formulating an equivalent optimal control problem for a virtual nominal system with a modified costfunctional. To derive the stabilizing control law for a mismatched system, this paper introduces another control input named as virtual input. This virtual input is not applied directly to stabilize the uncertain system, rather it is used to define a sufficient condition. To solve the nonlinear optimal control problem, a discretetime general Hamilton-Jacobi-Bellman(DT-GHJB) equation is considered and it is approximated numerically through a neural network(NN) implementation. The approximated solution of DTGHJB is used to compute the suboptimal control input for the virtual system. The suboptimal inputs for the virtual system ensure the asymptotic stability of the closed-loop uncertain system. A numerical example is illustrated with simulation results to prove the efficacy of the proposed control algorithm.

Composite nonlinear feedback control for output regulation problem of linear discrete-time systems with input saturation

Transient performance for output regulation problems of linear discrete-time systems with input saturation is addressed by using the composite nonlinear feedback（CNF） control technique. The regulator is designed to be an additive combination of a linear regulator part and a nonlinear feedback part. The linear regulator part solves the regulation problem independently which produces a quick output response but large oscillations. The nonlinear feedback part with well-tuned parameters is introduced to improve the transient performance by smoothing the oscillatory convergence. It is shown that the introduction of the nonlinear feedback part does not change the solvability conditions of the linear discrete-time output regulation problem. The effectiveness of transient improvement is illustrated by a numeric example.