Meta
-
Recent Comments
-
Recent Posts
Tags
administrative aspects announcement ARQ Assignment Assignments autonomous systems BGP botnet circuit switching congestion control connect delay DHT DNS email Ethernet Final exam gethostbyname gethostname getsockname Go-back-N Hubs Internet checksum Internet topology Kaminski bug lecture Lectures Midterm multiplexing net neutrality Network Programming NQH's implementation P2P packet switching Peering programming Projects Recitation Routing protocols security selective repeat smtp TCP udp welcomeArchives
Blogroll
History and philosophy
IPv6
Major networking organizations
Network Programming
Similar courses & introductory materials
System Programming
- GNU Make Manual
- IA32 Intel Architecture Software Developer's Manual, Volume 1: Basic Architecture
- IA32 Intel Architecture Software Developer's Manual, Volume 2: Instruction Set Reference Manual
- IA32 Intel Architecture Software Developer's Manual, Volume 3: System Programming Guide
- Tool Interface Standard (TIS) Executable and Linking Format (ELF) Specification
- Using as, the GNU Assembler
Tag Archives: selective repeat
Summary of Lecture on Wed Sep 29
We discussed pipelining (sliding window) protocols To increase channel utilization, we have to allow the sender to transmit many packets before they are acknowledged: the pipelining mechanism. Go-back-N and selective repeat are two basic pipelining protocols. Go-back-N is simpler, but Selective Repeat … Continue reading
Summary of lecture on Mon Sep 27
We discussed briefly the Internet checksum algorithm. For more details, you can check out RFC 1071, and some performance enhancement recommendations in RFC 1141 and RFC 1624. Computing the checksum efficiently is extremely important because every single packet is sum-checked … Continue reading