000 02212nam a22003258i 4500
001 CR9780511804410
003 UkCbUP
005 20200124160252.0
006 m|||||o||d||||||||
007 cr||||||||||||
008 101021s2008||||enk o ||1 0|eng|d
020 _a9780511804410 (ebook)
020 _z9780521884419 (hardback)
040 _aUkCbUP
_beng
_erda
_cUkCbUP
050 0 0 _aTK5105.5
_b.M49 2008
082 0 0 _a004.6
_222
100 1 _aMeyn, S. P.
_q(Sean P.),
_eauthor.
245 1 0 _aControl techniques for complex networks /
_cSean Meyn.
264 1 _aCambridge :
_bCambridge University Press,
_c2008.
300 _a1 online resource (xvi, 562 pages) :
_bdigital, PDF file(s).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
500 _aTitle from publisher's bibliographic system (viewed on 05 Oct 2015).
520 _aPower grids, flexible manufacturing, cellular communications: interconnectedness has consequences. This remarkable book gives the tools and philosophy you need to build network models detailed enough to capture essential dynamics but simple enough to expose the structure of effective control solutions. Core chapters assume only exposure to stochastic processes and linear algebra at undergraduate level; later chapters are for advanced graduate students and researchers/practitioners. This gradual development bridges classical theory with the state-of-the-art. The workload model at the heart of traditional analysis of the single queue becomes a foundation for workload relaxations used in the treatment of complex networks. Lyapunov functions and dynamic programming equations lead to the celebrated MaxWeight policy along with many generalizations. Other topics include methods for synthesizing hedging and safety stocks, stability theory for networks, and techniques for accelerated simulation. Examples and figures throughout make ideas concrete. Solutions to end-of-chapter exercises are available on a companion website.
650 0 _aComputer networks.
650 0 _aControl theory.
776 0 8 _iPrint version:
_z9780521884419
856 4 0 _uhttps://doi.org/10.1017/CBO9780511804410
999 _c519643
_d519641