ebook img

Applied Discrete-Time Queues PDF

400 Pages·2015·1.66 MB·English
Save to my drive
Quick download
Download
Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.

Preview Applied Discrete-Time Queues

Attahiru S. Alfa Applied Discrete- Time Queues Second Edition Applied Discrete-Time Queues Attahiru S. Alfa Applied Discrete-Time Queues Second Edition 123 AttahiruS.Alfa DepartmentofElectricaland ComputerEngineering UniversityofManitoba Winnipeg,Manitoba,Canada DepartmentofElectrical,Electronicand ComputerEngineering UniversityofPretoria Pretoria,SouthAfrica ISBN978-1-4939-3418-8 ISBN978-1-4939-3420-1 (eBook) DOI10.1007/978-1-4939-3420-1 LibraryofCongressControlNumber:2015955725 SpringerNewYorkHeidelbergDordrechtLondon ©SpringerScience+BusinessMediaNewYork2016 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartof thematerialisconcerned,specificallytherightsoftranslation,reprinting,reuseofillustrations,recitation, broadcasting,reproductiononmicrofilmsorinanyotherphysicalway,andtransmissionorinformation storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodology nowknownorhereafterdeveloped. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbook arebelievedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsor theeditorsgiveawarranty,expressorimplied,withrespecttothematerialcontainedhereinorforany errorsoromissionsthatmayhavebeenmade. Printedonacid-freepaper SpringerScience+BusinessMediaLLCNewYorkispartofSpringerScience+BusinessMedia(www. springer.com) Thisisdedicatedtoallwhohavesupported meinonewayoranotherduringmy academicjourney,andspecificallytoall my parents,mywife,mychildrenandmy grandchildren. Preface Thisbookstartedasacombinationoftwoofmyideas • Arevisiontothefirstbook,whichInowcallthefirstedition;QueueingTheory for Telecommunications: Discrete Time Modelling of a Single Node System, including rearrangement of material and corrections of errors that were found, and • Some new and significant additions that make the book more complete. The additionsare; 1. AnewchapteronSpecialsinglenodequeueingmodels,whichinclude;LCFS, SIRO,Pairformation,andFinitesourcequeue 2. AnewchapteronQueueswithTimeVaryingParameters 3. AnewchapteronTandemQueuesandQueueingNetworks 4. AnewchapteronOptimizationandControlofDiscreteTimeQueues 5. A new subsection on Review of Probability for Discrete Random Variables andMatrices 6. AnewsubsectiononCensoredMarkovChains 7. AnewsubsectiononSpecialTypesofQBDs 8. AnewsubsectiononPH/PH/1SystemwithStart-upTimes 9. AnewsubsectiononQueueswithVeryLargeBuffers 10. AnewsubsectiononGeo/G/∞Systems 11. AnAppendixforz−transformsandKroneckerproduct 12. Finally,theIntroductionisfullyexpanded. Intheend,ithasbecomeacompletelynewbookoranewedition;henceanew title to reflect the contents of the new edition. In the process of making some new additions to the material I have come to further realize that modelling a queueing system using discrete time approach is so practical, very realistic, very important in many systems such as telecommunications, and on top of all very exciting. There is always something interesting and subtle about each model in discrete time, especially the “book-keeping” aspect regarding order of event occurrences. For example when arrivals and service are the only two main events taking place vii viii Preface in a discrete-time queue we know that it is important to first decide how we order the events since theoretically they can occur at the same time. So, when the two eventsoccuratthesametimedowerecognizearrivalsbeforeservicecompletions or vice versa? This presents two choices, known in the literature as Late Arrivals andEarlyArrivals.Onecanpracticallydevelopamodelforeachoneofthem,even thoughitisnotnecessary.However,whenweaddsomeotherevents,forexample theoccurrenceofvacationsinvacationtypesofqueues,thenwehavesixpossible combinations. Try and figure out the six! You can see that it becomes complex, a bitchallengingbutactuallyrealistic.Wouldonethenneedtodevelopsixdifferent models?TheanswerisNO.Amodelshouldtryandcapturewhichofthesequences isactuallyusedinthesystemconsidered.Inthisbookweonlyselectonesequence each time and present the associated model. For a different sequence one can use thesameproceduredevelopedinthisbook. Most data are collected in discrete time, so to speak. In the end implementing queueing models for real life problems are carried out through numerical compu- tations,whicharebasedondigitaloperations.Evenifcontinuoustimemodelsare createdwecanseethatatthetwosupportingendsofthemodel,i.e.datacollection andimplementationoncomputers,arebothbasedondiscreteprocess.Continuous time models are nevertheless still very important especially when we want to understand the behaviours of a system, usually those that can be modelled nicely (possibly in closed form) to assist in revealing subtle behaviours that sometimes computational approaches can not bring out. Although this can also be achieved through discrete-time modelling of queueing systems, continuous time modelling seem to be more successful than discrete time in many of such cases. Hence this book is entitled “Applied Discrete Time Queues”. It is written for those who are lookingformodelstheycanapplytosolvingpracticalqueueing problemsorneed someideasregardinghowtodevelopsuchmodels. The list of objectives expected to be achieved in writing this book include providing: 1. basic material for modelling commonly occurring discrete-time queueing models. 2. sufficienttheoreticalbackgroundtoallowbuildingthemodelsandunderstanding thetoolsneededtobuildthem. 3. numericaltoolsneededtocomputethemeasuresusedtoassessqueueingsystems 4. ideasthatleadtofurtherquestionstoresearcherswhowishtopursuethisareaof work. The same philosophy that the first book was based on still applies in this new book; trying to show how to set up most queueing models using the concept of discrete time Markov chains (DTMC) and then guiding the reader to the tools in the literature that can be used for the analysis. As such a new chapter on numerical computations for DTMC has been created to avoid mixing the theory and computations of DTMC into the same chapter. Since the book is based on matrixanalysisanewchapteronmatrixrepresentationofdistributionshasalsobeen introduced. Preface ix Any corrections to errors found in the book will be posted to the following website:http://home.cc.umanitoba.ca/~alfa/adtq/index.html. Winnipeg,Manitoba,Canada AttahiruS.Alfa July2015

See more

The list of books you might like

Most books are stored in the elastic cloud where traffic is expensive. For this reason, we have a limit on daily download.