1 / 32

EEC-484/584 Computer Networks

EEC-484/584 Computer Networks. Lecture 7 Wenbing Zhao wenbingz@gmail.com (Part of the slides are based on Drs. Kurose & Ross ’ s slides for their Computer Networking book). Outline. Reminder No class next Monday Oct.11, Columbus Day Move discussion#2 to Oct. 18, and Lab#3 to Oct. 22

rowan-ferrell
Download Presentation

EEC-484/584 Computer Networks

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. EEC-484/584Computer Networks Lecture 7 Wenbing Zhao wenbingz@gmail.com (Part of the slides are based on Drs. Kurose & Ross’s slides for their Computer Networking book)

  2. Outline Reminder No class next Monday Oct.11, Columbus Day Move discussion#2 to Oct. 18, and Lab#3 to Oct. 22 Reliable data transfer (part II) Pipelining protocols UDP EEC-484/584: Computer Networks

  3. rdt2.0 has a fatal flaw! What happens if ACK/NAK corrupted? sender doesn’t know what happened at receiver! can’t just retransmit: possible duplicate Handling duplicates: sender retransmits current pkt if ACK/NAK garbled sender adds sequence number to each pkt receiver discards (doesn’t deliver up) duplicate pkt stop and wait Sender sends one packet, then waits for receiver response 11/7/2014 EEC-484/584: Computer Networks Wenbing Zhao

  4. rdt2.1: sender handles garbled ACK/NAKs Wait for ACK or NAK 0 Wait for call 1 from above Wait for ACK or NAK 1 rdt_send(data) sndpkt = make_pkt(0, data, checksum) udt_send(sndpkt) rdt_rcv(rcvpkt) && ( corrupt(rcvpkt) || isNAK(rcvpkt) ) Wait for call 0 from above udt_send(sndpkt) rdt_rcv(rcvpkt) && notcorrupt(rcvpkt) && isACK(rcvpkt) rdt_rcv(rcvpkt) && notcorrupt(rcvpkt) && isACK(rcvpkt) L L rdt_rcv(rcvpkt) && ( corrupt(rcvpkt) || isNAK(rcvpkt) ) rdt_send(data) sndpkt = make_pkt(1, data, checksum) udt_send(sndpkt) udt_send(sndpkt) 11/7/2014 EEC-484/584: Computer Networks Wenbing Zhao

  5. rdt2.1: receiver handles garbled packets Wait for 0 from below Wait for 1 from below rdt_rcv(rcvpkt) && notcorrupt(rcvpkt) && has_seq0(rcvpkt) extract(rcvpkt,data) deliver_data(data) sndpkt = make_pkt(ACK, chksum) udt_send(sndpkt) rdt_rcv(rcvpkt) && (corrupt(rcvpkt) rdt_rcv(rcvpkt) && (corrupt(rcvpkt) sndpkt = make_pkt(NAK, chksum) udt_send(sndpkt) sndpkt = make_pkt(NAK, chksum) udt_send(sndpkt) rdt_rcv(rcvpkt) && not corrupt(rcvpkt) && has_seq1(rcvpkt) rdt_rcv(rcvpkt) && not corrupt(rcvpkt) && has_seq0(rcvpkt) sndpkt = make_pkt(ACK, chksum) udt_send(sndpkt) sndpkt = make_pkt(ACK, chksum) udt_send(sndpkt) rdt_rcv(rcvpkt) && notcorrupt(rcvpkt) && has_seq1(rcvpkt) extract(rcvpkt,data) deliver_data(data) sndpkt = make_pkt(ACK, chksum) udt_send(sndpkt) 11/7/2014 EEC-484/584: Computer Networks Wenbing Zhao

  6. rdt2.1: discussion Sender: seq # added to pkt two seq. #’s (0,1) will suffice. Why? must check if received ACK/NAK corrupted twice as many states state must “remember” whether “current” pkt has 0 or 1 seq. # Receiver: must check if received packet is duplicate state indicates whether 0 or 1 is expected pkt seq # note: receiver can not know if its last ACK/NAK received OK at sender 11/7/2014 EEC-484/584: Computer Networks Wenbing Zhao

  7. rdt2.2: a NAK-free protocol Same functionality as rdt2.1, using acks only Instead of NAK, receiver sends ACK for last pkt received OK Receiver must explicitly include seq # of pkt being acked Duplicate ACK at sender results in same action as NAK: retransmit current pkt 11/7/2014 EEC-484/584: Computer Networks Wenbing Zhao

  8. rdt2.2: sender, receiver fragments Wait for call 0 from above Wait for ACK 0 Wait for 0 from below rdt_send(data) sndpkt = make_pkt(0, data, checksum) udt_send(sndpkt) rdt_rcv(rcvpkt) && ( corrupt(rcvpkt) || isACK(rcvpkt,1) ) udt_send(sndpkt) sender FSM fragment rdt_rcv(rcvpkt) && notcorrupt(rcvpkt) && isACK(rcvpkt,0) rdt_rcv(rcvpkt) && (corrupt(rcvpkt) || has_seq1(rcvpkt)) L receiver FSM fragment udt_send(sndpkt) rdt_rcv(rcvpkt) && notcorrupt(rcvpkt) && has_seq1(rcvpkt) extract(rcvpkt,data) deliver_data(data) sndpkt = make_pkt(ACK1, chksum) udt_send(sndpkt) 11/7/2014 EEC-484/584: Computer Networks Wenbing Zhao

  9. rdt3.0: channels with errors and loss New assumption: underlying channel can also lose packets (data or acks) Checksum, seq. #, Acks, retransmissions will be of help, but not enough Approach: sender waits “reasonable” amount of time for ACK Retransmits if no ACK received in this time If pkt (or ACK) just delayed (not lost): Retransmission will be duplicate, but use of seq. #’s already handles this Receiver must specify seq # of pkt being acked Requires countdown timer EEC-484/584: Computer Networks

  10. rdt3.0 sender Wait for ACK0 Wait for ACK1 Wait for call 1 from above Wait for call 0from above rdt_send(data) rdt_rcv(rcvpkt) && ( corrupt(rcvpkt) || isACK(rcvpkt,1) ) sndpkt = make_pkt(0, data, checksum) udt_send(sndpkt) start_timer L rdt_rcv(rcvpkt) L timeout udt_send(sndpkt) start_timer rdt_rcv(rcvpkt) && notcorrupt(rcvpkt) && isACK(rcvpkt,1) rdt_rcv(rcvpkt) && notcorrupt(rcvpkt) && isACK(rcvpkt,0) stop_timer stop_timer timeout udt_send(sndpkt) start_timer rdt_rcv(rcvpkt) L rdt_send(data) rdt_rcv(rcvpkt) && ( corrupt(rcvpkt) || isACK(rcvpkt,0) ) sndpkt = make_pkt(1, data, checksum) udt_send(sndpkt) start_timer L EEC-484/584: Computer Networks

  11. rdt3.0 in action EEC-484/584: Computer Networks

  12. rdt3.0 in action EEC-484/584: Computer Networks

  13. Performance of rdt3.0 rdt3.0 works, but performance stinks ex: 1 Gbps link, 15 ms prop. delay, 8000-bit packet: • U sender: utilization – fraction of time sender busy sending • 1KB pkt every 30 msec -> 33kB/sec thruput over 1 Gbps link • network protocol limits use of physical resources! EEC-484/584: Computer Networks

  14. rdt3.0: stop-and-wait operation sender receiver first packet bit transmitted, t = 0 last packet bit transmitted, t = L / R first packet bit arrives RTT last packet bit arrives, send ACK ACK arrives, send next packet, t = RTT + L / R EEC-484/584: Computer Networks

  15. Pipelined Protocols Pipelining: sender allows multiple, “in-flight”, yet-to-be-acknowledged pkts range of sequence numbers must be increased buffering at sender and/or receiver Two generic forms of pipelined protocols: go-back-N, selective repeat EEC-484/584: Computer Networks

  16. Pipelining: Increased Utilization sender receiver first packet bit transmitted, t = 0 last bit transmitted, t = L / R first packet bit arrives RTT last packet bit arrives, send ACK last bit of 2nd packet arrives, send ACK last bit of 3rd packet arrives, send ACK ACK arrives, send next packet, t = RTT + L / R Increase utilization by a factor of 3! EEC-484/584: Computer Networks

  17. Pipelining Protocols Go-back-N: big picture: Sender can have up to N unacked packets in pipeline Rcvr only sends cumulative acks Doesn’t ack packet if there’s a gap Sender has timer for oldest unacked packet If timer expires, retransmit all unacked packets Selective Repeat: big pic Sender can have up to N unacked packets in pipeline Rcvr acks individual packets Sender maintains timer for each unacked packet When timer expires, retransmit only unack packet EEC-484/584: Computer Networks

  18. Go-Back-N Sender: k-bit seq # in pkt header “window” of up to N consecutive unack’ed pkts allowed • ACK(n): ACKs all pkts up to, including seq # n - “cumulative ACK” • may receive duplicate ACKs (see receiver) • timer for oldest in-flight pkt • timeout(n): retransmit pkt n and all higher seq # pkts in window EEC-484/584: Computer Networks

  19. GBN: Sender Extended FSM Wait rdt_send(data) if (nextseqnum < base+N) { sndpkt[nextseqnum] = make_pkt(nextseqnum,data,chksum) udt_send(sndpkt[nextseqnum]) if (base == nextseqnum) // start timer if first unacked pkt start_timer nextseqnum++ } else refuse_data(data) L base=1 nextseqnum=1 timeout start_timer udt_send(sndpkt[base]) udt_send(sndpkt[base+1]) … udt_send(sndpkt[nextseqnum-1]) rdt_rcv(rcvpkt) && corrupt(rcvpkt) rdt_rcv(rcvpkt) && notcorrupt(rcvpkt) base = getacknum(rcvpkt)+1 If (base == nextseqnum) // no more unacked pkts stop_timer else start_timer EEC-484/584: Computer Networks

  20. GBN: Receiver Extended FSM ACK-only: always send ACK for correctly-received pkt with highest in-order seq # may generate duplicate ACKs need only remember expectedseqnum out-of-order pkt: discard (don’t buffer) -> no receiver buffering! Re-ACK pkt with highest in-order seq # default udt_send(sndpkt) rdt_rcv(rcvpkt) && notcurrupt(rcvpkt) && hasseqnum(rcvpkt,expectedseqnum) L Wait extract(rcvpkt,data) deliver_data(data) sndpkt = make_pkt(expectedseqnum,ACK,chksum) udt_send(sndpkt) expectedseqnum++ expectedseqnum=1 sndpkt = make_pkt(expectedseqnum,ACK,chksum) EEC-484/584: Computer Networks

  21. GBN inaction EEC-484/584: Computer Networks

  22. Selective Repeat Receiver individually acknowledges all correctly received pkts Buffers pkts, as needed, for eventual in-order delivery to upper layer Sender only resends pkts for which ACK not received Sender timer for each unacked pkt Sender window N consecutive seq #’s Again limits seq #s of sent, unacked pkts EEC-484/584: Computer Networks

  23. Selective Repeat: Sender, Receiver Windows EEC-484/584: Computer Networks

  24. Selective Repeat data from above : if next available seq # in window, send pkt timeout(n): resend pkt n, restart timer ACK(n) in [sendbase,sendbase+N-1]: mark pkt n as received if n smallest unACKed pkt, advance window base to next unACKed seq # Receiver Sender pkt n in [rcvbase, rcvbase+N-1] • send ACK(n) • out-of-order: buffer • in-order: deliver (also deliver buffered, in-order pkts), advance window to next not-yet-received pkt pkt n in [rcvbase-N,rcvbase-1] • ACK(n) otherwise: • ignore EEC-484/584: Computer Networks

  25. Selective Repeat In Action EEC-484/584: Computer Networks

  26. Selective Repeat: Dilemma Example: seq #’s: 0, 1, 2, 3 window size=3 receiver sees no difference in two scenarios! incorrectly passes duplicate data as new in (a) Q: what relationship between seq # size and window size? EEC-484/584: Computer Networks

  27. Non-Sequential Receive Problem The problem is caused by the overlap of sequence number between the new receiving window and the old receiving window 0 0 3 3 6 6 2 2 5 5 1 1 4 4 7 7 0 3 6 0 3 6 2 5 2 5 1 4 7 1 4 7 0 1 2 3 4 5 6 Overlap Overlap EEC-484/584: Computer Networks

  28. Non-Sequential Receive Problem Solution: make sure no overlap when receiver advances its window Make window size w =1/2 range of seq numbers 0 0 3 3 6 6 2 2 5 5 1 1 4 4 7 7 0 3 6 0 3 6 2 5 2 5 1 4 7 1 4 7 No Overlap 0 1 2 3 EEC-484/584: Computer Networks

  29. UDP: User Datagram Protocol “No frills,” “bare bones” Internet transport protocol “Best effort” service, UDP segments may be: Lost Delivered out of order to app Connectionless: No handshaking between UDP sender, receiver Each UDP segment handled independently of others EEC-484/584: Computer Networks

  30. Why is There a UDP? No connection establishment (which can add delay) Simple: no connection state at sender and receiver Small segment header No congestion control: UDP can blast away as fast as desired EEC-484/584: Computer Networks

  31. UDP Often used for streaming multimedia apps Loss tolerant Rate sensitive Other UDP uses DNS SNMP Reliable transfer over UDP: add reliability at application layer 32 bits source port # dest port # Length, in bytes of UDP segment, including header checksum length Application data (message) UDP segment format EEC-484/584: Computer Networks

  32. UDP Checksum Sender: treat segment contents as sequence of 16-bit integers checksum: addition (1’s complement sum) of segment contents sender puts checksum value into UDP checksum field Receiver: compute checksum of received segment check if computed checksum equals checksum field value: NO - error detected YES - no error detected. But maybe errors nonetheless? • Goal:detect “errors” (e.g., flipped bits) in transmitted segment EEC-484/584: Computer Networks

More Related