<?xml version="1.0" encoding="UTF-8"?>
<record
    xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
    xsi:schemaLocation="http://www.loc.gov/MARC21/slim http://www.loc.gov/standards/marcxml/schema/MARC21slim.xsd"
    xmlns="http://www.loc.gov/MARC21/slim">

  <leader>02647cam a22002775a 4500</leader>
  <controlfield tag="001">18037158</controlfield>
  <controlfield tag="005">20160113144844.0</controlfield>
  <controlfield tag="008">140208s2014    enka     b    001 0 eng  </controlfield>
  <datafield tag="020" ind1=" " ind2=" ">
    <subfield code="a">9781107058606 (hardback)</subfield>
  </datafield>
  <datafield tag="040" ind1=" " ind2=" ">
    <subfield code="a">DLC</subfield>
    <subfield code="b">eng</subfield>
    <subfield code="c">DLC</subfield>
    <subfield code="d">DLC</subfield>
    <subfield code="d">EG-ScBUE</subfield>
  </datafield>
  <datafield tag="082" ind1="0" ind2="4">
    <subfield code="a">003.015192</subfield>
    <subfield code="2">22</subfield>
    <subfield code="b">VAN</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
    <subfield code="a">Van Mieghem, Piet.</subfield>
    <subfield code="9">37105</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
    <subfield code="a">Performance analysis of complex networks and systems /</subfield>
    <subfield code="c">Piet Van Mieghem.</subfield>
  </datafield>
  <datafield tag="260" ind1=" " ind2=" ">
    <subfield code="a">Cambridge : </subfield>
    <subfield code="b">Cambridge University Press, </subfield>
    <subfield code="c">c.2014.</subfield>
  </datafield>
  <datafield tag="300" ind1=" " ind2=" ">
    <subfield code="a">xvi, 675 p. :</subfield>
    <subfield code="b">ill. ;</subfield>
    <subfield code="c">26 cm.</subfield>
  </datafield>
  <datafield tag="500" ind1=" " ind2=" ">
    <subfield code="a">Index : p. 673-675.</subfield>
  </datafield>
  <datafield tag="504" ind1=" " ind2=" ">
    <subfield code="a">Bibliography : p. 663-672.</subfield>
  </datafield>
  <datafield tag="505" ind1="8" ind2=" ">
    <subfield code="a">Machine generated contents note: 1. Introduction; Part I. Probability Theory: 2. Random variables; 3. Basic distributions; 4. Correlation; 5. Inequalities; 6. Limit laws; Part II. Stochastic Processes: 7. The Poisson process; 8. Renewal theory; 9. Discrete-time Markov chains; 10. Continuous-time Markov chains; 11. Applications of Markov chains; 12. Branching processes; 13. General queueing theory; 14. Queueing models; Part III. Network Science: 15. General characteristics of graphs; 16. The shortest path problem; 17. Epidemics in networks; 18. The efficiency of multicast; 19. The hopcount and weight to an anycast group; Appendix A. A summary of matrix theory; Appendix B. Solutions to problems.</subfield>
  </datafield>
  <datafield tag="520" ind1=" " ind2=" ">
    <subfield code="a">"This rigorous, self-contained book describes mathematical and, in particular, stochastic and graph theoretic methods to assess the performance of complex networks and systems. It comprises three parts: the first is a review of probability theory; Part II covers the classical theory of stochastic processes (Poisson, Markov and queueing theory), which are considered to be the basic building blocks for performance evaluation studies; Part III focuses on the rapidly expanding new field of network science. This part deals with the recently obtained insight that many very different large complex networks - such as the Internet, World Wide Web, metabolic and human brain networks, utility infrastructures, social networks - evolve and behave according to general common scaling laws. This understanding is useful when assessing the end-to-end quality of Internet services and when designing robust and secure networks. Containing problems and solved solutions, the book is ideal for graduate students taking courses in performance analysis"--</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="7">
    <subfield code="a">System analysis</subfield>
    <subfield code="x">Mathematics.</subfield>
    <subfield code="2">BUEsh</subfield>
    <subfield code="9">39046</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="7">
    <subfield code="a">Computational complexity.</subfield>
    <subfield code="2">BUEsh</subfield>
    <subfield code="9">11175</subfield>
  </datafield>
  <datafield tag="650" ind1=" " ind2="7">
    <subfield code="a">Network analysis (Planning)</subfield>
    <subfield code="2">BUEsh</subfield>
    <subfield code="9">35688</subfield>
  </datafield>
  <datafield tag="651" ind1=" " ind2=" ">
    <subfield code="2">BUEsh</subfield>
  </datafield>
  <datafield tag="653" ind1=" " ind2=" ">
    <subfield code="b">COMSCI</subfield>
    <subfield code="c">July2015</subfield>
    <subfield code="c">January2016</subfield>
  </datafield>
  <datafield tag="942" ind1=" " ind2=" ">
    <subfield code="2">ddc</subfield>
  </datafield>
  <datafield tag="999" ind1=" " ind2=" ">
    <subfield code="c">20372</subfield>
    <subfield code="d">20344</subfield>
  </datafield>
  <datafield tag="952" ind1=" " ind2=" ">
    <subfield code="0">0</subfield>
    <subfield code="1">0</subfield>
    <subfield code="2">ddc</subfield>
    <subfield code="4">0</subfield>
    <subfield code="7">0</subfield>
    <subfield code="8">Baccah</subfield>
    <subfield code="a">MAIN</subfield>
    <subfield code="b">MAIN</subfield>
    <subfield code="c">LOW</subfield>
    <subfield code="d">2015-07-28</subfield>
    <subfield code="e">Purchase</subfield>
    <subfield code="g">1350.00</subfield>
    <subfield code="h">21759</subfield>
    <subfield code="l">0</subfield>
    <subfield code="o">003.015192 VAN</subfield>
    <subfield code="p">000030663</subfield>
    <subfield code="r">2025-07-15 00:00:00</subfield>
    <subfield code="v">1688.00</subfield>
    <subfield code="y">BB</subfield>
  </datafield>
</record>
