AN INTRODUCTION TO COMMUNICATION NETWORK ANALYSIS; CONTENTS; Preface; 1 Review of Elementary Probability Theory; 2 Markov Chains; 3 Introduction to Queueing Theory; 4 Local Multiplexing; 5 Queueing networks with static routing; 6 Dynamic Routing and Routing with Incentives; 7 Peer-to-Peer File Sharing with Incentives; Appendix A: Additional Background on Routing; Appendix B: Solutions or References for Selected Problems; References
Summary
This book is a quantitative text, which focuses on the real issues behind serious modeling and analysis of communications networks. The author covers all the necessary mathematics and theory in order for students to understand the tools that optimize computer networks today. Covers both classical (e.g. queueing theory) and modern (e.g. pricing) aspects of networkingIntegrates material on communication networks with material on modeling/analyzing and designing such networksIncludes a Solution Manual
Bibliography
Includes bibliographical references (pages 221-232)