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: Lectures
Solution to midterm, lectures posted
Lectures 13 & 14 in pdf uploaded. Also, the solution to the midterm exam is posted.
A simple model for TCP congestion control
Network congestion is unavoidable under the “best-effort” paradigm. There are several ways to deal with congestion. TCP chooses to dynamically adjust the sending rate. When there’s congestion, reduce the rate; otherwise increase the rate. We want the total load on … Continue reading
Posted in Lectures
Tagged additive increase, AIMD, congestion control, Lectures, multiplicative decrease, system control model, TCP
Leave a comment