Performance Analysis of Communications Networks and Systems
Piet Van Mieghem
- 出版商: Cambridge
- 出版日期: 2006-04-03
- 售價: $1,850
- 貴賓價: 9.8 折 $1,813
- 語言: 英文
- 頁數: 542
- 裝訂: Hardcover
- ISBN: 0521855152
- ISBN-13: 9780521855150
下單後立即進貨 (約5~7天)
買這商品的人也買了...
-
$550$523 -
$620$490 -
$650$507 -
$1,881$1,782 -
$490$382 -
$450$405 -
$680$578 -
$650$507 -
$620$484 -
$680$578 -
$580$458 -
$520$442 -
$880$695 -
$680$537 -
$450$356 -
$620$558 -
$780$616 -
$680$537 -
$720$569 -
$580$493 -
$650$514 -
$530$199 -
$420$357 -
$450$383 -
$490$417
相關主題
商品描述
This rigorous and self-contained book describes mathematical and, in particular, stochastic methods to assess the performance of networked systems. It consists of three parts. The first part is a review on probability theory. Part two covers the classical theory of stochastic processes (Poisson, renewal, Markov and queueing theory), which are considered to be the basic building blocks for performance evaluation studies. Part three focuses on the relatively new field of the physics of networks. This part deals with the recently obtained insights that many very different large complex networks - such the Internet, World Wide Web, proteins, utility infrastructures, social networks - evolve and behave according to more general common scaling laws. This understanding is useful when assessing the end-to-end quality of communications services, for example, in Internet telephony, real-time video and interacting games. Containing problems and solutions, this book is ideal for graduate students taking courses in performance analysis.
• Self-contained with problems and solutions for self-study
• Emphasis on rigorous mathematical derivations providing methods to solve real network problems analytically
• Some detailed proofs are given in footnote size to denote text that can be skipped at first reading
Table of Contents
1. Introduction; 2. Random variables; 3. Basic distributions; 4. Correlation; 5. Inequalities; 6. Limit laws; 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 queuing theory; 14. Queuing models; 15. General characteristics of graphs; 16. The shortest path problem; 17. The efficiency of multicast; 18. The hop count to an anycast group; Appendix A. Stochastic matrices; Appendix B. Algebraic graph theory; Appendix C. Solutions of problems; Bibliography; Index.
商品描述(中文翻譯)
這本嚴謹且自成體系的書籍描述了數學,特別是隨機方法,以評估網絡系統的性能。它分為三個部分。第一部分是對概率論的回顧。第二部分涵蓋了隨機過程的經典理論(如泊松過程、更新理論、馬可夫過程和排隊理論),這些被視為性能評估研究的基本構建塊。第三部分專注於相對較新的網絡物理學領域。這一部分探討了最近獲得的見解,即許多非常不同的大型複雜網絡——如互聯網、萬維網、蛋白質、公用事業基礎設施和社交網絡——根據更一般的共同縮放法則進化和行為。這種理解在評估通信服務的端到端質量時非常有用,例如在互聯網電話、實時視頻和互動遊戲中。本書包含問題和解答,對於修習性能分析課程的研究生來說,十分理想。
• 自成體系,包含自學用的問題和解答
• 強調嚴謹的數學推導,提供解決實際網絡問題的分析方法
• 一些詳細的證明以腳註大小給出,以標示可在首次閱讀時跳過的文本
目錄
1. 引言;2. 隨機變數;3. 基本分佈;4. 相關性;5. 不等式;6. 極限定理;7. 泊松過程;8. 更新理論;9. 離散時間馬可夫鏈;10. 連續時間馬可夫鏈;11. 馬可夫鏈的應用;12. 分支過程;13. 一般排隊理論;14. 排隊模型;15. 圖的基本特徵;16. 最短路徑問題;17. 多播的效率;18. 到任播組的跳數;附錄A. 隨機矩陣;附錄B. 代數圖論;附錄C. 問題解答;參考文獻;索引。