國立虎尾科技大學 |

Introduction to Queueing Systems with Telecommunication Applications

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Introduction to Queueing Systems with Telecommunication Applications/ by László Lakatos, László Szeidl, Miklós Telek.
作者:	Lakatos, László.
其他作者:	Szeidl, László.
面頁冊數:	XVII, 559 p. 96 illus., 4 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Probabilities. -
電子資源:	https://doi.org/10.1007/978-3-030-15142-3
ISBN:	9783030151423

Introduction to Queueing Systems with Telecommunication Applications
Lakatos, László.

Introduction to Queueing Systems with Telecommunication Applications[electronic resource] /by László Lakatos, László Szeidl, Miklós Telek. - 2nd ed. 2019. - XVII, 559 p. 96 illus., 4 illus. in color.online resource.

Preface -- Introduction to probability theory -- Introduction to stochastic processes -- Markov chains -- Renewal and regenerative processes -- Markov chains with special structures -- Introduction to queueing systems -- Markovian queueing systems -- Non-Markovian queueing systems -- Queueing systems with structured Markov chains -- Queueing networks -- Applied queueing systems -- Functions and transforms -- Index.

The book is the extended and revised version of the 1st edition and is composed of two main parts: mathematical background and queueing systems with applications. The mathematical background is a self-containing introduction to the stochastic processes of the later studied queueing systems. It starts with a quick introduction to probability theory and stochastic processes and continues with chapters on Markov chains and regenerative processes. More recent advances of queueing systems are based on phase type distributions, Markov arrival processes and quasy birth death processes, which are introduced in the last chapter of the first part. The second part is devoted to queueing models and their applications. After the introduction of the basic Markovian (from M/M/1 to M/M/1//N) and non-Markovian (M/G/1, G/M/1) queueing systems, a chapter presents the analysis of queues with phase type distributions, Markov arrival processes (from PH/M/1 to MAP/PH/1/K). The next chapter presents the classical queueing network results and the rest of this part is devoted to the application examples. There are queueing models for bandwidth charing with different traffic classes, slotted multiplexers, media access protocols like Aloha and IEEE 802.11b, priority systems and retrial systems. An appendix supplements the technical content with Laplace and z transformation rules, Bessel functions and a list of notations. The book contains examples and exercises throughout and could be used for graduate students in engineering, mathematics and sciences. Reviews of first edition: "The organization of the book is such that queueing models are viewed as special cases of more general stochastic processes, such as birth-death or semi-Markov processes. … this book is a valuable addition to the queuing literature and provides instructors with a viable alternative for a textbook to be used in a one- or two-semester course on queueing models, at the upper undergraduate or beginning graduate levels." Charles Knessl, SIAM Review, Vol. 56 (1), March, 2014.

ISBN: 9783030151423

Standard No.: 10.1007/978-3-030-15142-3doiSubjects--Topical Terms:

527847
Probabilities.

LC Class. No.: QA273.A1-274.9

Dewey Class. No.: 519.2

Introduction to Queueing Systems with Telecommunication Applications
LDR:03942nam a22004215i 4500 001 1009757
003 DE-He213
005 20200705114947.0
007 cr nn 008mamaa
008 210106s2019 gw | s |||| 0|eng d
020 $a 9783030151423 $9 978-3-030-15142-3
024 7 $a 10.1007/978-3-030-15142-3 $2 doi
035 $a 978-3-030-15142-3
050 4 $a QA273.A1-274.9
050 4 $a QA274-274.9
072 7 $a PBT $2 bicssc
072 7 $a MAT029000 $2 bisacsh
072 7 $a PBT $2 thema
072 7 $a PBWL $2 thema
082 0 4 $a 519.2 $2 23
100 1 $a Lakatos, László. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1303766
245 1 0 $a Introduction to Queueing Systems with Telecommunication Applications $h [electronic resource] / $c by László Lakatos, László Szeidl, Miklós Telek.
250 $a 2nd ed. 2019.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2019.
300 $a XVII, 559 p. 96 illus., 4 illus. in color. $b online resource.
336 $a text $b txt $2 rdacontent
337 $a computer $b c $2 rdamedia
338 $a online resource $b cr $2 rdacarrier
347 $a text file $b PDF $2 rda
505 0 $a Preface -- Introduction to probability theory -- Introduction to stochastic processes -- Markov chains -- Renewal and regenerative processes -- Markov chains with special structures -- Introduction to queueing systems -- Markovian queueing systems -- Non-Markovian queueing systems -- Queueing systems with structured Markov chains -- Queueing networks -- Applied queueing systems -- Functions and transforms -- Index.
520 $a The book is the extended and revised version of the 1st edition and is composed of two main parts: mathematical background and queueing systems with applications. The mathematical background is a self-containing introduction to the stochastic processes of the later studied queueing systems. It starts with a quick introduction to probability theory and stochastic processes and continues with chapters on Markov chains and regenerative processes. More recent advances of queueing systems are based on phase type distributions, Markov arrival processes and quasy birth death processes, which are introduced in the last chapter of the first part. The second part is devoted to queueing models and their applications. After the introduction of the basic Markovian (from M/M/1 to M/M/1//N) and non-Markovian (M/G/1, G/M/1) queueing systems, a chapter presents the analysis of queues with phase type distributions, Markov arrival processes (from PH/M/1 to MAP/PH/1/K). The next chapter presents the classical queueing network results and the rest of this part is devoted to the application examples. There are queueing models for bandwidth charing with different traffic classes, slotted multiplexers, media access protocols like Aloha and IEEE 802.11b, priority systems and retrial systems. An appendix supplements the technical content with Laplace and z transformation rules, Bessel functions and a list of notations. The book contains examples and exercises throughout and could be used for graduate students in engineering, mathematics and sciences. Reviews of first edition: "The organization of the book is such that queueing models are viewed as special cases of more general stochastic processes, such as birth-death or semi-Markov processes. … this book is a valuable addition to the queuing literature and provides instructors with a viable alternative for a textbook to be used in a one- or two-semester course on queueing models, at the upper undergraduate or beginning graduate levels." Charles Knessl, SIAM Review, Vol. 56 (1), March, 2014.
650 0 $a Probabilities. $3 527847
650 0 $a Operations research. $3 573517
650 0 $a Management science. $3 719678
650 0 $a Computer system failures. $3 782237
650 0 $a Electrical engineering. $3 596380
650 1 4 $a Probability Theory and Stochastic Processes. $3 593945
650 2 4 $a Operations Research, Management Science. $3 785065
650 2 4 $a System Performance and Evaluation. $3 669346
650 2 4 $a Communications Engineering, Networks. $3 669809
700 1 $a Szeidl, László. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1303767
700 1 $a Telek, Miklós. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1303768
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030151416
776 0 8 $i Printed edition: $z 9783030151430
776 0 8 $i Printed edition: $z 9783030151447
856 4 0 $u https://doi.org/10.1007/978-3-030-15142-3
912 $a ZDB-2-SMA
912 $a ZDB-2-SXMS
950 $a Mathematics and Statistics (SpringerNature-11649)
950 $a Mathematics and Statistics (R0) (SpringerNature-43713)