Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Standard view
Full view
of .
Look up keyword or section
Like this

Table Of Contents

Countable State Markov Processes
1.1 Example of a Markov model
1.2 Definition, Notation and Properties
1.3 Pure-Jump, Time-Homogeneous Markov Processes
1.4 Space-Time Structure
1.5 Poisson Processes
1.6.1 Renewal Theory in Continuous Time
1.6.2 Renewal Theory in Discrete Time
1.7 Classification and Convergence of Discrete State Markov Pro-
1.7.1 Examples with finite state space
1.7.2 Discrete Time
1.7.3 Continuous Time
1.8 Classification of Birth-Death Processes
1.10 Queueing Systems, M/M/1 Queue and Little’s Law
1.11 Mean Arrival Rate, Distributions Seen by Arrivals, and PASTA
1.13 Method of Phases and Quasi Birth-Death Processes
1.14 Markov Fluid Model of a Queue
1.15 Problems
2.1 Stability criteria for discrete time processes
2.2 Stability criteria for continuous time processes
2.3 Problems
3.1 The M/GI/1 queue
3.1.1 Busy Period Distribution
3.1.2 Priority M/GI/1 systems
3.3 The GI/GI/1 System
3.4 Kingman’s Bounds for GI/GI/1 Queues
3.5 Stochastic Comparison with Application to GI/GI/1 Queues
3.6 GI/GI/1 Systems with Server Vacations, and Application to
3.7 Effective Bandwidth of a Data Stream
3.8 Problems
Multiple Access
4.1 Slotted ALOHA with Finitely Many Stations
4.2 Slotted ALOHA with Infinitely Many Stations
4.3 Bound Implied by Drift, and Proof of Proposition 4.2.1
4.4 Probing Algorithms for Multiple Access
4.5 Problems
Stochastic Network Models
5.1 Time Reversal of Markov Processes
5.2 Circuit Switched Networks
5.3 Markov Queueing Networks (in equilibrium)
5.3.1 Markov server stations in series
5.3.2 Simple networks of MS stations
5.3.3 A multitype network of MS stations with more general routing
5.4 Problems
Calculus of Deterministic Constraints
6.1 The (σ,ρ) Constraints and Performance Bounds for a Queue
6.2 f-upper constrained processes
6.3 Service Curves
6.4 Problems
Graph Algorithms
7.1 Maximum Flow Problem
7.2 Problems
8.1 Convex functions and optimization
8.2 The Routing Problem
8.3 Utility Functions
8.4 Joint Congestion Control and Routing
8.5 Hard Constraints and Prices
8.6 Decomposition into Network and User Problems
8.7 Specialization to pure congestion control
8.8 Fair allocation
8.9 A Network Evacuation Problem
8.10 Braess Paradox
8.11 Further reading and notes
8.12 Problems
0 of .
Results for:
No results containing your search query
P. 1
Network Analysis Dec 06

Network Analysis Dec 06

Ratings: (0)|Views: 46|Likes:
Published by tomoo123

More info:

Published by: tomoo123 on Oct 16, 2010
Copyright:Attribution Non-commercial


Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less





You're Reading a Free Preview
Pages 5 to 17 are not shown in this preview.
You're Reading a Free Preview
Pages 22 to 30 are not shown in this preview.
You're Reading a Free Preview
Pages 35 to 69 are not shown in this preview.
You're Reading a Free Preview
Pages 74 to 96 are not shown in this preview.
You're Reading a Free Preview
Pages 101 to 204 are not shown in this preview.

You're Reading a Free Preview

/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->