Dissertation > Excellent graduate degree dissertation topics show
Some Research Results of Discrete Time Vacation Queueing System
Author: ZouZongBao
Tutor: WeiCaiMin
School: Shantou University
Course: Applied Mathematics
Keywords: vacation queueing embedded Markov chain supplementaryvariable stochastic decomposition
CLC: O226
Type: Master's thesis
Year: 2011
Downloads: 39
Quote: 0
Read: Download Dissertation
Abstract
|
Queuing theory in electronic communication, logistics management, transportation,medical assistance, banking service, production line, and many otherareas have widely application. In the 1970s, for effectively using idle time view,the thought of server taking vacation is introduced to the queuing system. thereare many reasons causing server taking vacation, such as the server engaging inauxiliary work and adding energy for the machine, or giving the machine maintenanceetc. In this M.D. thesis, we investigate three types discrete time vacationqueuing systems, including a discrete time Geom[x]/G/1 queueing with modifiedT vacation policy and set-up time, general randomized working vacationpolicy for a Geom/Geom/1 queueing and a discrete time Geom/G/1 queueingwith multiple adaptive vacations policy and general decrementing service rule.The main results obtained of this paper can be summarized as follows:In chapter 2, we discuss the discrete time Geom[x]/G/1 queueing with modifiedT vacation policy and set-up time. We derive the generating functions andthe mean values for the steady state system size and waiting time, and also getthe generating functions and expects of the busy period, vacation period andvacation cycle.Chapter 3 studies a discrete-time Geom/Geom/1 queueing with generalrandomized working vacation policy. By using the quasi birth and death chainand matrix-geometric solution approaches, we derive the generating functionsand the expected values of the steady state queue length and sojourn time.In addition, we obtain the generating functions and the average values of theregular busy period, busy cycle and vacation period.Chapter 4 studies a discrete time Geom/G/1 queueing with multiple adaptivevacations policy and general decrementing service rule. The generatingfunctions of the steady state queue length, waiting time and their stochasticdecomposition property are derived via the embedded Markov chain methodand regeneration cycle approach. Several common vacation policies are special cases of the vacation policy presented in this study, and some numerical resultsare shown to compare the mean queue length and waiting time of special cases.
|
Related Dissertations
- The Analysis Based on Discrete Time Queue with Working Vacation and Bulk Input,O226
- Stationary Analysis on the M/G/1 Queue with Single Working Vacation,O226
- Performance Analysis of Polling System with Multiple Gated Service,TN92
- Queues with Multiple Serving Policy,O226
- Discrete-time batch arrival vacation queuing system,O226
- The Discrete Time Queueing with Multiple Vacation and Batch Arrive,O226
- Research on Problems of M/G/1 Queue with Vacations,O226
- Research on Channel Access Algorithms for MBOA UWB MAC Systems,TN925
- The limited capacity variable Desk queuing system,O226
- Modeling, Analysis and Application of the Class I Sleep Mode in IEEE 802.16e,TN925.93
- With working vacations start time queuing M/M/1,O226
- Analysis for the M/M/1 Working Vacation Queue with Negative Customers,O226
- Analysis of M/M/1/WV Queueing System with Vacation Interruption N-Policy,O226
- Performance Evaluation for the Power Saving Class of Type III in IEEE 802.16E Based on "Switching Procedure",TN925
- The Discrete Time GEOM/G/1 Queue with Second Optional Service and Vacation,O226
- The Continuous Time Queue with Vacation and Set-Up Time and Second Optional Service,O226
- Stationary Theory of the M/G/1 Type Queueing System with Multiple Adaptive Vacation,TP301
- Several Researching Results of Stochatic Severice System and Stochastic Wave,O226
- Waiter multiple vacations N- policy M/G/1 queuing system,O226
- GI/M/1 QUEUE WITH SET-UP AND CLOSED-DOWN TIMES,O226
- There are generally discrete-time batch arrival retrial queue,O226
CLC: > Mathematical sciences and chemical > Mathematics > Operations Research > Queuing theory (random system)
© 2012 www.DissertationTopic.Net Mobile
|