Peter L Dordal
Department of Computer Science
Loyola University Chicago
Contents:
- 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
- 8.1 The IPv6 Header
- 8.2 Host identifier
- 8.3 Link-local addresses
- 8.4 Anycast addresses
- 8.5 Hop-by-Hop Options Header
- 8.6 Destination Options Header
- 8.7 Routing Header
- 8.8 Fragment Header
- 8.9 Router Advertisement
- 8.10 Prefix Discovery
- 8.11 Neighbor Solicitation
- 8.12 Duplicate Address Detection
- 8.13 Stateless Autoconfiguration (SLAAC)
- 8.14 DHCPv6
- 8.15 Manual Configuration
- 8.16 ping6
- 8.17 TCP connections with link-local addresses
- 8.18 Manual address configuration
- 8.19 Node Information Messages
- 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
- 17 Queuing and Scheduling
- 17.1 Queuing and Real-Time Traffic
- 17.2 Traffic Management
- 17.3 Priority Queuing
- 17.4 Queuing Disciplines
- 17.5 Fair Queuing
- 17.6 Applications of Fair Queuing
- 17.7 Hierarchical Queuing
- 17.8 Hierarchical Weighted Fair Queuing
- 17.9 Token Bucket Filters
- 17.10 Applications of Token Bucket
- 17.11 Token Bucket Queue Utilization
- 17.12 Hierarchical Token Bucket
- 17.13 Fair Queuing / Token Bucket combinations
- 17.14 Epilog
- 17.15 Exercises
- 18 Quality of Service
- 18.1 Net Neutrality
- 18.2 Where the Wild Queues Are
- 18.3 Real-time Traffic
- 18.4 Integrated Services / RSVP
- 18.5 Global IP Multicast
- 18.6 RSVP
- 18.7 Differentiated Services
- 18.8 RED with In and Out
- 18.9 NSIS
- 18.10 Comcast Congestion-Management System
- 18.11 Real-time Transport Protocol (RTP)
- 18.12 Multi-Protocol Label Switching (MPLS)
- 18.13 Epilog
- 18.14 Exercises
- Bibliography
No comments:
Post a Comment