The Structure of Departure Process and Optimal Control Strategy N^＊ for Geo/G/1 Discrete-Time Queue with Multiple Server Vacations and Min(N, V)-Policy

This paper considers the departure process and the optimal control strategy for a discretetime Geo/G/1 queueing model in which the system operates under the control of multiple server vacations and Min(N, V)-policy. Using the law of total probability decomposition, the renewal theory and the probability generating function technique, the transient and the steady-state probabilities that the server is busy at any epoch n^+ are derived. The authors also obtain the explicit expression of the probability generating function for the expected number of departures occurring in the time interval (0^+, n^+] from any initial state. Meanwhile, the relationship among departure process, server's state process and service renewal process in server busy period is found, which shows the special structure of departure process. Especially, some corresponding results of departure process for special discrete-time queues are directly gained by our results. Furthermore, the approximate expansion for calculating the expected number of departures is presented. In addition, some other important performance measures,including the expected length of server busy period, server's actual vacation period and busy cycle period etc., are analyzed. Finally, some numerical results are provided to determine the optimum value N*for minimizing the system cost under a given cost structure.

Performance Analysis of a Discrete-Time Queue with Working Breakdowns and Searching for the Optimum Service Rate in Working Breakdown Period

This paper deals with a discrete-time Geo/Geo/1 queueing system with working breakdowns in which customers arrive at the system in variable input rates according to the states of the server. The server may be subject to breakdowns at random when it is in operation. As soon as the server fails, a repair process immediately begins. During the repair period, the defective server still provides service for the waiting customers at a lower service rate rather than completely stopping service.We analyze the stability condition for the considered system. Using the probability generating function technique, we obtain the probability generating function of the steady-state queue size distribution.Also, various important performance measures are derived explicitly. Furthermore, some numerical results are provided to carry out the sensitivity analysis so as to illustrate the effect of different parameters on the system performance measures. Finally, an operating cost function is formulated to model a computer system and the parabolic method is employed to numerically find the optimum service rate in working breakdown period.

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.

Deterministic and Stochastic Fixed-Time Stability of Discrete-time Autonomous Systems

This paper studies deterministic and stochastic fixedtime stability of autonomous nonlinear discrete-time(DT)systems.Lyapunov conditions are first presented under which the fixed-time stability of deterministic DT systems is certified.Extensions to systems under deterministic perturbations as well as stochastic noise are then considered.For the former,sensitivity to perturbations for fixed-time stable DT systems is analyzed,and it is shown that fixed-time attractiveness results from the presented Lyapunov conditions.For the latter,sufficient Lyapunov conditions for fixed-time stability in probability of nonlinear stochastic DT systems are presented.The fixed upper bound of the settling-time function is derived for both fixed-time stable and fixed-time attractive systems,and a stochastic settling-time function fixed upper bound is derived for stochastic DT systems.Illustrative examples are given along with simulation results to verify the introduced results.

ANALYSIS OF DISCRETE-TIME QUEUES WITH BATCH RENEWAL INPUT AND MULTIPLE VACATIONS

This paper analyzes a discrete-time multiple vacations finite-buffer queueing system with batch renewal input in which inter-arrival time of batches are arbitrarily distributed. Service and vacation times are mutually independent and geometrically distributed. The server takes vacations when the system does not have any waiting jobs at a service completion epoch or a vacation completion epoch. The system is analyzed under the assumptions of late arrival system with delayed access and early arrival system. Using the supplementary variable and the imbedded Markov chain techniques, the authors obtain the queue-length distributions at pre-arrival, arbitrary and outside observer＇s ob- servation epochs for partial-batch rejection policy. The blocking probability of the first, an arbitrary- and the last-job in a batch have been discussed. The analysis of actual waiting-time distributions measured in slots of the first, an arbitrary- and the last-job in an accepted batch, and other performance measures along with some numerical results have also been investigated.

Event-Triggered Finite-Time H∞ Filtering for Discrete-Time Nonlinear Stochastic Systems

This paper addresses the problem of event-triggered finite-time H∞ filter design for a class of discrete-time nonlinear stochastic systems with exogenous disturbances. The stochastic Lyapunov-Krasoviskii functional method is adopted to design a filter such that the filtering error system is stochastic finite-time stable (SFTS) and preserves a prescribed performance level according to the pre-defined event-triggered criteria. Based on stochastic differential equations theory, some sufficient conditions for the existence of H∞ filter are obtained for the suggested system by employing linear matrix inequality technique. Finally, the desired H∞ filter gain matrices can be expressed in an explicit form.

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.

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 Maintenance Service Improvement Approach Based on Queue Networks: Application

The quest to increase the performance of production systems that have become complex leads to the transfer to the maintenance function of the responsibility of guaranteeing the availability of such systems. Also, we will never stop saying that maintenance must integrate into all of the company’s initiatives, to affirm its role, which is to ensure greater availability and sustainability of the means of production. The objective of this paper is to evaluate the reliability and availability of a system without knowing the distribution law of the operating times. Among the methods for evaluating dependability criteria (Fault Trees, Petri Nets, etc.), we are interested in queues that have the advantage of taking into account functional dependencies, thus allowing a quantified optimization of maintenance. Indeed, queues make it possible to model parallel or sequential processes, implementing operations taking place at the same time or one after the other, meeting the needs of modeling production systems. The main result of this paper is the study of the influence of availability on the reliability of a multi-state production system.

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.

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.

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.