The Experts below are selected from a list of 312 Experts worldwide ranked by ideXlab platform
Yinghui Tang - One of the best experts on this subject based on the ideXlab platform.
-
A NEW AND DIRECT METHOD OF ANALYSIS THE Departure ProcessES OF SINGLE SERVER QUEUEING SYSTEMS
Acta Mathematica Scientia, 2018Co-Authors: Yinghui TangAbstract:Abstract 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 clearly the structure of the Departure Process of a single server queueing system.
-
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
Journal of Systems Science & Complexity, 2017Co-Authors: Yinghui TangAbstract: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.
-
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
Journal of Systems Science & Complexity, 2017Co-Authors: Yinghui TangAbstract: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.
-
on the transient Departure Process of m x g 1 queueing system with single server vacation
Journal of Systems Science & Complexity, 2007Co-Authors: Yinghui TangAbstract:This paper studies the transient Departure Process of Mx/G/1 queueing system with single server vacation. We present a simple probability decomposition method to derive the expected number of Departures occurring in finite time interval from any initial state and the asymptotic expansion of the expected number. Especially, we derive some more practical results for some special cases.
-
On The Transient Departure Process of M x /G/1 Queueing System with Single Server Vacation
Journal of Systems Science & Complexity, 2007Co-Authors: Yinghui TangAbstract:This paper studies the transient Departure Process of Mx/G/1 queueing system with single server vacation. We present a simple probability decomposition method to derive the expected number of Departures occurring in finite time interval from any initial state and the asymptotic expansion of the expected number. Especially, we derive some more practical results for some special cases.
Wojciech M Kempa - One of the best experts on this subject based on the ideXlab platform.
-
SoftCOM - Transient Departure Process in M/G/1/K-type queue with threshold server's waking up
2015 23rd International Conference on Software Telecommunications and Computer Networks (SoftCOM), 2015Co-Authors: Wojciech M Kempa, Dariusz KurzykAbstract:Time-dependent behavior of Departure Process in a finite-buffer M/G/1/K-type queueing system with threshold server's waking up is analysed. After each idle time a new busy period is being initialized simultaneously with the Nth arrival occurrence, where the threshold value N is fixed. By applying the approach being a mixture of different theoretical techniques: the idea of embedded Markov chain, Volterra type integral equations, continuous total probability law, renewal theory and linear algebra, a closed-form formula for the mixed double transform (probability generating function of Laplace transform) of the probability distribution of the number of packets completely Processed up to fixed time t is derived. The considered queueing system can be used in modeling the operation of a wireless sensor network (WSN) with power saving mechanism based on “queued” waking up of radio transmitters/receivers of nodes (sensors). An illustrating numerical example for a hypothetical network traffic is attached as well.
-
Study on time-dependent Departure Process in a finite-buffer queueing model with BMAP-type input stream
2015 IEEE 2nd International Conference on Cybernetics (CYBCONF), 2015Co-Authors: Wojciech M KempaAbstract:Transient Departure Process of outgoing packets in a finite-buffer queueing model with the BMAP-type input stream and generally distributed Processing times is investigated. Applying the paradigm of embedded Markov chain and the total probability law, a system of integral equations for the distribution function of the number of packets successfully Processed up to fixed time t; conditioned by the initial level of buffer saturation and the state of the underlying Markov chain, is obtained. The solution of the corresponding system written for the mixed double transforms is found in a compact form by utilizing the approach based on linear and matrix algebra. Remarks on numerical treatment of analytical results and computational example are attached as well.
-
CYBCONF - Study on time-dependent Departure Process in a finite-buffer queueing model with BMAP-type input stream
2015 IEEE 2nd International Conference on Cybernetics (CYBCONF), 2015Co-Authors: Wojciech M KempaAbstract:Transient Departure Process of outgoing packets in a finite-buffer queueing model with the BMAP-type input stream and generally distributed Processing times is investigated. Applying the paradigm of embedded Markov chain and the total probability law, a system of integral equations for the distribution function of the number of packets successfully Processed up to fixed time t; conditioned by the initial level of buffer saturation and the state of the underlying Markov chain, is obtained. The solution of the corresponding system written for the mixed double transforms is found in a compact form by utilizing the approach based on linear and matrix algebra. Remarks on numerical treatment of analytical results and computational example are attached as well.
-
Transient Departure Process in M/G/1/K-type queue with threshold server's waking up
2015 23rd International Conference on Software Telecommunications and Computer Networks (SoftCOM), 2015Co-Authors: Wojciech M Kempa, Dariusz KurzykAbstract:Time-dependent behavior of Departure Process in a finite-buffer M/G/1/K-type queueing system with threshold server's waking up is analysed. After each idle time a new busy period is being initialized simultaneously with the Nth arrival occurrence, where the threshold value N is fixed. By applying the approach being a mixture of different theoretical techniques: the idea of embedded Markov chain, Volterra type integral equations, continuous total probability law, renewal theory and linear algebra, a closed-form formula for the mixed double transform (probability generating function of Laplace transform) of the probability distribution of the number of packets completely Processed up to fixed time t is derived. The considered queueing system can be used in modeling the operation of a wireless sensor network (WSN) with power saving mechanism based on “queued” waking up of radio transmitters/receivers of nodes (sensors). An illustrating numerical example for a hypothetical network traffic is attached as well.
-
on transient Departure Process in a finite buffer queueing model with probabilistic packet dropping
APPLICATIONS OF MATHEMATICS IN ENGINEERING AND ECONOMICS (AMEE'14), 2014Co-Authors: Wojciech M KempaAbstract:Probabilistic packet dropping in dependence on the instantaneous buffer queue level at the pre-arrival epoch is one of Active Queue Management (AQM) mechanisms, used in IP routers for avoiding the risk of buffer overflow and for stabilizing the intensity of the input stream of packets. In the paper transient behavior of Departure Process h(t), counting packets which leave the service station before the fixed time t, is investigated in the GI/M/1/N queueing model with AQM-type probabilistic packet dropping. Using the approach based on the paradigm of embedded Markov chain and the total probability law, a system of Volterra integral equations for the distribution of h(t), conditioned by the number of packets present in the system initially, is obtained. The solution of the corresponding system written for 2-fold transforms of conditional distributions of h(t) is derived using the linear algebra approach. Illustrative numerical examples are attached as well.
Natarajan Gautam - One of the best experts on this subject based on the ideXlab platform.
-
Winter Simulation Conference - Characterizing the Departure Process from a two server Markovian queue: a non-renewal approach
2008 Winter Simulation Conference, 2008Co-Authors: Guy L. Curry, Natarajan GautamAbstract:For large queueing network analysis the general computational approach is to utilize decomposition to facilitate computational tractability. To accomplish this individual analysis the input and output streams must be characterized. This usually is done via two-parameter characterizations: the Process mean and a variance measure (most commonly the squared coefficient of variation SCV). In most approaches independent and identically distributed (i.i.d.) approximations are used. For multiple input streams and/or multiple (identical) servers, the assumptions of i.i.d. times between arrivals and, similarly, i.i.d. times between Departures are particularly theoretically and computationally inaccurate. In this paper we develop a generator for the background multidimensional continuous time Markov chain associated with the inter-Departure times for the associated multi-stream and multi-server Markovian queues (where inter-arrival times and service times are Coxian). This generator allows for the computation of the moments of the Departure Process and the lag-k correlations between successive k-separated Departures.
-
Characterizing the Departure Process from a two server Markovian queue: A non-renewal approach
2008 Winter Simulation Conference, 2008Co-Authors: Guy L. Curry, Natarajan GautamAbstract:For large queueing network analysis the general computational approach is to utilize decomposition to facilitate computational tractability. To accomplish this individual analysis the input and output streams must be characterized. This usually is done via two-parameter characterizations: the Process mean and a variance measure (most commonly the squared coefficient of variation SCV). In most approaches independent and identically distributed (i.i.d.) approximations are used. For multiple input streams and/or multiple (identical) servers, the assumptions of i.i.d. times between arrivals and, similarly, i.i.d. times between Departures are particularly theoretically and computationally inaccurate. In this paper we develop a generator for the background multidimensional continuous time Markov chain associated with the inter-Departure times for the associated multi-stream and multi-server Markovian queues (where inter-arrival times and service times are Coxian). This generator allows for the computation of the moments of the Departure Process and the lag-k correlations between successive k-separated Departures.
Richard Meili - One of the best experts on this subject based on the ideXlab platform.
-
a stationary poisson Departure Process from a minimally delayed infinite server queue with non stationary poisson arrivals
Journal of Applied Probability, 1997Co-Authors: John A Barnes, Richard MeiliAbstract:The points of a non-stationary Poisson Process with periodic intensity are independently shifted forward in time in such a way that the transformed Process is stationary Poisson. The mean shift is shown to be minimal. The approach used is to consider an MlG,0lc queueing system where the arrival Process is a non-stationary Poisson with periodic intensity function. A minimal service time distribution is constructed that yields a stationary Poisson Departure Process. POISSON Process; NON-STATIONARY POISSON Process; INFINITE SERVER QUEUE AMS 1991 SUBJECT CLASSIFICATION: PRIMARY 60G55; 60K25 SECONDARY 90B22
S. Singh - One of the best experts on this subject based on the ideXlab platform.
-
Modeling cell Departure for shared buffer ATM switch
ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220), 1998Co-Authors: S. Fong, S. SinghAbstract:The framework of the performance analysis for a buffered asynchronous transfer mode (ATM) switch usually consists of modeling the input traffic arrivals, the switching mechanism, and the cell Departure Process. The overall accuracy of the performance results relies on how accurately the cell Departure Process, especially for shared buffer switches is modelled. Unlike output buffer switches where there are at most one cell that can leave, multiple cells may depart from the shared buffer for shared buffer switches. Modeling the cell Departure Process is hence more complex for shared buffer switches. It is of practical interest and is challenging to find the appropriate probabilistic model to describe the cell Departure Process for shared buffer switches. This paper compares and verifies the accuracy of three models, including a new one called "Urn Model" proposed by the authors. These models are put under test in a performance evaluation of a shared buffer ATM switch, by using a discrete-time Markov chain. The numerical results are compared to the simulation, and they show that the Urn Model is a good compromise between accuracy and efficiency. This finding is significant because it helps to speed up running an analytical model of a large network while providing satisfactory accuracy.
-
Performance analysis of shared buffer ATM switch with different cell Departure models
1998 IEEE International Performance Computing and Communications Conference. Proceedings (Cat. No.98CH36191), 1998Co-Authors: S. Fong, S. SinghAbstract:The performance analysis of an asynchronous transfer mode (ATM) switch involves modeling the input traffic source, the switching mechanism, and the cell Departure Process. A main issue which determines the overall accuracy in performance evaluation of ATM switch, is the use of an appropriate probabilistic model to describe the cell Departure Process. Until now, little work has been done in the literature on characterizing the cell Departure Process for studying the performance of an ATM switch. This paper compares and verifies the accuracy of several models, including a new one called the "Urn model", which we propose. These models are put under test in a performance evaluation of a shared buffer ATM switch, by using a discrete-time Markov chain. The numerical results are compared to the simulation, and they show that the Urn model is a good compromise between accuracy and efficiency. This finding is significant because it helps to speed up the running of an analytical model of a large network while providing satisfactory accuracy.