序号为课件内每章节序号
3.
缩写 | En | Move |
---|---|---|
MUX | multiplexing | serveral streams of data into a singal stream; handle data from multiple socket, add transport header |
DEMUX | demultiplexing | separated out into its individual component; use header info to deliver received segment to correct socket |
UDP | User datagram protocol | 8 Bytes; src port, dest port, len, checksum |
Encapsulation/Decapsulation | add layers headers | |
rdt | reliable data transfer protocol | 看下方rdt总结 |
FSM | finite state machines | 有限状态机 |
Utilization | U = L / R R T T + L / R U=\frac{L/R}{RTT+L/R} U=RTT+L/RL/R | |
GBN | Go-Back-N | 只回复序列号最高那个;如果有Gap,回Gap前序号最高的 |
Selective Repeat | 对每一个包都回ACK;如果有Gap,等待Gap填充上再接着回 | |
TCP | Transmission Control Protocol | 20 Bytes; 比UDP多了: Seq#, Ack#, Rwnd, Options, Head len, ACK,RST,SYN,FIN… |
Seq# | Sequency number | 为byte stream中,segment data第一个byte的位置 |
Ack# | acknowledgement number | 期待从另一端收到的下一个Seq#的号 |
RTT | Round Trip Time | |
TCP Fast Retransmit | 3 ACKs for same data | |
Flow Control | Receiver advertise its buffer size to sender | |
rwnd | receiver window | The purpose of this window: not too fast for receiver |
MSS | Maximum Segment Size | 传输层的Segment中包含的应用层数据的最大长度 |
MTU | Maximum Transmission Unit | 最大链路层Frame大小 MTU=MSS+IP+TCP |
Nagle’s Algorithm | 通过减少需要通过网络发送包的数量来提高TCP/IP传输速率,小包问题;FlowControl | |
Silly Window Syndrome | ||
Congestion Control | The purpose of it: | |
AIMD | Additive Increase, Multiplicative Decrease | AI: increase cwnd 1 MSS every RTT; MD: cut cwnd in half after loss |
cwnd | congestion window | The purpose of this window: not too fast for network |
Slow Start | Initial: cwmd = 1 MSS; double cwnd every RTT | |
TCP RENO | cut cwnd in half; (3 duplicate acks) | |
TCP Tahoe | set cwnd to 1; (timeout or 3 duplicate acks) | |
TCP throughput | as function of window size and RTT t h r u p u t = 3 W 4 R T T thruput=\frac{3W}{4RTT} thruput=4RTT3W |