000			03434nam a22004095i 4500
001			978-0-387-22859-4
003			DE-He213
005			20250710083926.0
007			cr nn 008mamaa
008			100301s2005 xxu| s |||| 0|eng d
020			_a9780387228594 _a99780387228594
024	7		_a10.1007/b99875 _2doi
082	0	4	_a621.382 _223
100	1		_aDaigle, John N. _eauthor.
245	1	0	_aQueueing Theory with Applications to Packet Telecommunication _h[recurso electrónico] / _cby John N. Daigle.
264		1	_aBoston, MA : _bSpringer US, _c2005.
300			_aXXI, 316 p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_atext file _bPDF _2rda
505	0		_aTerminology and Examples -- Review of Random Processes -- Elementary Continuous-Time Markov Chain-Based Queueing Models -- Advanced Continuous-Time Markov Chain-Based Queueing Models -- The Basic M/G/1 Queueing System -- The M/G/1 Queueing System with Priority -- Vector Markov Chain Analysis: The M/G/1 and G/M/1 Paradigms -- Closing Remarks.
520			_aQueueing Theory with Applications to Packet Telecommunication is an efficient introduction to fundamental concepts and principles underlying the behavior of queueing systems and its application to the design of packet-oriented electrical communication systems. In addition to techniques and approaches found in earlier works, the author presents a thoroughly modern computational approach based on Schur decomposition. This approach facilitates solution of broad classes of problems wherein a number of practical modeling issues may be explored. Key features of communication systems, such as correlation in packet arrival processes at IP switches and variability in service rates due to fading wireless links are introduced. Numerous exercises embedded within the text and problems at the end of certain chapters that integrate lessons learned across multiple sections are also included. In all cases, including systems having priority, developments lead to procedures or formulae that yield numerical results from which sensitivity of queueing behavior to parameter variation can be explored. In several cases multiple approaches to computing distributions are presented. Queueing Theory with Applications to Packet Telecommunication is intended both for self study and for use as a primary text in graduate courses in queueing theory in electrical engineering, computer science, operations research, and mathematics. Professionals will also find this work invaluable because the author discusses applications such as statistical multiplexing, IP switch design, and wireless communication systems. In addition, numerous modeling issues, such as the suitability of Erlang-k and Pade approximations are addressed.
650		0	_aENGINEERING.
650		0	_aSTATISTICS.
650		0	_aTELECOMMUNICATION.
650	1	4	_aENGINEERING.
650	2	4	_aCOMMUNICATIONS ENGINEERING, NETWORKS.
650	2	4	_aSTATISTICS FOR ENGINEERING, PHYSICS, COMPUTER SCIENCE, CHEMISTRY & GEOSCIENCES.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9780387228570
856	4	0	_uhttp://dx.doi.org/10.1007/b99875 _zVer el texto completo en las instalaciones del CICY
912			_aZDB-2-ENG
942			_2ddc _cER
999			_c56116 _d56116