1.
An Introduction to Computer Networks은 미국 Loyola University의 Peter L Dordal가 만든 온라인책입니다. 컴퓨터 네트워크에 관심이 있는 초보자들을 위하여 작성했다고 하지만 네트워크와 관련한 최근의 연구도 잘 정리해놓았습니다. 예를 들면 Newer TCP Implementations과 같은 부분입니다. 프로그래밍을 위한 교재가 아니라 개념의 정립을 위한 책입니다.
- 0 Preface
- 1 An Overview of Networks
- 1.1 Layers
- 1.2 Bandwidth and Throughput
- 1.3 Packets
- 1.4 Datagram Forwarding
- 1.5 Topology
- 1.6 Routing Loops
- 1.7 Congestion
- 1.8 Packets Again
- 1.9 LANs and Ethernet
- 1.10 IP – Internet Protocol
- 1.11 DNS
- 1.12 Transport
- 1.13 Firewalls
- 1.14 Network Address Translation
- 1.15 IETF and OSI
- 1.16 Berkeley Unix
- 1.17 Epilog
- 1.18 Exercises
- 2 Ethernet
- 3 Other LANs
- 4 Links
- 5 Packets
- 6 Abstract Sliding Windows
- 7 IP version 4
- 7.1 The IPv4 Header
- 7.2 Interfaces
- 7.3 Special Addresses
- 7.4 Fragmentation
- 7.5 The Classless IP Delivery Algorithm
- 7.6 IP Subnets
- 7.7 Address Resolution Protocol: ARP
- 7.8 Dynamic Host Configuration Protocol (DHCP)
- 7.9 Internet Control Message Protocol
- 7.10 Unnumbered Interfaces
- 7.11 Mobile IP
- 7.12 Epilog
- 7.13 Exercises
- 8 IP version 6
- 9 Routing-Update Algorithms
- 10 Large-Scale IP Routing
- 11 UDP Transport
- 12 TCP Transport
- 12.1 The End-to-End Principle
- 12.2 TCP Header
- 12.3 TCP Connection Establishment
- 12.4 TCP and WireShark
- 12.5 TCP simplex-talk
- 12.6 TCP state diagram
- 12.7 TCP Old Duplicates
- 12.8 TIMEWAIT
- 12.9 The Three-Way Handshake Revisited
- 12.10 Anomalous TCP scenarios
- 12.11 TCP Faster Opening
- 12.12 Path MTU Discovery
- 12.13 TCP Sliding Windows
- 12.14 TCP Delayed ACKs
- 12.15 Nagle Algorithm
- 12.16 TCP Flow Control
- 12.17 TCP Timeout and Retransmission
- 12.18 KeepAlive
- 12.19 TCP timers
- 12.20 Epilog
- 12.21 Exercises
- 13 TCP Reno and Congestion Management
- 13.1 Basics of TCP Congestion Management
- 13.2 Slow Start
- 13.3 TCP Tahoe and Fast Retransmit
- 13.4 TCP Reno and Fast Recovery
- 13.5 TCP NewReno
- 13.6 SACK TCP
- 13.7 TCP and Bottleneck Link Utilization
- 13.8 Single Packet Losses
- 13.9 TCP Assumptions and Scalability
- 13.10 TCP Parameters
- 13.11 Epilog
- 13.12 Exercises
- 14 Dynamics of TCP Reno
- 14.1 A First Look At Queuing
- 14.2 Bottleneck Links with Competition
- 14.3 TCP Fairness with Synchronized Losses
- 14.4 Notions of Fairness
- 14.5 TCP Reno loss rate versus cwnd
- 14.6 TCP Friendliness
- 14.7 AIMD Revisited
- 14.8 Active Queue Management
- 14.9 The High-Bandwidth TCP Problem
- 14.10 The Lossy-Link TCP Problem
- 14.11 The Satellite-Link TCP Problem
- 14.12 Epilog
- 14.13 Exercises
- 15 Newer TCP Implementations
- 16 Network Simulations: ns-2
- 17 The ns-3 Network Simulator
- 18 Queuing and Scheduling
- 18.1 Queuing and Real-Time Traffic
- 18.2 Traffic Management
- 18.3 Priority Queuing
- 18.4 Queuing Disciplines
- 18.5 Fair Queuing
- 18.6 Applications of Fair Queuing
- 18.7 Hierarchical Queuing
- 18.8 Hierarchical Weighted Fair Queuing
- 18.9 Token Bucket Filters
- 18.10 Applications of Token Bucket
- 18.11 Token Bucket Queue Utilization
- 18.12 Hierarchical Token Bucket
- 18.13 Fair Queuing / Token Bucket combinations
- 18.14 Epilog
- 18.15 Exercises
- 19 Quality of Service
- 19.1 Net Neutrality
- 19.2 Where the Wild Queues Are
- 19.3 Real-time Traffic
- 19.4 Integrated Services / RSVP
- 19.5 Global IP Multicast
- 19.6 RSVP
- 19.7 Differentiated Services
- 19.8 RED with In and Out
- 19.9 NSIS
- 19.10 Comcast Congestion-Management System
- 19.11 Real-time Transport Protocol (RTP)
- 19.12 Multi-Protocol Label Switching (MPLS)
- 19.13 Epilog
- 19.14 Exercises
- 20 Network Management and SNMP
- 20.1 Network Architecture
- 20.2 SNMP Basics
- 20.3 SNMP Naming and OIDs
- 20.4 MIBs
- 20.5 SNMPv1 Data Types
- 20.6 ASN.1 Syntax and SNMP
- 20.7 SNMP Tables
- 20.8 SNMP Operations
- 20.9 MIB Browsing
- 20.10 MIB-2
- 20.11 SNMPv1 communities and security
- 20.12 SNMP and ASN.1 Encoding
- 20.13 SNMPv2
- 20.14 Table Row Creation
- 20.15 SNMPv3
- 20.16 Exercises
- 21 Security
2.
PDF로 보시려면 아래를 받으세요.
