Text

An introduction to communication network analysis

---

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 networking. Integrates material on communication networks with material on modeling/analyzing and designing such networks Includes a Solution Manual.

CONTENTS
1 Review of Elementary Probability Theory
1.1 Sample space, events and probabilities
1.2 Random variables
1.3 Cumulative distribution functions, expectation and moment generating
functions
1.4 Discretely distributed random variables
1.5 Continuously distributed random variables
1.6 Some useful inequalities
1.7 Joint distribution functions
1.8 Conditional expectation
1.9 Independent random variables
1.9.1 Sums of independent random variables
1.10 Conditional independence
1.11A law of large numbers
1.12 First order autoregressive estimators
1.13Measures of separation between distributions
1.14 Statistical confidence
1.14.1A central limit theorem
1.14.2Confidence intervals
1.14.3Recursive formulas and a stopping criterion
1.15Deciding between two alternative claims

2 Markov Chains
2.1 Memoryless property of the exponential distribution
2.2 Finite dimensional distributions and stationarity
2.3 The Poisson (counting) process on R+
2.4 Continuous-time, time-homogeneous, Markov processes with countable
state-space
2.5 Birth-death Markov chains
2.6 Modeling time-series data using a Markov chain
2.7 Simulating a Markov chain
2.8 Overview of discrete-time Markov chains
2.9 Martingales adapted to discrete-time Markov chains

3 Introduction to Queueing Theory
3.1 Arrivals, departures and queue occupancy
3.2 Lossless queues
3.3 A queue described by an underlying Markov chain
3.4 Stationary queues
3.5 Erlang?s blocking formula for the M/M/K/K queue
3.6 Overview of discrete-time queues

4 Local Multiplexing
4.1 Internet router architecture
4.2 Token (leaky) buckets for packet-traffic regulation
4.3 Multiplexing flows of variable-length packets
4.4 Service curves
4.5 Connection multiplexing on a single trunk
4.6 A game-theoretic framework for multiplexing packet flows
4.7 Discussion: local medium access control of a single wireless channel

5 Queueing networks with static routing
5.1 Loss Networks
5.2 Stable open networks of queues

6 Dynamic Routing with Incentives
6.1 General routing issues
6.2 Unconstrained optimization
6.3 Revenue maximization for loss networks
6.4 Constrained optimization and duality
6.5 A distributed pricing and resource management framework
6.6 Discussion: joint scheduling and routing in multihop wireless networks
6.7 Multipath load balancing

7 Peer-to-Peer File Sharing with Incentives
7.1 Summary of query resolution
7.2 Unstructured query resolution
7.3 Structured query resolution
7.4 Discussion: security issues
7.5 Incentives for cooperation when downloading

---

Availability

Detail Information

Series Title

-

Call Number

621.382 KES i

Publisher

Canada : John Wiley & Sons., 2007

Collation

xiv, 232 hlm.; 26 cm.

Language

English

ISBN/ISSN

9780471371410

Classification

621.382

Content Type

-

Media Type

-

Carrier Type

-

Edition

-

Subject(s)

telecommunication
Network performance (Telecommunication)
Switching theory

Specific Detail Info

-

Statement of Responsibility

George Kesidis

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment