000			03486nam a22004815i 4500
001			978-0-387-49706-8
003			DE-He213
005			20250710084004.0
007			cr nn 008mamaa
008			110402s2009 xxu| s |||| 0|eng d
020			_a9780387497068 _a99780387497068
024	7		_a10.1007/ 978-0-387-49706-8 _2doi
100	1		_aLipsky, Lester. _eauthor.
245	1	0	_aQueueing Theory _h[recurso electrónico] : _bA Linear Algebraic Approach / _cby Lester Lipsky.
264		1	_aNew York, NY : _bSpringer New York, _c2009.
300			_aXXII, 554p. _bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_atext file _bPDF _2rda
505	0		_aM/M/1 Queue -- M E Functions -- M/G/1 Queue -- G/M/1 Queue -- M/G/-Type Systems -- G/G/1/N/Loop -- Semi Markov Process -- L A Q T.
520			_aQueueing Theory deals with systems where there is contention for resources, but the demands are only known probabilistically. This book can be considered as either a monograph or a textbook on the subject, and thus is aimed at two audiences. It can be useful for those who already know queueing theory, but would like to know more about the linear algebraic approach. It can also be used as a textbook in a first course on queueing theory for students who feel more comfortable with matrices and algebraic arguments than with probability theory. The equations are well-suited to easy computation. The text has much discussion on how various properties can be computed using any language that has built-in matrix operations (e.g., MATLAB, Mathematica, Maple). To help with physical insight, there are over 80 figures, numerous examples, and many exercises distributed throughout the book. There are over 50 books on queueing theory that are available today and most practitioners have several of them on their shelves. Because of its unusual approach, this book would be an excellent addition. It would also make a good supplement where another book was selected as the primary text for a course in system performance modelling. This second edition has been greatly expanded and updated thoughout, including a new chapter on semi-Markov processes and new material on representations of distributions. In particular, there is much discussion of power-tailed distributions and their effects on queues. Lester Lipsky is a professor in the Department of Computer Science and Engineering at the University of Connecticut.
650		0	_aMATHEMATICS.
650		0	_aCOMPUTER SOFTWARE.
650		0	_aINFORMATION SYSTEMS.
650		0	_aOPERATIONS RESEARCH.
650		0	_aDISTRIBUTION (PROBABILITY THEORY).
650		0	_aECONOMICS, MATHEMATICAL.
650	1	4	_aMATHEMATICS.
650	2	4	_aOPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING.
650	2	4	_aOPERATIONS RESEARCH/DECISION THEORY.
650	2	4	_aINFORMATION SYSTEMS AND COMMUNICATION SERVICE.
650	2	4	_aPROBABILITY THEORY AND STOCHASTIC PROCESSES.
650	2	4	_aGAME THEORY/MATHEMATICAL METHODS.
650	2	4	_aALGORITHM ANALYSIS AND PROBLEM COMPLEXITY.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9780387497044
856	4	0	_uhttps://link.springer.com/content/pdf/10.1007/978-0-387-49706-8.pdf _zVer el texto completo en las instalaciones del CICY
912			_aZDB-2-SMA
942			_2ddc _cER
999			_c57873 _d57873