Preface | |
Introduction | p. 1 |
Types of Networks | p. 1 |
Network Components | p. 2 |
Network Functions | p. 5 |
Centralized Data Networks | p. 7 |
Distributed Data Networks | p. 9 |
Voice Networks | p. 10 |
Integrated Networks | p. 10 |
Local Area Networks (LAN) | p. 11 |
Network Design Issues | p. 12 |
Justifying a Network | p. 12 |
Scope | p. 13 |
Manageability | p. 13 |
Network Architecture | p. 14 |
Switching Mode | p. 15 |
Node Placement and Sizing | p. 16 |
Link Topology and Sizing | p. 17 |
Routing (Protocol Selection) | p. 17 |
Data in Support of Network Design | p. 18 |
Location Data | p. 20 |
Traffic Requirements | p. 22 |
Link Costs (Tariffs) | p. 24 |
Device Characteristics | p. 25 |
Performance Objectives | p. 26 |
Network Design Tools | p. 27 |
Approaches to Network Design | p. 28 |
Structure of a Network Design Tool | p. 35 |
Analysis of Loss and Delay | p. 43 |
Analysis of Delay in Networks | p. 43 |
Elements of Probability | p. 45 |
The Normal Distribution | p. 51 |
The Binomial Distribution | p. 54 |
The M/M/1 Queue | p. 59 |
Other Queueing Systems | p. 68 |
The M/M/2 Queue | p. 68 |
The M/M/m Queue | p. 70 |
The Effect of Message Length Distribution: The M/G/1 Queue | p. 75 |
Systems with Priorities | p. 78 |
Networks of Queues | p. 81 |
Systems with Loss | p. 84 |
The Erlang-B Function | p. 85 |
Systems with Both Loss and Delay (M/M/m/q) | p. 89 |
Other Models of Retry Behavior | p. 94 |
Non-Random Traffic | p. 102 |
Modeling Networks as Graphs | p. 111 |
Graph Terminology | p. 111 |
Representation of Networks | p. 116 |
External Representation | p. 117 |
Internal Representation | p. 120 |
Computational Complexity | p. 127 |
Order of Complexity | p. 128 |
Pseudocode | p. 129 |
Analysis of Complexity | p. 132 |
Fundamental Graph Algorithms | p. 139 |
Finding Trees in Graphs | p. 139 |
Tree Traversals | p. 139 |
Connected Components in Undirected Graphs | p. 142 |
Minimum Spanning Trees (MST) | p. 144 |
Shortest Paths | p. 156 |
Dijkstra's Algorithm | p. 157 |
Bellman's Algorithm | p. 159 |
Floyd's Algorithm | p. 162 |
Incremental Shortest Path Algorithms | p. 165 |
Single Commodity Network Flows | p. 169 |
The Ford-Fulkerson Algorithm | p. 170 |
Minimum Cost Flows | p. 174 |
Centralized Network Design | p. 179 |
Problem Definition | p. 179 |
Multipoint Line Layout Heuristics | p. 181 |
Constrained MST Algorithms | p. 183 |
The Esau-Williams Algorithm | p. 185 |
Sharma's Algorithm | p. 190 |
The Unified Algorithm | p. 191 |
Extensions to Other Topologies | p. 195 |
Bin Packing Algorithms | p. 197 |
Terminal Assignment | p. 200 |
Greedy Algorithms | p. 201 |
Exchange Algorithms | p. 206 |
Concentrator Location | p. 219 |
Center of Mass (COM) Algorithm | p. 221 |
Add Algorithm | p. 225 |
Drop Algorithm | p. 233 |
Relaxation Algorithm | p. 236 |
Routing | p. 246 |
Routing Procedures | p. 247 |
Flooding | p. 247 |
Explicit Routing | p. 248 |
Static Shortest Path Routing | p. 249 |
Adaptive Routing | p. 250 |
Distributed Routing | p. 251 |
The Flow Deviation Algorithm | p. 252 |
The Bertsekas-Gallager Algorithm | p. 269 |
Mesh Topology Optimization | p. 281 |
Capacity Assignment | p. 281 |
Continuous Capacities | p. 282 |
Discrete Capacities | p. 289 |
Mesh Network Topology Optimization | p. 305 |
Branch Exchange | p. 306 |
The MENTOR Algorithm | p. 307 |
Network Reliability | p. 330 |
Introduction | p. 330 |
Reliability of Tree Networks | p. 332 |
Mesh Network Reliability Analysis | p. 339 |
The Reliability Polynomial | p. 339 |
State Space Decomposition | p. 341 |
Graph Reduction | p. 348 |
Connectivity Testing | p. 353 |
Appendix A | p. 357 |
Index | p. 364 |
Table of Contents provided by Blackwell. All Rights Reserved. |