000			02108nam a22002057a 4500
001			sulb0012253
003			BD-SySUS
005			20160421111301.0
008			160421s1992 ii a|||| |||| 001 0 eng d
040			_aDLC _bDLC _cDLC _dBD-SySUS
082	0	4	_a621.382 _222 _bRAT
100	1		_aRamabhadran, S. _916039
245	1	0	_aTelecommunications principles circuits and syatems / _cS. Ramabhadran
260			_aNew delhi : _bKhanna publishers, _cc1992.
300			_axxxvii 1410 p. : _bill. ; _c28 cm.
500			_aIncludes index
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			_aTelecommunication _915374
942			_2ddc _cBK
999			_c50644 _d50644