RainのBlog
CtrlK
  • Welcome to RAINのBlog
  • CSDIY Notes
    • Data Structure
      • Chapter 1 Introduction to Data Structures
      • Chapter 2 Algorithms
      • Chapter 3 Linear Lists
      • Chapter 4 Stacks and Queues
      • Chapter 5 String
      • Chapter 6 Trees
      • Chapter 7 Diagram
      • Chapter 8. Search
      • Chapter 9 Sorting
      • Chapter 10 Arrays and Generalized Lists
    • Linux Vbird Basis
      • 00-. Introduction to Computer
      • 01-. Linux Introduction
      • 02-. Linux Host Planning and Disk Partitioning
      • 03-. Linux Environment Installation
      • 04-. Linux System Login and Help
      • 05-. Linux File Permissions and Directory Configuration
      • 06-. Linux File and Directory Management
      • 07-.Linux Disk and File System Management
      • 08-. Linux File Compression, Packaging and Backup
      • 09-. Vim Program Editor
      • 10-. Bash Command Line Interpreter
      • 11-. Regular Expressions and File Formatting
      • 12-. Shell Scripts Programming Language
      • 13-. Linux Accounts and ACL Permissions
      • 14-. Linux Disk Quota and File System Management
      • 15-. Linux Task Scheduling
      • 16-. Linux Processes and SELinux
      • 17-. Linux System Services
      • 18-. Linux Login File
      • 19-. Linux Boot, Modules and Loaders
      • 20-. Linux System Configuration and Backup
      • 21-. Linux Source Code and Tarball
      • 22-. Linux Software Installation
      • 23-. Linux X Window Settings
      • 24-. Linux Kernel Compilation and Management
    • MySQL Tutorial
      • 00. MySQL Knowledge Overview
      • 01. SQL Basics
      • 02. Functions, Constraints, Multi-table Queries and Transactions
      • 04 - Index
      • 05 - SQL Optimization
      • 06 - Views, stored procedures, triggers
      • 07 - Lock
      • 08 - InnoDB Engine
      • 09 - MySQL management, Log management
      • 10 - Master-slave replication, Read-write separation
      • 11 - Split database and table
    • Harvard - CS 50
      • 01 - CS50 Introduction & Computer Basics
      • 02 - Algorithm Design
      • 03 - Pointers and GDB
      • 04 - Data Structure & Network and Security
      • 05 - Database and Web Development
      • 06 - Conclusion
    • Stanford - CS 144
      • Unit 1. The Internet and IP Introduction
      • Unit 2. Transport
      • Unit 3. Packet Switching
      • Unit 4. Control Congestion
      • Unit 5. Applications and NATs
      • Unit 6. Routing
      • Unit 7. Lower Layers
      • Unit 8. Security
      • Unit 9. Interview
      • Lab 0: Networking Warmup
      • Lab 1: Stitching Substrings into a Byte Stream
    • NJU - OSP
      • 01 - Operating Systems in the Age of AI
      • 02 - Operating Systems from an Applied Perspective
      • 03 - Hardware Perspective on Operating Systems
      • 04 - Mathematical Perspectives on Operating Systems
      • 05 - Programs and processes
      • 06 - mmap and the process address space
      • 07 - Accessing OS interobjects
      • 08 - Terminal and UNIX Shell
      • 09 - C Standard Library and Implementation
      • 10 - Executable files
      • 11 - Dynamic linking and loading
      • 12 - Building the application ecosystem
      • 13 - Multiprocessor Programming: From Getting Started to Giving Up
      • 14 - Concurrency control: mutual exclusion
      • 15 - Concurrency control: synchronization (1)
      • 16 - Concurrency control: synchronization (2)
      • Page 5
      • Page 6
      • Page 7
      • Page 8
      • Page 9
      • Page 10
      • Page 11
      • Page 12
      • Page 13
      • Page 14
      • Page 15
      • Page 16
    • Operating Systems - Three Easy Pieces
      • Chapter 2 Introduction to Operating Systems
      • Part 1 Virtualization
        • Chapter 4 Abstraction: Processes
        • Chapter 5 Interlude: Process APIs
        • Chapter 13 Abstraction: Address Spaces
        • Chapter 14 Interpolation: Memory Manipulation APIs
        • Chapter 17 Free Space Management
        • Chapter 18 Paging: Introduction
        • Chapter 19 Paging: Fast Address Translation (TLB)
        • Chapter 20 Paging: smaller tables
        • Chapter 21 Beyond Physical Memory: Mechanisms
        • Chapter 22 Beyond Physical Memory: Strategies
        • Chapter 23 VAX/VMS Virtual Memory System
      • Part 2 Concurrency
        • Chapter 26 Concurrency: an introduction
        • Chapter 27 Interlude: The Threading API
        • Chapter 28 Locks
        • Chapter 29 Lock-Based Concurrent Data Structures
        • Chapter 30 Conditional Variables
        • Chapter 31 Signal Quantity
      • Part 3 Persistence
        • Chapter 39 Interpolation: documentation and directories
  • Turing College
    • Daily Coding Task
      • Copy of Answer of Tech-man
      • 20250223-Rain
      • 20250224-Rain
      • 20250225-Rain
      • 20250226-Rain
      • 20250227-Rain
      • 20250228-Rain
      • 20250301-Rain
      • 20250302-Rain
      • 20250303-Rain
      • 20250304-Rain
      • 20250305-Rain
      • 20250306-Rain
    • Project 1
      • Check
  • BILIBILI WILD
    • Full Stack 150 mins
    • TCP Com-Demo
    • Website Development
    • Multithreading and Thread Synchrony
    • GDB Debugger
    • Student Management System
    • JSON && XML Crush
      • JSON
      • XML
    • QT Group Chat
  • ALGORITHM 101
    • Day0 - Are you ready?
    • Level1 - Fundamentals of Data Structures
      • Day1 - Algorithms by Hand in Interview
      • Day2 - Array Pre-Knowledge
      • Day3 - String Pre-Knowledge
      • Day4 - Hash Table Pre-Knowledge
      • Day5 - List Pre-Knowledge
      • Day6 - Stack Pre-Knowledge
      • Day7 - Queue Pre-Knowledge
    • Level 2 - Algorithm Basics
      • Day 8 - Pre-Knowledge for Recursion
      • Day 9 - Sorting Pre-Knowledge
      • Day 10 - Pre-Knowledge for Binary Search
      • Day 11 - Pre-Knowledge for Dynamic Programming
      • Day 12 - Pre-Knowledge for Reviewing
      • Day 13 - KMP Algorithm
    • Level3 - Array
      • Day 14 - 1. two sum
      • Day 26 - 15. 3sum
    • Level4 - Bitwise Operations
      • Introduction - C++ Bitwise Operations
      • Day28 - 371.sum of two integers
      • Day 29 - 191.number of 1 bits
      • Day 30 - 338.counting bits
      • Day 31 - 268.missing number
      • Day32 - 190.reverse bits
    • Level5 - Dynamic Programming
      • Introduction - Dynamic Programming
      • Day33 - 70.climbing stairs
  • Life
    • Sport
      • Running
        • Train Record
      • Basketball
        • Forward & Guard Train 30min
    • 日本語
      • 五十音順
  • Some Thoughts
    • Learning of Gitbook
    • Learning Recording
      • Operating System
      • Data Structure
      • Computer Network
      • Database
      • Computer Organization Principles
      • Tech
Powered by GitBook
On this page
  1. CSDIY Notes

Stanford - CS 144

斯坦福 144 计算机网络导论

Unit 1. The Internet and IP IntroductionUnit 2. TransportUnit 3. Packet SwitchingUnit 4. Control CongestionUnit 5. Applications and NATsUnit 6. RoutingUnit 7. Lower LayersUnit 8. SecurityUnit 9. InterviewLab 0: Networking WarmupLab 1: Stitching Substrings into a Byte Stream
Previous06 - ConclusionNextUnit 1. The Internet and IP Introduction