000			03723nam a22005175i 4500
001			978-1-4614-5317-8
003			DE-He213
005			20140220082819.0
007			cr nn 008mamaa
008			121214s2013 xxu| s |||| 0|eng d
020			_a9781461453178 _9978-1-4614-5317-8
024	7		_a10.1007/978-1-4614-5317-8 _2doi
050		4	_aQA273.A1-274.9
050		4	_aQA274-274.9
072		7	_aPBT _2bicssc
072		7	_aPBWL _2bicssc
072		7	_aMAT029000 _2bisacsh
082	0	4	_a519.2 _223
100	1		_aLakatos, Laszlo. _eauthor.
245	1	0	_aIntroduction to Queueing Systems with Telecommunication Applications _h[electronic resource] / _cby Laszlo Lakatos, Laszlo Szeidl, Miklos Telek.
264		1	_aBoston, MA : _bSpringer US : _bImprint: Springer, _c2013.
300			_aXI, 385 p. 91 illus. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_aonline resource _bcr _2rdacarrier
347			_atext file _bPDF _2rda
505	0		_aPreface -- 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 -- Exercises -- References.-.
520			_aThe book 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 studies 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, ATM switches, 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.
650		0	_aMathematics.
650		0	_aComputer system performance.
650		0	_aDistribution (Probability theory).
650		0	_aTelecommunication.
650	1	4	_aMathematics.
650	2	4	_aProbability Theory and Stochastic Processes.
650	2	4	_aOperations Research, Management Science.
650	2	4	_aSystem Performance and Evaluation.
650	2	4	_aCommunications Engineering, Networks.
700	1		_aSzeidl, Laszlo. _eauthor.
700	1		_aTelek, Miklos. _eauthor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9781461453161
856	4	0	_uhttp://dx.doi.org/10.1007/978-1-4614-5317-8
912			_aZDB-2-SMA
999			_c95378 _d95378