Design of Modern Communication Networks : Methods and Applications
Christofer. Larsson
Bok Engelsk 2014 · Electronic books.
| Utgitt | Burlington : : Elsevier Science, , 2014.
|
|---|---|
| Omfang | 1 online resource (463 p.)
|
| Opplysninger | Description based upon print version of record.. - Half Title; Title Page; Copyright; Dedication; Contents; Preface; 1 Introduction; 1.1 The purpose of this book; 1.2 The Design Process; 1.3 A First Example; 1.4 Algorithms for Hard Problems; 1.4.1 Complexity classes; 1.4.2 Showing problem hardness; 1.5 Models and Algorithms; 1.5.1 Classification of algorithms; 1.5.2 Randomization; 1.5.3 Monte Carlo Techniques; 1.6 Organization of this book; 1.7 Summary; 2 Networks and Flows; 2.1 Preliminaries; 2.1.1 Basic flow concepts; 2.1.2 Graph flow problems; 2.2 Network Representations; 2.3 Graph Connectivity; 2.3.1 Depth-first search. - 2.3.2 Breadth-first search2.4 Shortest Paths; 2.4.1 Shortest path as a linear program; 2.4.2 Dijkstra's algorithm; 2.4.3 The Bellman-Ford algorithm; 2.4.4 The Floyd-Warshall algorithm; 2.5 Maximum Flows; 2.5.1 Maximum flow as a linear program; 2.5.2 The Ford-Fulkerson labeling algorithm; 2.5.3 Approximate maximum flow; 2.5.3.1 Electrical flows; 2.5.3.2 The algorithm; 2.6 Summary; 3 Advanced Flow Theory; 3.1 Multi-Terminal Flows; 3.1.1 The Gomory-Hu algorithm; 3.2 Minimum-Cost Flows; 3.2.1 Problem formulation; 3.2.2 The out-of-kilter algorithm; 3.2.3 Variants and modifications. - 3.3 Multi-Commodity Flows3.3.1 Problem formulation; 3.3.2 An approximation algorithm; 3.4 Summary; 4 Topological Design; 4.1 Capacitated Network Design; 4.1.1 Cost functions; 4.1.2 Routing; 4.2 Important Properties of Graphs; 4.2.1 Sparseness of graphs; 4.2.2 Example topologies; 4.3 Ring Topologies; 4.3.1 The nearest neighbor algorithm; 4.3.2 Incremental insertion; 4.3.3 k-Optimal methods; 4.4 Spanning Trees and Spanners; 4.4.1 Properties of spanners; 4.4.2 A greedy algorithm for spanner construction; 4.5 Gomory-Hu Design; 4.5.1 Constant edge costs; 4.5.2 Extension to general networks. - 4.6 Randomized Topological Design4.6.1 Expander graphs; 4.6.2 Monte Carlo optimization; 4.7 Genetic Algorithms; 4.8 Resource Allocation; 4.8.1 The Knapsack problem; 4.8.2 Dynamic programming; 4.8.3 Branch-and-bound; 4.9 Summary; 5 Stochastic Processes and Queues; 5.1 Traffic and blocking; 5.1.1 Point processes; 5.1.2 The Poisson process; 5.1.3 Characterization of traffic; 5.2 Modeling with queues; 5.2.1 Characteristics of queueing processes; 5.2.2 Measuring system performance; 5.2.3 Some general results; 5.2.4 Simple Markovian queues; 5.3 Markov chain analysis. - 5.3.1 Discrete-time Markov chains5.3.2 Numerical solution of Markov chains; 5.3.3 Randomization; 5.3.4 Truncation of state space; 5.3.5 Two Stations in Tandem; 5.4 The Erlang B-formula and generalizations; 5.4.1 Integer number of circuits; 5.4.2 Non-Integer Number of Circuits; 5.4.3 Approximations; 5.4.4 The Erlang C-formula; 5.4.5 Derivatives; 5.4.6 Inverse; 5.5 Overflow theory; 5.5.1 The Hayward approximation; 5.5.2 The Wilkinson-Bretschneider method; 5.6 Summary; 6 Loss Networks; 6.1 Calculating Blocking in a Network; 6.2 Resource Allocation; 6.2.1 Moe's principle. - 6.2.2 An optimization procedure. - Design of Modern Communication Networks focuses on methods and algorithms related to the design of communication networks, using optimization, graph theory, probability theory and simulation techniques. The book discusses the nature and complexity of the network design process, then introduces theoretical concepts, problems and solutions. It demonstrates the design of network topology and traditional loss networks, followed by uncontrolled packet networks, flow-controlled networks, and multiservice networks. Access network design is reviewed, and the book concludes by considering the de
|
| Emner | |
| Sjanger | |
| Dewey | |
| ISBN | 9780124072381
|
