ZeePedia

Flow Models in Routing and Congestion Control:Convex functions and optimization, Utility Functions

<< Graph Algorithms:Maximum Flow Problem, Problems
Dynamic Network Control:Dynamic programming, The Dynamic Programming Optimality Equations >>



This part of ZeePedia is being updated, Please try again later.
Sorry for inconvenience. Thanks
Table of Contents:
  1. Countable State Markov Processes:Example of a Markov model, Poisson Processes
  2. Foster-Lyapunov stability criterion and moment bounds:Stability criteria for discrete time processes
  3. Queues with General Interarrival Time and/or Service Time Distributions:The GI/GI/1 System
  4. Multiple Access:Slotted ALOHA with Finitely Many Stations, Random Access for Streams of Arrivals
  5. Stochastic Network Models:Time Reversal of Markov Processes, Circuit Switched Networks
  6. Calculus of Deterministic Constraints:f-upper constrained processes, Service Curves
  7. Graph Algorithms:Maximum Flow Problem, Problems
  8. Flow Models in Routing and Congestion Control:Convex functions and optimization, Utility Functions
  9. Dynamic Network Control:Dynamic programming, The Dynamic Programming Optimality Equations
  10. Solutions
  11. Bibliography