Design of Modern Communication Networks

Decomposition Resource allocation Algorithms Dynamic programming Linear programming Monte-Carlo Traffic OPTIMIZATION Network programming Cumulant-generating function Markov process Electrical networks Monte-Carlo-Simulation Approximations TCP Queues Network topology Point process Poisson process Processor sharing Reversible systems Shaping Network Design Minimum Cost Flow Discrete-event simulation Packet Network Mean-Value Analysis Maximum Flow NP-complete Randomization Genetic algorithm Network reliability Network Connectivity Shortest path Randomized algorithm Markov additive process Heuristics Routing Loss Networks Policing Dijkstra Floyd warshall Acceptance region Approximate multi-commodity flow Basic bandwidth unit Bellman-Ford Branch exchange method Chernoff bound Closed Jackson network Circulant BCMP networks Decoupling bandwidth Effective bandwidth Finite Buffer Estimation of blocking End-to-end delay Gomory-Hu Convolution Method Goemans-Williamson Fixed-point approximation Cut saturation method Edge cuts Kirchhoff matrix-tree theorem k-connectivity Large deviations theory Flow deviation method Multi-commodity flow Multi-dimensional Erlang formula Ford-Fulkerson Gomory-Hu algorithm Open Jackson Network Overflow theory Hayward approximation Out-of-kilter algorithm Reliability polynomial Spanners Theta-graph The traveling salesman problem Vertex cuts The Erlang formulas Spanning Trees Moe's principle Virtual channel Multiterminal flow Primal-dual methods On-off model Trunk reservation Wilkinson-Bretschnieder method