William Stalling - Chapter 17x

William Stallings
Data and Computer

Communications
Chapter 17
Transport Protocols
Finding Addresses
 Four methods
 Know address ahead of time
 e.g. collection of network device stats
 Well known addresses
 Name server
 Sending process request to well known address
Flow Control
 Longer transmission delay between transport
entities compared with actual transmission time
 Delay in communication of flow control info
 Variable transmission delay
 Difficult to use timeouts
 Flow may be controlled because:
 The receiving user can not keep up
 The receiving transport entity can not keep up
 Results in buffer filling up
Coping with Flow Control
Requirements (2)
 Use fixed sliding window protocol
 See chapter 7 for operational details
 Works well on reliable network
 Failure to receive ACK is taken as flow control indication
 Does not work well on unreliable network
 Can not distinguish between lost segment and flow control
 Use credit scheme
Credit Scheme
 Greater control on reliable network
 More effective on unreliable network
 Decouples flow control from ACK
 May ACK without granting credit and vice versa
 Each octet has sequence number
 Each transport segment has seq number, ack
number and window size in header
Use of Header Fields
 When sending, seq number is that of first octet
in segment
 ACK includes AN=i, W=j
 All octets through SN=i-1 acknowledged
 Next expected octet is i
 Permission to send additional window of W=j
octets
 i.e. octets through i+j-1
Connection Establishment
Not Listening
 Reject with RST (Reset)
 Queue request until matching open issued
 Signal TS user to notify of pending request
 May replace passive open with accept
Ordered Delivery
 Segments may arrive out of order
 Number segments sequentially
 TCP numbers each octet sequentially
 Segments are numbered by the first octet
number in the segment
Retransmission Strategy
 Segment damaged in transit
 Segment fails to arrive
 Transmitter does not know of failure
 Receiver must acknowledge successful receipt
 Use cumulative acknowledgement
 Time out waiting for ACK triggers
re-transmission
Timer Value
 Fixed timer
 Based on understanding of network behavior
 Can not adapt to changing network conditions
 Too small leads to unnecessary re-transmissions
 Too large and response to lost segments is slow
 Should be a bit longer than round trip time
 Adaptive scheme
 May not ACK immediately
 Can not distinguish between ACK of original segment
and re-transmitted segment
 Conditions may change suddenly
Two Way
Handshake:
Obsolete
Data
Segment
Two Way Handshake:
Obsolete SYN Segment
Three Way
Handshake:
State
Diagram
Three Way
Handshake:
Examples
TCP & UDP
 Transmission Control Protocol
 Connection oriented
 RFC 793
 User Datagram Protocol (UDP)
 Connectionless
 RFC 768
TCP Services
 Reliable communication between pairs of processes
 Across variety of reliable and unreliable networks and
internets
 Two labeling facilities
 Data stream push
 TCP user can require transmission of all data up to push flag
 Receiver will deliver in same manner
 Avoids waiting for full buffers
 Urgent data signal
 Indicates urgent data is upcoming in stream
 User decides how to handle it
TCP Header
Items Passed to IP
 TCP passes some parameters down to IP
 Precedence
 Normal delay/low delay
 Normal throughput/high throughput
 Normal reliability/high reliability
 Security
TCP Mechanisms (1)
 Connection establishment
 Three way handshake
 Between pairs of ports
 One port can connect to multiple destinations
TCP Mechanisms (2)
 Data transfer
 Logical stream of octets
 Octets numbered modulo 223
 Flow control by credit allocation of number of octets
 Data buffered at transmitter and receiver
TCP Mechanisms (3)
 Connection termination
 Graceful close
 TCP users issues CLOSE primitive
 Transport entity sets FIN flag on last segment sent
 Abrupt termination by ABORT primitive
 Entity abandons all attempts to send or receive data
 RST segment transmitted
Implementation Policy Options
 Send
 Deliver
 Accept
 Retransmit
 Acknowledge
Send
 If no push or close TCP entity transmits at its
own convenience
 Data buffered at transmit buffer
 May construct segment per data batch
 May wait for certain amount of data
Deliver
 In absence of push, deliver data at own
convenience
 May deliver as each in order segment received
 May buffer data from more than one segment
Accept
 Segments may arrive out of order
 In order
 Only accept segments in order
 Discard out of order segments
 In windows
 Accept all segments within receive window
Retransmit
 TCP maintains queue of segments transmitted
but not acknowledged
 TCP will retransmit if not ACKed in given time
 First only
 Batch
 Individual
Acknowledgement
 Immediate
 Cumulative
Congestion Control
 RFC 1122, Requirements for Internet hosts
 Retransmission timer management
 Estimate round trip delay by observing pattern of
delay
 Set time to value somewhat greater than estimate
 Simple average
 Exponential average
 RTT Variance Estimation (Jacobson’s algorithm)
Use of
Exponential
Averaging
Jacobson’s
RTO
Calculation
Exponential RTO Backoff
 Since timeout is probably due to congestion
(dropped packet or long round trip), maintaining
RTO is not good idea
 RTO increased each time a segment is
re-transmitted
 RTO = q*RTO
 Commonly q=2
 Binary exponential backoff
Karn’s Algorithm
 If a segment is re-transmitted, the ACK arriving
may be:
 For the first copy of the segment
 RTT longer than expected
 For second copy
 No way to tell
 Do not measure RTT for re-transmitted segments
 Calculate backoff when re-transmission occurs
 Use backoff RTO until ACK arrives for segment
that has not been re-transmitted
Window Management
 Slow start
 awnd = MIN[credit, cwnd]
 Start connection with cwnd=1
 Increment cwnd at each ACK, to some max
 Dynamic windows sizing on congestion
 When a timeout occurs
 Set slow start threshold to half current congestion window
 ssthresh=cwnd/2
 Set cwnd = 1 and slow start until cwnd=ssthresh
 Increasing cwnd by 1 for every ACK
 For cwnd >=ssthresh, increase cwnd by 1 for each RTT
UDP
 User datagram protocol
 RFC 768
 Connectionless service for application level
procedures
 Unreliable
 Delivery and duplication control not guaranteed
 Reduced overhead
 e.g. network management (Chapter 19)
UDP Uses
 Inward data collection
 Outward data dissemination
 Request-Response
 Real time application
UDP Header
Required Reading
 Stallings chapter 17
 RFCs

William Stalling - Chapter 17x

Uploaded by

Copyright:

Available Formats

William Stalling - Chapter 17x

Uploaded by

Document Information

Original Description:

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

William Stalling - Chapter 17x

Uploaded by

Copyright:

Available Formats

William Stallings

Data and Computer

You might also like