1 INTRODUCTION

1.1 THE USES OF COMPUTER NETWORKS

1.1.1.Network Goals

1.1.2.Applications of Networks

1.2 NETWORK STRUCTURE

1.3 NETWORK ARCHITECTURES

1.3.1.Protocol Hierarchies

1.3.2.Design Issues for the Layers

1.4 THE ISO REFERENCE MODEL

1.4.1.The Physical Layer

1.4.2.The Data Link Layer

1.4.3.The Network Layer

1.4.4.The Transport Layer

1.4.5.The Session Layer

1.4.6.The Presentation Layer

1.4.7.The Application Layer

1.5 ARPANET，SNA，DECNET，AND PUBLIC NETWORKS

1.5.1.Introduction to the ARPANET

1.5.2.Introduction to SNA

1.5.3.Introduction to DECNET

1.5.4.Introduction to Public Networks and X.25

1.6 OUTLINE OF THE REST OF THE BOOK

1.7 SUMMARY

2 NETWORK TOPOLOGY

2.1 INTRODUCTION TO THE TOPOLOGY DESIGN PROBLEM

2.1.1.Formulation of the Problem

2.1.2.Hierarchical Networks

2.2 CONNECTIVITY ANALYSIS

2.2.1.Introduction to Graph Theory

2.2.2.Cuts and Network Flow

2.2.3.The Max-Flow Algorithm

2.2.4.Disjoint Paths

2.2.5.Monte Carlo Connectivity Analysis

2.3 DELAY ANALYSIS

2.3.1.Introduction to Queueing Theory

2.3.2.The M/M/1 Queue in Equilibrium

2.3.3.Networks of M/M/1 Queues

2.4 BACKBONE DESIGN

2.4.1.The Design Process

2.4.2.Generating Starting Topologies

2.4.3.Flow and Capacity Assignment

2.4.4.Perturbation Heuristics

2.5 LOCAL ACCESS NETWORK DESIGN

2.5.1.Assigning Sites to Concentrators

2.5.2.The Concentrator Location Problem

2.5.3.The Terminal Layout Problem

2.6 SUMMARY

3 THE PHYSICAL LAYER

3.1 THE THEORETICAL BASIS FOR DATA COMMUNICATION

3.1.1.Fourier Analysis

3.1.2.Bandwidth Limited Signals

3.1.3.The Maximum Data Rate of a Channel

3.2 THE TELEPHONE SYSTEM

3.2.1.Who’s Who in the Telecommunication World

3.2.2.Structure of the Telephone System

3.2.3.The Local Loop

3.3 TRANSMISSION AND MULTIPLEXING

3.3.1.Frequency Division and Time Division Multiplexing

3.3.2.Digital Transmission

3.3.3.The X.21 Digital Interface

3.3.4.Communication Satellites

3.3.5.Circuit Switching and Packet Switching

3.4 TERMINAL HANDLING

3.4.1.Polling

3.4.2.Multiplexing versus Concentration

3.4.3.The Packet Assembler/ Disassembler

3.5 ERRORS

3.5.1.The Nature of Transmission Errors

3.5.2.Error-Correcting Codes

3.5.3.Error-Detecting Codes

3.6 SUMMARY

4 THE DATA LINK LAYER

4.1 ELEMENTARY DATA LINK PROTOCOLS

4.1.1.Some Declarations Needed by the Protocols

4.1.2.An Unrestricted Simplex Protocol

4.1.3.A Simplex Stop-and-Wait Protocol

4.1.4.A Simplex Protocol for a Noisy Channel

4.2 SLIDING WINDOW PROTOCOLS

4.2.1.A One Bit Sliding Window Protocol

4.2.2.A Protocol with Pipelining

4.2.3.A Protocol That Accepts Frames Out of Order

4.3 EXAMPLES OF THE DATA LINK LAYER

4.3.1.The Data Link Layer in the ARPANET

4.3.2.The Data Link Layer in SNA and X.25

4.3.3.The Data Link Layer in DECNET

4.4 ANALYSIS OF PROTOCOLS

4.4.1.Protocol Efficiency

4.4.2.Protocol Verification

4.5 SUMMARY

5 THE NETWORK LAYER I：POINT-TO-POINT NETWORKS

5.1 VIRTUAL CIRCUITS AND DATAGRAMS

5.1.1.The Service Provided by the Network Layer

5.1.2.Comparison of Virtual Circuit and Datagram Service

5.1.3.The Internal Structure of the Subnet

5.1.4.Comparison of VCs and Datagrams within the Subnet

5.1.5.Independence of Subnet Service and Subnet Structure

5.2 ROUTING ALGORITHMS

5.2.1.Flooding

5.2.2.Static Routing

5.2.3.Centralized Routing Algorithms

5.2.4.Isolated Routing

5.2.5.Distributed Routing Algorithms

5.2.6.The Topology Update Problem

5.2.7.Hierarchical Routing

5.2.8.Broadcast Routing

5.3 CONGESTION

5.3.1.Preallocation of Buffers

5.3.2.Packet Discarding

5.3.3.Isarithmic Congestion Control

5.3.4.Flow Control

5.3.5.Choke Packets

5.3.6.Deadlocks

5.4 EXAMPLES OF THE NETWORK LAYER

5.4.1.The Network Layer in the ARPANET

5.4.2.The Network Layer in SNA

5.4.3.The Network Layer in DECNET

5.4.4.The Network Layer in X.25

5.5 SUMMARY

6 THE NETWORK LAYER Ⅱ：SATELLITE AND PACKET RADIO NETWORKS

6.1 SATELLITE PACKET BROADCASTING

6.1.1.Conventional Channel Allocation Methods

6.1.2.Pure ALOHA and Slotted ALOHA

6.1.3.Finite Population ALOHA

6.1.4.Delay and Throughput of Slotted ALOHA

6.1.5.Stability of Slotted ALOHA

6.1.6.Controlled ALOHA

6.1.7.Reservation ALOHA

6.2 PACKET RADIO

6.2.1.The University of Hawaii ALOHA System

6.2.2.Design Issues for Packet Radio Networks

6.3 SUMMARY

7 THE NETWORK LAYER Ⅲ：LOCAL NETWORKS

7.1 CARRIER SENSE NETWORKS

7.1.1.Persistent and Nonpersistent CSMA

7.1.2.Ethernet

7.1.3.Collision-Free Protocols

7.1.4.Limited-Contention Protocols

7.2 RING NETWORKS

7.2.1.Token Rings

7.2.2.Contention Rings

7.2.3.Slotted Rings

7.2.4.Register Insertion Rings

7.3 SHARED MEMORY SYSTEMS

7.3.1.Processor-Memory Interconnection

7.3.2.Examples of Shared Memory Systems

7.4 SUMMARY

8 THE TRANSPORT AND SESSION LAYERS

8.1 TRANSPORT PROTOCOL DESIGN ISSUES

8.1.1.Transport Service

8.1.2.Addressing and Connection Establishment

8.1.3.Flow Control and Buffering

8.1.4.Multiplexing

8.1.5.Synchronization in the Presence of Delayed Packets

8.1.6.Crash Recovery

8.2 INTERCONNECTION OF PACKET-SWITCHING NETWORKS

8.2.1.Gateways

8.2.2.The Level of Interconnection

8.2.3.The X.75 Model versus the Datagram Model

8.2.4.Internetwork Packet Fragmentation

8.3 THE SESSION LAYER

8.4 EXAMPLES OF THE TRANSPORT AND SESSION LAYERS

8.4.1.The Transport Layer in the ARPANET

8.4.2.The Transport and Session Layers in SNA

8.4.3.The Transport Layer in DECNET

8.5 SUMMARY

9 THE PRESENTATION LAYER

9.1 NETWORK SECURITY AND PRIVACY

9.1.1.Traditional Cryptography

9.1.2.The Data Encryption Standard

9.1.3.The Key Distribution Problem

9.1.4.Public Key Cryptography

9.1.5.Authentication and Digital Signatures

9.2 TEXT COMPRESSION

9.2.1.Encoding a Finite Set of Equally Likely Symbols

9.2.2.Huffman Coding

9.2.3.Context Dependent Encoding

9.3 VIRTUAL TERMINAL PROTOCOLS

9.3.1.Classes of Terminals

9.3.2.The Data Structure Model

9.3.3.Design Principles

9.3.4.An Example Virtual Terminal Protocol

9.4 FILE TRANSFER PROTOCOLS

9.5 EXAMPLES OF THE PRESENTATION LAYER

9.5.1.The Presentation Layer in the ARPANET

9.5.2.The Presentation Layer in SNA

9.5.3.The Presentation Layer in DECNET

9.6 SUMMARY

10 THE APPLICATION LAYER

10.1 DISTRIBUTED DATA BASE SYSTEMS

10.1.1.The Relational Data Base Model

10.1.2.The Relation Distribution Problem

10.1.3.Query Processing

10.1.4.Concurrency Control

10.1.5.Crash Recovery

10.2 DISTRIBUTED COMPUTATION

10.2.1.The Hierarchical Model

10.2.2.The CPU Cache Model

10.2.3.The User-Server Model

10.2.4.The Pool Processor Model

10.2.5.The Data Flow Model

10.3 NETWORK AND DISTRIBUTED OPERATING SYSTEMS

10.3.1.Network Operating Systems

10.3.2.Distributed Operating Systems

10.3 SUMMARY

11 READING LIST AND BIBLIOGRAPHY

11.1 SUGGESTIONS FOR FURTHER READING

11.1.1 Introduction

11.1.2 Network Topology

11.1.3 The Physical Layer

11.1.4 The Data Link Layer

11.1.5 The Network Layer Ⅰ：Point-to-Point Networks

11.1.6 The Network Layer Ⅱ：Satellite and Packet Radio Networks

11.1.7 The Network Layer Ⅲ：Local Networks

11.1.8 The Transport and Session Layers

11.1.9 The Presentation Layer

11.1.10 The Application Layer

11.2 ALPHABETICAL BIBLIOGRAPHY

INDEX