Research Catalog

Title

Telecommunications network design algorithms / Aaron Kershenbaum.

Author

Kershenbaum, Aaron.

Publication

New York : McGraw-Hill, ©1993.

Items in the Library & Off-site

Details

Description

xvi, 368 pages : illustrations; 25 cm

Series Statement

McGraw-Hill in computer science series

Uniform Title

McGraw-Hill series in computer science.

Subject

• Telecommunication systems > Design and construction
• System analysis
• Algorithms
• Telecommunication systems > Mathematical models
• Graph theory
• Systems Analysis
• Algorithms
• systems analysis
• algorithms
• Telecommunication systems > Mathematical models
• Graph theory
• System analysis
• Telecommunication systems > Design and construction
• Algorithmus
• Entwurf
• Graphentheorie
• Rechnernetz
• Telekommunikation
• Telekommunikationsnetz
• Systèmes de télécommunications
• Algorithmes

Bibliography (note)

• Includes bibliographical references and index.

Contents

1. Introduction -- 1.1. Types of Networks -- 1.1.1. Network Components -- 1.1.2. Network Functions -- 1.1.3. Centralized Data Networks -- 1.1.4. Distributed Data Networks -- 1.1.5. Voice Networks -- 1.1.6. Integrated Networks -- 1.1.7. Local Area Networks (LAN) -- 1.2. Network Design Issues -- 1.2.1. Justifying a Network -- 1.2.2. Scope -- 1.2.3. Manageability -- 1.2.4. Network Architecture -- 1.2.5. Switching Mode -- 1.2.6. Node Placement and Sizing -- 1.2.7. Link Topology and Sizing -- 1.2.8. Routing (Protocol Selection) -- 1.3. Data in Support of Network Design -- 1.3.1. Location Data -- 1.3.2. Traffic Requirements -- 1.3.3. Link Costs (Tariffs) -- 1.3.4. Device Characteristics -- 1.3.5. Performance Objectives -- 1.4. Network Design Tools -- 1.4.1. Approaches to Network Design -- 1.4.2. Structure of a Network Design Tool -- 2. Analysis of Loss and Delay -- 2.1. Analysis of Delay in Networks -- 2.1.1. Elements of Probability -- 2.1.2. The Normal Distribution -- 2.1.3. The Binomial Distribution -- 2.2. The M/M/1 Queue -- 2.3. Other Queueing Systems -- 2.3.1. The M/M/2 Queue -- 2.3.2. The M/M/m Queue -- 2.3.3. The Effect of Message Length Distribution: The M/G/1 Queue -- 2.3.4. Systems with Priorities -- 2.3.5. Networks of Queues -- 2.4. Systems with Loss -- 2.4.1. The Erlang-B Function -- 2.4.2. Systems with Both Loss and Delay (M/M/m/q) -- 2.4.3. Other Models of Retry Behavior -- 2.4.4. Non-Random Traffic -- 3. Modeling Networks as Graphs -- 3.1. Graph Terminology -- 3.2. Representation of Networks -- 3.2.1. External Representation -- 3.2.2. Internal Representation -- 3.3. Computational Complexity -- 3.3.1. Order of Complexity -- 3.3.2. Pseudocode -- 3.3.3. Analysis of Complexity -- 4. Fundamental Graph Algorithms -- 4.1. Finding Trees in Graphs -- 4.1.1. Tree Traversals -- 4.1.2. Connected Components in Undirected Graphs -- 4.1.3. Minimum Spanning Trees (MST) -- 4.2. Shortest Paths -- 4.2.1. Dijkstra's Algorithm -- 4.2.2. Bellman's Algorithm -- 4.2.3. Floyd's Algorithm -- 4.2.4. Incremental Shortest Path Algorithms -- 4.3. Single Commodity Network Flows -- 4.3.1. The Ford-Fulkerson Algorithm -- 4.3.2. Minimum Cost Flows -- 5. Centralized Network Design -- 5.1. Problem Definition -- 5.1.1. Multipoint Line Layout Heuristics -- 5.1.2. Constrained MST Algorithms -- 5.1.3. The Esau-Williams Algorithm -- 5.1.4. Sharma's Algorithm -- 5.1.5. The Unified Algorithm -- 5.1.6. Extensions to Other Topologies -- 5.1.7. Bin Packing Algorithms -- 5.2. Terminal Assignment -- 5.2.1. Greedy Algorithms -- 5.2.2. Exchange Algorithms -- 5.3. Concentrator Location -- 5.3.1. Center of Mass (COM) Algorithm -- 5.3.2. Add Algorithm -- 5.3.3. Drop Algorithm -- 5.3.4. Relaxation Algorithm -- 6. Routing -- 6.1. Routing Procedures -- 6.1.1. Flooding -- 6.1.2. Explicit Routing -- 6.1.3. Static Shortest Path Routing -- 6.1.4. Adaptive Routing -- 6.1.5. Distributed Routing -- 6.2. The Flow Deviation Algorithm -- 6.3. The Bertsekas-Gallager Algorithm -- 7. Mesh Topology Optimization -- 7.1. Capacity Assignment -- 7.1.1. Continuous Capacities -- 7.1.2. Discrete Capacities -- 7.2. Mesh Network Topology Optimization -- 7.2.1. Branch Exchange -- 7.2.2. The MENTOR Algorithm -- 8. Network Reliability -- 8.1. Introduction -- 8.2. Reliability of Tree Networks -- 8.3. Mesh Network Reliability Analysis -- 8.3.1. The Reliability Polynomial -- 8.3.2. State Space Decomposition -- 8.3.3. Graph Reduction -- 8.3.4. Connectivity Testing.

ISBN

• 0070342288
• 9780070342286
• 0071125183
• 9780071125185

LCCN

92044411

OCLC

• ocm27146816
• 27146816
• SCSB-1986206

Owning Institutions

Princeton University Library