• Title: Basic Queueing Theory: Foundations of System Performance Modeling
• Author(s) Janos Sztrik
• Publisher: GlobeEdit (May 24, 2016); eBook (Draft, 2021)
• Hardcover/Paperback: 200 pages
• eBook: PDF (254 pages)
• Language: English
• ISBN-10/ASIN: 3639734718
• ISBN-13: 978-3639734713
• Share This:  

Book Description

Queueing Theory is one of the most commonly used mathematical tool for the performance evaluation of systems. The aim of the book is to present the basic methods, approaches in a Markovian level for the analysis of not too complicated systems.

The main purpose is to understand how models could be constructed and how to analyze them. It is intended not only for students of computer science, engineering, operation research, mathematics but also those who study at business, management and planning departments, too. It covers more than one semester and has been tested by graduate students at Debrecen University over the years.

It gives a very detailed analysis of the involved queueing systems by giving density function, distribution function, generating function, Laplace-transform, respectively.

• Professor Janos Sztrik is a Full Professor and Head of Department at Faculty of Informatics, University of Debrecen, Debrecen, Hungary. He is Doctor of the Hungarian Academy of Sciences, Budapest. His research interests are in the field of modelling and analysis info-communication systems, queueing theory with computer science applications, reliability theory.

• Amazon
• Amazon (Queueing Theory in Action)

• Operations Research and Optimization
• Probability, Stochastic Process, Queueing Theory, etc.
• Algorithms and Data Structures
• Combinatorics and Game Theory

• Basic Queueing Theory: Foundations of System Performance Modeling (Janos Sztrik)
• The Mirror Site (1) - PDF
• 2016 Edition - PDF

• Network Calculus: Deterministic Queuing Systems for the Internet

  Network Calculus is a set of recent developments that provide deep insights into flow problems encountered in the Internet and in intranets. It shows how it can be applied to the Internet to obtain results that have physical interpretations of practical importance.

• Statistical Analysis of Networks (Konstantin Avrachenkov, et al.)

  This book is a general introduction to the statistical analysis of networks. Numerous fundamental tools and concepts needed for the analysis of networks are presented, such as network modeling, community detection, etc.

• Design of Heuristic Algorithms for Hard Optimization

  This open access book demonstrates all the steps required to design heuristic algorithms for difficult optimization. The classic problem of the travelling salesman is used as a common thread to illustrate all the techniques discussed.

• Algorithms for Optimization (Mykel J. Kochenderfer, et al.)

  A comprehensive introduction to optimization with a focus on practical algorithms for the design of engineering systems. Readers will learn about computational approaches for a range of challenges.

• Convex Optimization (Stephen Boyd, et al.)

  On recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples in fields such as engineering, computer science, mathematics, statistics, finance, and economics.

• Optimization for Decision Making: Linear and Quadratic Models

  This book illustrates how to formulate real world problems using linear and quadratic models; It focus on developing modeling skills to support valid decision making for complex real world problems.

• Global Optimization Algorithms - Theory and Application

  This book is devoted to global optimization algorithms, which are methods to find optimal solutions for given problems. It especially focuses on Evolutionary Computation by discussing evolutionary algorithms, genetic algorithms, Genetic Programming, etc.

• Algorithms for Decision Making (Mykel Kochenderfer, et al)

  This textbook provides a broad introduction to algorithms for decision making under uncertainty, covering the underlying mathematical problem formulations and the algorithms for solving them.