Welcome to P K Kelkar Library, Online Public Access Catalogue (OPAC)

Normal view MARC view ISBD view

An Introduction to Queueing Theory and Matrix-Analytic Methods

By: Breuer, L [author.].
Contributor(s): Baum, D [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookPublisher: Dordrecht : Springer Netherlands, 2005.Description: XIV, 272 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9781402036316.Subject(s): Mathematics | Computer communication systems | Computer system failures | Computers | Mathematical statistics | Mathematical models | Probabilities | Mathematics | Probability Theory and Stochastic Processes | Computer Communication Networks | Theory of Computation | System Performance and Evaluation | Probability and Statistics in Computer Science | Mathematical Modeling and Industrial MathematicsDDC classification: 519.2 Online resources: Click here to access online
Contents:
Queues: The Art of Modelling -- Markov Chains and Queues in Discrete Time -- Homogeneous Markov Processes on Discrete State Spaces -- Markovian Queues in Continuous Time -- Markovian Queueing Networks -- Renewal Theory -- Markov Renewal Theory -- Semi-Markovian Queues -- Phase-Type Distributions -- Markovian Arrival Processes -- The GI/PH/1 Queue -- The BMAP/G/1 Queue -- Discrete Time Approaches -- Spatial Markovian Arrival Processes.
In: Springer eBooksSummary: The present textbook contains the recordsof a two–semester course on que- ing theory, including an introduction to matrix–analytic methods. This course comprises four hours oflectures and two hours of exercises per week andhas been taughtattheUniversity of Trier, Germany, for about ten years in - quence. The course is directed to last year undergraduate and?rst year gr- uate students of applied probability and computer science, who have already completed an introduction to probability theory. Its purpose is to present - terial that is close enough to concrete queueing models and their applications, while providing a sound mathematical foundation for the analysis of these. Thus the goal of the present book is two–fold. On the one hand, students who are mainly interested in applications easily feel bored by elaborate mathematical questions in the theory of stochastic processes. The presentation of the mathematical foundations in our courses is chosen to cover only the necessary results, which are needed for a solid foundation of the methods of queueing analysis. Further, students oriented - wards applications expect to have a justi?cation for their mathematical efforts in terms of immediate use in queueing analysis. This is the main reason why we have decided to introduce new mathematical concepts only when they will be used in the immediate sequel. On the other hand, students of applied probability do not want any heur- tic derivations just for the sake of yielding fast results for the model at hand.
    average rating: 0.0 (0 votes)
Item type Current location Call number Status Date due Barcode Item holds
E books E books PK Kelkar Library, IIT Kanpur
Available EBK6365
Total holds: 0

Queues: The Art of Modelling -- Markov Chains and Queues in Discrete Time -- Homogeneous Markov Processes on Discrete State Spaces -- Markovian Queues in Continuous Time -- Markovian Queueing Networks -- Renewal Theory -- Markov Renewal Theory -- Semi-Markovian Queues -- Phase-Type Distributions -- Markovian Arrival Processes -- The GI/PH/1 Queue -- The BMAP/G/1 Queue -- Discrete Time Approaches -- Spatial Markovian Arrival Processes.

The present textbook contains the recordsof a two–semester course on que- ing theory, including an introduction to matrix–analytic methods. This course comprises four hours oflectures and two hours of exercises per week andhas been taughtattheUniversity of Trier, Germany, for about ten years in - quence. The course is directed to last year undergraduate and?rst year gr- uate students of applied probability and computer science, who have already completed an introduction to probability theory. Its purpose is to present - terial that is close enough to concrete queueing models and their applications, while providing a sound mathematical foundation for the analysis of these. Thus the goal of the present book is two–fold. On the one hand, students who are mainly interested in applications easily feel bored by elaborate mathematical questions in the theory of stochastic processes. The presentation of the mathematical foundations in our courses is chosen to cover only the necessary results, which are needed for a solid foundation of the methods of queueing analysis. Further, students oriented - wards applications expect to have a justi?cation for their mathematical efforts in terms of immediate use in queueing analysis. This is the main reason why we have decided to introduce new mathematical concepts only when they will be used in the immediate sequel. On the other hand, students of applied probability do not want any heur- tic derivations just for the sake of yielding fast results for the model at hand.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha