Bài giảng "Mạng máy tính nâng cao: TCP & Congestion control" cung cấp cho người học các kiến thức: Communication abstraction, sliding window with cumulative acks. nội dung chi tiết. | Bài giảng Mạng máy tính nâng cao: TCP & Congestion control - Lê Ngọc Sơn TCP & Congestion Control MẠNG MÁY TÍNH NÂNG CAO Tháng 09/2015 Introduction to TCP q Communication abstraction: § Reliable § Ordered § Point-to-point § Byte-stream § Full duplex § Flow and congestion controlled q Sliding window with cumulative acks § Ack field contains last in-order packet received § Duplicate acks sent when out-of-order packet received Evolution of TCP 1984 1975 Nagel’s algorithm Three-‐way handshake to reduce overhead 1987 Raymond Tomlinson of small packets; Karn’s algorithm 1990 In S IGCOMM 75 predicts congestion to better estimate Reno collapse round-‐trip time fast retransmit delayed ACK’s 1983 BSD Unix 1986 1988 1974 supports TCP/IP Congestion collapse Van Jacobson’s algorithms observed congestion avoidance and TCP described by congestion control Vint Cerf and B ob Kahn In IEEE Trans Comm 1982 (most implemented in TCP & IP Tahoe) RFC 7 93 & 7 91 1975 1980 1985 1990 TCP Through the 1990s 1994 1996 T/TCP SACK TCP (Braden) (Floyd et al) Transaction Selective TCP Acknowledgement 1993 1994 1996 1996 TCP Vegas ECN Hoe FACK TCP (Brakmo et al) (Floyd) Improving TCP (Mathis et al) real congestion Explicit startup extension to S ACK avoidance Congestion Notification 1993 1994 1996 Flow Control vs. Congestion Control q Flow control § Keeping one fast sender from .
