Maximum Entropy Approach for discrete-time unreliable server GeoX/Geo/1 queue with working vacation

2012 ◽  
Vol 4 (1) ◽  
pp. 56 ◽  
Author(s):  
Madhu Jain ◽  
G.C. Sharma ◽  
Richa Sharma
Keyword(s):  
Maximum Entropy ◽  
Discrete Time ◽  
Working Vacation ◽  
Unreliable Server

Choice of operator length for maximum entropy spectral analysis

Geophysics ◽  
1978 ◽  
Vol 43 (7) ◽  
pp. 1384-1391 ◽  
Author(s):  
James G. Berryman
Keyword(s):  
Time Series ◽  
Spectral Analysis ◽  
Maximum Entropy ◽  
Empirical Evidence ◽  
Discrete Time ◽  
Seismic Data ◽  
A Priori ◽  
Evidence Based ◽  
Maximum Entropy Spectral Analysis ◽  
Discrete Time Series

Empirical evidence based on maximum entropy spectra of real seismic data suggests that M = 2N/ln 2N is a reasonable a priori choice of the operator length M for discrete time series of length N. Various examples support this conclusion.

scholarly journals Performance Characteristics of Discrete-Time Queue With Variant Working Vacations

2020 ◽  
Vol 11 (2) ◽  
pp. 1-21
Author(s):  
P. Vijaya Laxmi ◽  
Rajesh P.
Keyword(s):  
Discrete Time ◽  
Cost Model ◽  
Probability Generating Function ◽  
System Size ◽  
Service Rate ◽  
Single Server ◽  
Working Vacation ◽  
Optimal Service ◽  
Working Vacations ◽  
Vacation Period

This article analyzes an infinite buffer discrete-time single server queueing system with variant working vacations in which customers arrive according to a geometric process. As soon as the system becomes empty, the server takes working vacations. The server will take a maximum number K of working vacations until either he finds at least on customer in the queue or the server has exhaustively taken all the vacations. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. The probability generating function of the steady-state probabilities and the closed form expressions of the system size when the server is in different states have been derived. In addition, some other performance measures, their monotonicity with respect to K and a cost model are presented to determine the optimal service rate during working vacation.

Analysis of a discrete-time working vacation queue with balking

OPSEARCH ◽  
2014 ◽  
Vol 52 (3) ◽  
pp. 562-581 ◽  
Author(s):  
P. Vijaya Laxmi ◽  
K. Jyothsna ◽  
D. Seleshi
Keyword(s):  
Discrete Time ◽  
Working Vacation

MAXIMUM ENTROPY AND DISCRETE TIME SOFTWARE RELIABILITY GROWTH MODELS

2010 ◽  
Vol 17 (06) ◽  
pp. 587-601
Author(s):  
PANLOP ZEEPHONGSEKUL ◽  
SHIGERU YAMADA
Keyword(s):  
Maximum Entropy ◽  
Discrete Time ◽  
Software Reliability ◽  
Growth Models ◽  
Preliminary Investigation ◽  
Maximum Entropy Principle ◽  
Reliability Growth ◽  
Entropy Principle ◽  
Software Reliability Growth ◽  
Interpolation Polynomials

This paper provides a preliminary investigation into the application of the Maximum Entropy Principle (MEP), introduced by Jaynes in 1957, in modeling discrete time Software Reliability Growth Model (SRGM). On their own, each of these two topics are interesting with extensive applications, and here we will show how they can be combined to provide yet another application of the MEP among a huge array of proven successful applications. A brief discussion of MEP and SRGM will be given and a hitherto unnoticed relationship between MEP distribution and the Lagrange interpolation polynomials highlighted. We then show how MEP can be used to obtain some important distributions arising from discrete time SRGM. Finally, a simple example is given to illustrate the theory.

Sign in / Sign up

Export Citation Format

Share Document