List of Figures


Chapter 1: Introduction

Figure 1.1: Information flows between network analysis, architecture, and design.
Figure 1.2: Inputs and outputs to network analysis process.
Figure 1.3: Inputs and outputs to network architecture process.
Figure 1.4: Hierarchy and interconnectivity in a network.
Figure 1.5: Hierarchy added to a network.
Figure 1.6: Interconnectivity added to a network.
Figure 1.7: Generations of networking.
Figure 1.8: Hierarchy and traffic flow.
Figure 1.9: Interconnectivity added to optimize traffic flow.
Figure 1.10: Routing evolution.
Figure 1.11: Generic components of a system.
Figure 1.12: Comparison of OSI layers to system levels.
Figure 1.13: Device component separated into constituents.
Figure 1.14: Traditional view of system.
Figure 1.15: Generic system with interfaces added.
Figure 1.16: Example of system with ATM in network.
Figure 1.17: Example of system with native ATM.
Figure 1.18: Grouping characteristics into service levels and descriptions.
Figure 1.19: Various demarcation points for end-to-end in a network.
Figure 1.20: Example of service hierarchy within a network.
Figure 1.21: Service requests, offerings, and metrics.
Figure 1.22: Requirements flow down components to network.
Figure 1.23: Capacity at each point in transmission path before security firewall.
Figure 1.24: Capacity at each point in transmission path after security firewall.
Figure 1.25: Performance of Fast Ethernet connection under best-effort conditions.
Figure 1.26: Performance of Fast Ethernet connection under CAC.
Figure 1.27: Performance limits and thresholds.
Figure 1.28: Example of a 2D performance envelope.
Figure 1.29: Example of a 3D performance envelope.
Figure 1.30: Network hierarchy for Exercise 2.

Chapter 2: Requirements Analysis: Concepts

Figure 2.1: Requirements are separated into core/fundamental requirements, features, future requirements, and rejected and informational requirements.
Figure 2.2: Types of user requirements.
Figure 2.3: Requirements become more technical as we move closer to network devices.
Figure 2.4: Types of application requirements.
Figure 2.5: Delay types.
Figure 2.6: Example applications map.
Figure 2.7: Types of device requirements.
Figure 2.8: Example template for device descriptions.
Figure 2.9: Specialized devices.
Figure 2.10: Device components.
Figure 2.11: Device locations.
Figure 2.12: Types of network requirements.
Figure 2.13: Security risk assessment.
Figure 2.14: Template for the requirements specification.
Figure 2.15: Beginning of requirements specification for Example 2.1.
Figure 2.16: Beginning of requirements map for Example 2.1.
Figure 2.17: Template for Exercise 9.

Chapter 3: Requirements Analysis: Process

Figure 3.1: Requirements analysis process.
Figure 3.2: Determining performance targets— single or multitier performance.
Figure 3.3: Measuring performance using a testbed and the existing network.
Figure 3.4: Requirements tracking and management in tabular form.
Figure 3.5: Example of a metropolitan-area map.
Figure 3.6: Using ping and IP packet loss as service metrics for RMA.
Figure 3.7: Example service metrics.
Figure 3.8: Simulation of network performance behavior.
Figure 3.9: Characterization of user behavior.
Figure 3.10: Uptime measured over different time periods.
Figure 3.11: Uptime measured everywhere.
Figure 3.12: Uptime measured selectively.
Figure 3.13: Thresholds between testbed and low-and high-performance uptime.
Figure 3.14: Delay estimates for user requirements.
Figure 3.15: Performance regions for interactive-burst and interactive-bulk applications.
Figure 3.16: Completion times and data sizes for selected applications.
Figure 3.17: Example of a shared, multiprocessor computing network.
Figure 3.18: Performance envelope with generic thresholds.
Figure 3.19: Elements of operations and support.
Figure 3.20: Sample reliability block diagram.
Figure 3.21: Template for FMECA data.
Figure 3.22: Three-tier maintenance structure.
Figure 3.23: Example loss threshold.
Figure 3.24: Plot of capacity requirements with possible thresholds.
Figure 3.25: Plot of capacity requirements with no distinct groupings.
Figure 3.26: Multiple requirements maps.
Figure 3.27: Campus requirements map.
Figure 3.28: Template for initial conditions.
Figure 3.29: Requirements gathered from initial meeting with customer.
Figure 3.30: Template for questionnaire.
Figure 3.31: Additional requirements gathered from questionnaire.
Figure 3.32: Additional requirements gathered from meetings with users and staff.
Figure 3.33: Application performance requirements for Exercise 2.
Figure 3.34: Wireless connections to corporate network using PPP and PPPoE.
Figure 3.35: Diagram of system for Exercise 10.

Chapter 4: Flow Analysis

Figure 4.1: Flow attributes apply end-to-end and throughout network.
Figure 4.2: Common flow characteristics.
Figure 4.3: Flows are represented as unidirectional or bidirectional arrows with performance requirements.
Figure 4.4: Individual flow for a single application with guaranteed requirements.
Figure 4.5: Example composite flows.
Figure 4.6: Flow examples.
Figure 4.7: Process for identifying and developing flows.
Figure 4.8: Map of device locations for a network.
Figure 4.9: Flows estimated between devices for Application 1.
Figure 4.10: Performance information added to central campus flows for Application 1.
Figure 4.11: Central campus flows for Application 1 expanded with Building C.
Figure 4.12: Consolidating flows using a flow aggregation point.
Figure 4.13: A performance profile (P1) applied to multiple flows with the same performance characteristics.
Figure 4.14: A project may incorporate multiple approaches in choosing applications.
Figure 4.15: Convention for data sources and sinks.
Figure 4.16: Example data sources.
Figure 4.17: Example data sinks.
Figure 4.18: Data sources, sinks, and flows added to first part of Application 1.
Figure 4.19: Data sources, sinks, and flows added to Application 2 (two options shown).
Figure 4.20: Data-migration application with server-server flows isolated.
Figure 4.21: Peer-to-peer flow model.
Figure 4.22: Example of peer-to-peer flows in the early Internet.
Figure 4.23: Peer-to-peer flows in a telelearning environment.
Figure 4.24: Client-server flow model.
Figure 4.25: Example of client-server flows.
Figure 4.26: Hierarchical client-server flow model.
Figure 4.27: Web services modeled using hierarchical client-server flow model.
Figure 4.28: Components of a climate-modeling problem.
Figure 4.29: Hierarchical client-server model for scientific visualization.
Figure 4.30: Distributed-computing flow model.
Figure 4.31: Flows for a computing cluster.
Figure 4.32: Flows for parallel computing.
Figure 4.33: Example flow information for prioritization.
Figure 4.34: Flows prioritized by number of users served.
Figure 4.35: Flows prioritized by reliability.
Figure 4.36: Descriptions of flow specifications.
Figure 4.37: One-part flow specification.
Figure 4.38: Two-part flow specification.
Figure 4.39: Multipart flow specification.
Figure 4.40: Building and device locations for example.
Figure 4.41: Map with flow types added.
Figure 4.42: Performance envelope for example.
Figure 4.43: Flow models for flow type 1.
Figure 4.44: Flow model for flow type 2.
Figure 4.45: Flow model for flow type 3.
Figure 4.46: Flow model for flow type 4.
Figure 4.47: Flow map for example.
Figure 4.48: Performance requirements for flows.
Figure 4.49: Performance requirements added to flow map.
Figure 4.50: Two-part flowspec for each flow with performance profile P1.
Figure 4.51: Mainframe environment for OLTP application.
Figure 4.52: Hierarchical client-server environment for OLTP application.

Chapter 5: Network Architecture

Figure 5.1: Comparisons between architecture and design.
Figure 5.2: Architecture and design solutions are multidimensional.
Figure 5.3: Functions, capabilities, and mechanisms.
Figure 5.4: Examples of performance mechanisms in a network.
Figure 5.5: Interactions between performance mechanisms.
Figure 5.6: Component architectures and the reference architecture are derived from network requirements, flows, and goals.
Figure 5.7: Sample chart for listing dependencies between performance mechanisms.
Figure 5.8: Process model for component architecture approach.
Figure 5.9: Component architectures form overlays onto requirements and flow maps.
Figure 5.10: LAN/MAN/WAN architectural model.
Figure 5.11: Access/distribution/core architectural model.
Figure 5.12: Peer-to-peer architectural model.
Figure 5.13: Client-server architectural model.
Figure 5.14: Hierarchical client-server architectural model.
Figure 5.15: Distributed-computing architectural model.
Figure 5.16: Service-provider architectural model.
Figure 5.17: Intranet/extranet architectural model.
Figure 5.18: End-to-end architectural model.
Figure 5.19: Functional and flow-based models complement the topological models.
Figure 5.20: The reference architecture combines component architectures and models.
Figure 5.21: Access/distribution/core model from a flow perspective.
Figure 5.22: Where client-server and hierarchical client-server models may overlap with the access/distribution/core model.
Figure 5.23: Access/distribution/core model with functional and flow-based models added.
Figure 5.24: Flow map from storage example in Chapter 4.
Figure 5.25: Access, distribution, and core areas defined for Example 5.1.
Figure 5.26: Distributed-computing areas defined for Example 5.1.
Figure 5.27: Systems architecture.
Figure 5.28: Network architecture.

Chapter 6: Addressing and Routing Architecture

Figure 6.1: IP Addresses consist of a unique identifier and mask.
Figure 6.2: An IP address in binary and dotted-decimal formats.
Figure 6.3: Address terms and meanings.
Figure 6.4: Traffic is forwarded based on longest (most explicit) address match.
Figure 6.5: Basic tenets of IP forwarding.
Figure 6.6: Classful addressing uses traditional class boundaries to form Class A, B, or C addresses.
Figure 6.7: Masks and sizes for subnetting a Class B network.
Figure 6.8: Modifying the address mask for supernetting.
Figure 6.9: IP address shown with natural mask.
Figure 6.10: IP address shown with supernet mask.
Figure 6.11: Address prefix size determines CIDR block size.
Figure 6.12: Example of workgroups and functional areas.
Figure 6.13: Example of a hard boundary.
Figure 6.14: Example of a soft boundary.
Figure 6.15: Boundaries and routing flows in a network.
Figure 6.16: Policy enforcement between autonomous systems.
Figure 6.17: Example for route-manipulation techniques.
Figure 6.18: Results of route-manipulation techniques applied to AS1.
Figure 6.19: Results of route-manipulation techniques applied to AS2.
Figure 6.20: Applying various addressing strategies.
Figure 6.21: Example for variable-length subnetting.
Figure 6.22: Example with variable-length subnetting applied.
Figure 6.23: Stub networks.
Figure 6.24: Degrees of hierarchy and interconnectivity.
Figure 6.25: Application of internal BGP (iBGP) and external BGP (eBGP).
Figure 6.26: Example application of static routes, IGPs, and EGPs in a network.
Figure 6.27: Iterative evaluation of routing protocols.
Figure 6.28: Example of interactions within addressing/routing architecture.
Figure 6.29: Diagram for Exercises 4 through 7.

Chapter 7: Network Management Architecture

Figure 7.1: Network management hierarchy.
Figure 7.2: Network management is composed of managing elements and transporting management data.
Figure 7.3: Network characteristics can be per element, per link, per network, or end-to-end.
Figure 7.4: Elements of the monitoring process.
Figure 7.5: Monitoring for event notification.
Figure 7.6: Monitoring for metrics and planning.
Figure 7.7: Configuration mechanisms for network management.
Figure 7.8: Traffic flows for in-band management.
Figure 7.9: Traffic flows for out-of-band management.
Figure 7.10: Combination of in-band and out-of-band management traffic flows.
Figure 7.11: Distributed management where each local EMS has its own management domain.
Figure 7.12: Distributed management where monitoring is distributed.
Figure 7.13: Hierarchical management separates management into distinct functions that are distributed across multiple platforms.
Figure 7.14: Scaling network management traffic.
Figure 7.15: Local and archival storage for management data.
Figure 7.16: Selective copying to separate database.
Figure 7.17: Data migration.
Figure 7.18: Integration of network management with OSS.
Figure 7.19: Devices for storage capacity problem.
Figure 7.20: Diagram for Exercises 6 through 10.

Chapter 8: Performance Architecture

Figure 8.1: General mechanisms for performance.
Figure 8.2: Comparison of DiffServ and IntServ.
Figure 8.3: Where DiffServ and IntServ apply in the access/distribution/core model.
Figure 8.4: Illustration of traffic metering at a network device.
Figure 8.5: Traffic conditioning functions.
Figure 8.6: Performance mechanisms act on network devices.
Figure 8.7: Upstream and downstream directions.
Figure 8.8: Upstream and downstream directions for Internet Web traffic.
Figure 8.9: Example of enterprise SLA.
Figure 8.10: Performance mechanisms with SLAs added.
Figure 8.11: Performance mechanisms with policies added.
Figure 8.12: General applications of performance mechanisms.
Figure 8.13: Performance is constrained by security.
Figure 8.14: Network for Exercise 6.

Chapter 9: Security and Privacy Architecture

Figure 9.1: Potential assets and threats to be analyzed.
Figure 9.2: Example of threat analysis worksheet for a specific organization.
Figure 9.3: Example security philosophies.
Figure 9.4: Areas of physical security.
Figure 9.5: Transport mode of IPSec.
Figure 9.6: Tunnel mode of IPSec.
Figure 9.7: Example of packet filtering.
Figure 9.8: Encryption/decryption of network traffic.
Figure 9.9: Remote access mechanisms.
Figure 9.10: Remote access considerations.
Figure 9.11: Process for PPP/PPPoE session establishment.
Figure 9.12: Access/distribution/core architectural model as a starting point for security.
Figure 9.13: Security zones embedded within each other.
Figure 9.14: Developing security zones throughout a network.
Figure 9.15: Security mechanisms may restrict or preclude performance within each zone.
Figure 9.16: Network for Exercises 1 through 3.
Figure 9.17: Network for Exercise 4.

Chapter 10: Selecting Technologies for the Network Design

Figure 10.1: Process for selecting technologies for the network design.
Figure 10.2: Cost/performance graph.
Figure 10.3: Budget allocation for example.
Figure 10.4: Requirements, flows, and network architecture influence design goals.
Figure 10.5: System state.
Figure 10.6: System state as part of network connections.
Figure 10.7: Example of connection establishment.
Figure 10.8: Example of asymmetric flows.
Figure 10.9: Capacity ranges for selected technologies.
Figure 10.10: Overlap in frame relay/SMDS/ATM capacity ranges.
Figure 10.11: Sizing the network design at the (LAN/MAN)/WAN level.
Figure 10.12: Sizing the network design at the campus level.
Figure 10.13: Sizing the network design based on user concentrations.
Figure 10.14: Sizing the network design based on flow hierarchies.
Figure 10.15: Sizing the network design based on functions and features of each area.
Figure 10.16: A black box isolates the inputs and outputs of each area.
Figure 10.17: Black box applied to area under review.
Figure 10.18: Black box applied to areas not under review.
Figure 10.19: Network for Exercise 5.
Figure 10.20: Network for Exercise 6.

Chapter 11: Interconnecting Technologies Within the Network Design

Figure 11.1: Technology selections and network devices need to be interconnected to complete design.
Figure 11.2: Technology selections and network devices when connected.
Figure 11.3: OSI seven-layer model.
Figure 11.4: Interconnecting multiple Ethernet segments using a shared-medium mechanism.
Figure 11.5: Planning hierarchy in the network design.
Figure 11.6: Flows in a distributed-computing model.
Figure 11.7: Distributed-computing flows with a switch applied.
Figure 11.8: Routing distributed-computing flows across a WAN.
Figure 11.9: ATM in a classic IP network.
Figure 11.10: Example of suboptimal flows in classic IP over ATM.
Figure 11.11: Evolution of external interfaces.
Figure 11.12: NHRP flow optimization in an NBMA environment.
Figure 11.13: Using end-to-end or flow information to make forwarding decisions.
Figure 11.14: Summary of evaluation criteria for interconnection mechanisms.
Figure 11.15: Degrees of hierarchy.
Figure 11.16: Low-redundancy path.
Figure 11.17: Medium-redundancy path.
Figure 11.18: High-redundancy path.
Figure 11.19: Guidelines for hierarchy and redundancy.
Figure 11.20: LANE and RFC 2225 networks for Exercise 3.




Network Analysis, Architecture and Design
Network Analysis, Architecture and Design, Second Edition (The Morgan Kaufmann Series in Networking)
ISBN: 1558608877
EAN: 2147483647
Year: 2003
Pages: 161

flylib.com © 2008-2017.
If you may any questions please contact us: flylib@qtcs.net