SlideShare ist ein Scribd-Unternehmen logo
1 von 58
Network Essentials Session 1 R. Venkateswaran
Outline ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Acknowledgments ,[object Object],[object Object],[object Object],[object Object],[object Object]
Network Models ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
OSI 7-Layer Model IP TCP/UDP Virtual End-to-end connectivity Path selection, Internetworking Error-free communication links Transmission of raw signal Mail, Web, etc. 1 3 2 4 5 6 7 Ethernet Data encryption,compression Managing sessions Funtionality Examples Layers Application Presentation Session Transport Network Data Link Physical
OSI 7-Layer Host Router Router Host End to end Hop by hop Application Presentation Session Transport Network Link Physical Network Link Link Network Link Link Physical Physical Application Presentation Session Transport Network Link
TCP/IP Model Host Router Router End to end No session or presentation layers in TCP/IP model Host Hop by hop Application Transport Network Link Physical Network Link Link Network Link Link Physical Physical Application Transport Network Link
Packet structure Trailer Header Header Header Application Transport Network Data Link Data Transport Layer Data Network Layer Data Link Layer Data
Network Layer
Internet Architecture ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
IP - Minimalist Approach ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
IPv4 Header Transport Layer Data… 0 4 8 16 32 IHL Type of Service Total Length Version Fragment Offset Identification Flags Time to Live Protocol Header Checksum Source Address Destination Address Padding Options
IP Address ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],133 27 162 125 10000101 00011011 10100010 01111101 85 1B A2 7D Decimal Binary HEX NetID Host ID Boundary
Network Mask ,[object Object],[object Object],[object Object],[object Object],[object Object]
Network Mask Examples 137.158.128.0/ 17  (netmask  255.255.128.0 ) 1111 1111 1111 1111  1  000 0000  0000 0000  1111 1111 1111 1111  0000 0000  0000 0000  1111 1111 1111 1111  1111 1111 11  00 0000  198.134.0.0/ 16  (netmask  255.255.0.0 ) 205.37.193.128/ 26   (netmask  255.255.255.192 ) 1000 1001  1001 1110  1  000 0000  0000 0000  1100 0110  1000 0110  0000 0000  0000 0000  1100 1101  0010 0101  1100 0001 10  00 0000
Subnets ,[object Object],[object Object],Network consisting of 3 subnets 192.1.1.2 192.1.1.1 192.1.1.3 192.1.1.4 192.1.2.9 192.1.2.2 192.1.2.1 192.1.3.2 192.1.3.1 192.1.3.27
IP router ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Hop by Hop Forwarding
IP Forwarding Rules - I ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
IP Forwarding Rules - II ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Look up Forwarding Table Destination =12.5.9.16 ------------------------------- payload  Prefix  Interface  Next Hop  12.0.0.0/8  10.14.22.19  eth1  12.4.0.0/15  12.5.9.0/24  attached  eth2  Serial 1/0/7  10.1.3.77  IP Forwarding Table  0.0.0.0/0  10.14.11.33  eth0  even better OK better best! Longest Prefix Match (Classless) Forwarding
IP Forwarding – Example 1 Forwarding Table on host 192.1.1.1 Note:  127.0.0.1  is the special address of the local interface 192.1.3.2 192.1.1.2 192.1.1.1 192.1.1.3 192.1.1.4 192.1.3.1 192.1.3.27
IP Forwarding – Example 2 Forwarding Table on host 192.1.1.1 Note:  127.0.0.1  is the special address of the local interface 192.1.3.2 192.1.1.2 192.1.1.1 192.1.1.3 192.1.1.4 192.1.3.1 192.1.3.27
IP Forwarding – Example 2 Forwarding Table on host 192.1.1.4 Note:  127.0.0.1  is the special address of the local interface 192.1.3.2 192.1.1.2 192.1.1.1 192.1.1.3 192.1.1.4 192.1.3.1 192.1.3.27
Routing Protocols ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Distance vector algorithm - I ,[object Object],[object Object],[object Object],D x (z) ← min v {c(x,v) + D v (z)}  for each node z  ∊  N Nexthop x  (z) = v ,[object Object]
2  0  1 from from x  y  z x y z 0  2  3 from cost to x  y  z x y z 0  2  3 from cost to x  y  z x y z ∞ ∞ ∞ ∞ ∞ cost to x  y  z x y z 0  2  7 from cost to x  y  z x y z 0  2  3 from cost to x  y  z x y z 0  2  3 from cost to x  y  z x y z 0  2  7 from cost to x  y  z x y z ∞ ∞ ∞ 7 1 0 cost to ∞  ∞  ∞ 2  0  1 7  1  0 2  0  1 7  1  0 2  0  1 3  1  0 2  0  1 3  1  0 2  0  1 3  1  0 2  0  1 3  1  0 time node x table node y table node z table D x (y) = min{c(x,y) + D y (y), c(x,z) + D z (y)}    = min{2+0 , 7+1} = 2 D x (z) =  min{ c(x,y) +    D y (z), c(x,z) + D z (z) }  = min{2+1 , 7+0} = 3 ∞ x  y  z x y z 0  2  7 ∞ ∞ ∞ ∞ ∞ ∞ from cost to x z 1 2 7 y
Distance Vector: link cost changes ,[object Object],[object Object],[object Object],[object Object],“ good news  travels fast” At time  t 0 ,  y  detects the link-cost change, updates its DV,  and informs its neighbors. At time  t 1 ,  z  receives the update from  y  and updates its table.  It computes a new least cost to  x   and sends its neighbors its DV. At time  t 2 ,  y  receives  z ’s update and updates its distance table.  y ’s least costs do not change and hence  y   does  not  send any  message to  z .  x z 1 4 50 y 1
Distance Vector: link cost changes ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],x z 1 4 50 y 60
Comparison of LS and DV algorithms ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Transport Layer
Transport Protocols ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
UDP: User Datagram Protocol  [RFC 768] ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],0 16 32 Source Port Destination Port Length Checksum Application Layer Data…
TCP Header 0 Source Port Destination Port Sequence Number Acknowledgement Number Data Offset Window Reserved ACK URG EOL RST SYN FIN Checksum Urgent Pointer Padding Options 4 8 16 32 Application Layer Data…
Connection:  Three-Way  Handshake ,[object Object]
TCP Connection Setup: FSM CLIENT SERVER
TCP – Streams-based Host A Seq=100, 20 bytes data ACK=100 Host B Seq=92, 8 bytes data ACK=120 SendBase = 120 Sendbase = 100 time
TCP is Network-friendly ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Stop-and-Wait operation first packet bit transmitted, t = 0 sender receiver RTT   last packet bit transmitted,  t = L / R first packet bit arrives last packet bit arrives, send ACK ACK arrives, send next  packet,  t = RTT + L / R
Pipelining: increased utilization first packet bit transmitted, t = 0 sender receiver RTT  last bit transmitted, t = L / R first packet bit arrives last packet bit arrives, send ACK ACK arrives, send next  packet, t = RTT + L / R last bit of 2 nd  packet arrives, send ACK last bit of 3 rd  packet arrives, send ACK Increase utilization by a factor of 3!
Go-Back-N ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Go-Back-N
TCP Flow Control ,[object Object],[object Object],[object Object],sender won’t overflow receiver’s buffer by transmitting too much, too fast flow control
TCP Flow control: how it works ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
TCP congestion control: ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
TCP Slowstart ,[object Object],[object Object],initialize: Congwin = 1 for (each segment ACKed) Congwin++ until (loss event OR CongWin > threshold) Host A one segment RTT Host B two segments four segments Slowstart algorithm time
TCP Congestion Avoidance: Tahoe /* slowstart is over  */  /* Congwin > threshold */ Until (loss event) { every w segments ACKed: Congwin++ } threshold = Congwin/2 Congwin = 1 perform slowstart TCP Tahoe Congestion avoidance
Where to from here? ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Outline ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]
Thank You !
BACKUP
TCP retransmission - I ,[object Object],Host A Seq=100, 20 bytes data ACK=100 time Host B Seq=92, 8 bytes data ACK=120 Seq=92, 8 bytes data Seq=92 timeout ACK=120 Seq=92 timeout SendBase = 120 SendBase = 120 Sendbase = 100
TCP retransmission - II ,[object Object],Host A Seq=92, 8 bytes data ACK=100 loss timeout Host B X Seq=92, 8 bytes data ACK=100 time SendBase = 100
TCP Connection Tear-down Sender Receiver FIN FIN-ACK FIN FIN-ACK Data write Data ack
TCP Connection Tear-down: FSM CLOSING CLOSE WAIT FIN WAIT-1 ESTAB TIME WAIT snd FIN CLOSE send FIN CLOSE rcv ACK of FIN LAST-ACK CLOSED FIN WAIT-2 snd ACK rcv FIN delete TCB Timeout=2msl send FIN CLOSE send ACK rcv FIN snd ACK rcv FIN rcv ACK of FIN snd ACK rcv FIN+ACK
TCP retransmission - III ,[object Object],Host A Seq=92, 8 bytes data ACK=100 loss timeout Host B X Seq=100, 20 bytes data ACK=120 time SendBase = 120
Selective Ack
Selective Ack - Example

Weitere ähnliche Inhalte

Was ist angesagt?

Was ist angesagt? (20)

Computer network
Computer networkComputer network
Computer network
 
Networking basics and basic cisco commands
Networking basics and basic cisco commandsNetworking basics and basic cisco commands
Networking basics and basic cisco commands
 
Aspects Stratégiques des Réseaux
Aspects Stratégiques des RéseauxAspects Stratégiques des Réseaux
Aspects Stratégiques des Réseaux
 
Switching units
Switching unitsSwitching units
Switching units
 
Network Layer
Network LayerNetwork Layer
Network Layer
 
Expt no.3
Expt no.3Expt no.3
Expt no.3
 
Question bank cn2
Question bank cn2Question bank cn2
Question bank cn2
 
Chapter 5 : Link Layer
Chapter 5 : Link LayerChapter 5 : Link Layer
Chapter 5 : Link Layer
 
Computer Networks Homework Help
Computer Networks Homework HelpComputer Networks Homework Help
Computer Networks Homework Help
 
Prb#5
Prb#5Prb#5
Prb#5
 
02 Network Models
02 Network Models02 Network Models
02 Network Models
 
20CS2008 Computer Networks
20CS2008 Computer Networks 20CS2008 Computer Networks
20CS2008 Computer Networks
 
Lecture 06
Lecture 06Lecture 06
Lecture 06
 
Concept of Network Routing Layer
Concept of Network Routing LayerConcept of Network Routing Layer
Concept of Network Routing Layer
 
Basic Networking
Basic NetworkingBasic Networking
Basic Networking
 
Data and computer communication exam i
Data and computer communication exam iData and computer communication exam i
Data and computer communication exam i
 
20CS2007 Computer Communication Networks
20CS2007 Computer Communication Networks 20CS2007 Computer Communication Networks
20CS2007 Computer Communication Networks
 
CS6601 DISTRIBUTED SYSTEMS
CS6601 DISTRIBUTED SYSTEMSCS6601 DISTRIBUTED SYSTEMS
CS6601 DISTRIBUTED SYSTEMS
 
Vlsm
VlsmVlsm
Vlsm
 
Datalinklayer tanenbaum
Datalinklayer tanenbaumDatalinklayer tanenbaum
Datalinklayer tanenbaum
 

Andere mochten auch

Andere mochten auch (6)

Study Are B2 B Companies Getting It
Study Are B2 B Companies Getting ItStudy Are B2 B Companies Getting It
Study Are B2 B Companies Getting It
 
Honduras Powerpoint
Honduras PowerpointHonduras Powerpoint
Honduras Powerpoint
 
Munier BBN Digital
Munier BBN DigitalMunier BBN Digital
Munier BBN Digital
 
The Collective
The CollectiveThe Collective
The Collective
 
Pres Digital Uk 210709
Pres Digital Uk 210709Pres Digital Uk 210709
Pres Digital Uk 210709
 
Workflow Xs
Workflow XsWorkflow Xs
Workflow Xs
 

Ähnlich wie Intro 2 Computer Networks

Chapter 5 - Computer Networking a top-down Approach 7th
Chapter 5 - Computer Networking a top-down Approach 7thChapter 5 - Computer Networking a top-down Approach 7th
Chapter 5 - Computer Networking a top-down Approach 7thAndy Juan Sarango Veliz
 
Introduction to tcp ip linux networking
Introduction to tcp ip   linux networkingIntroduction to tcp ip   linux networking
Introduction to tcp ip linux networkingSreenatha Reddy K R
 
Introduction to the OSI 7 layer model and Data Link Layer
Introduction to the OSI 7 layer model and Data Link LayerIntroduction to the OSI 7 layer model and Data Link Layer
Introduction to the OSI 7 layer model and Data Link LayerVNIT-ACM Student Chapter
 
Chapter_3_Networking.ppt
Chapter_3_Networking.pptChapter_3_Networking.ppt
Chapter_3_Networking.pptBlaqray1998
 
Chapter_3_Networking.ppt
Chapter_3_Networking.pptChapter_3_Networking.ppt
Chapter_3_Networking.pptBlaqray1998
 
Computer Networking network layer chapter 4
Computer Networking network layer chapter 4Computer Networking network layer chapter 4
Computer Networking network layer chapter 4RoopaRathod2
 
Chapter_4_V6.11 Network layer.ppt
Chapter_4_V6.11 Network layer.pptChapter_4_V6.11 Network layer.ppt
Chapter_4_V6.11 Network layer.pptMaiTran87348
 
Protocol implementation on NS2
Protocol implementation on NS2Protocol implementation on NS2
Protocol implementation on NS2amreshrai02
 
module11-ospf(Open Shortest Path First).ppt
module11-ospf(Open Shortest Path First).pptmodule11-ospf(Open Shortest Path First).ppt
module11-ospf(Open Shortest Path First).pptElectro00
 

Ähnlich wie Intro 2 Computer Networks (20)

Chapter 5 - Computer Networking a top-down Approach 7th
Chapter 5 - Computer Networking a top-down Approach 7thChapter 5 - Computer Networking a top-down Approach 7th
Chapter 5 - Computer Networking a top-down Approach 7th
 
Introduction to tcp ip linux networking
Introduction to tcp ip   linux networkingIntroduction to tcp ip   linux networking
Introduction to tcp ip linux networking
 
Introduction to the OSI 7 layer model and Data Link Layer
Introduction to the OSI 7 layer model and Data Link LayerIntroduction to the OSI 7 layer model and Data Link Layer
Introduction to the OSI 7 layer model and Data Link Layer
 
Bellmanford
BellmanfordBellmanford
Bellmanford
 
Lecture set 5
Lecture set 5Lecture set 5
Lecture set 5
 
Chapter_3_Networking.ppt
Chapter_3_Networking.pptChapter_3_Networking.ppt
Chapter_3_Networking.ppt
 
Chapter_3_Networking.ppt
Chapter_3_Networking.pptChapter_3_Networking.ppt
Chapter_3_Networking.ppt
 
Chapter 4 v6.11
Chapter 4 v6.11Chapter 4 v6.11
Chapter 4 v6.11
 
Routing Algorithm
Routing AlgorithmRouting Algorithm
Routing Algorithm
 
Computer Networking network layer chapter 4
Computer Networking network layer chapter 4Computer Networking network layer chapter 4
Computer Networking network layer chapter 4
 
Chapter_4_V6.11 Network layer.ppt
Chapter_4_V6.11 Network layer.pptChapter_4_V6.11 Network layer.ppt
Chapter_4_V6.11 Network layer.ppt
 
IT6601 MOBILE COMPUTING
IT6601 MOBILE COMPUTINGIT6601 MOBILE COMPUTING
IT6601 MOBILE COMPUTING
 
Cnetwork
CnetworkCnetwork
Cnetwork
 
Routing
RoutingRouting
Routing
 
Protocol implementation on NS2
Protocol implementation on NS2Protocol implementation on NS2
Protocol implementation on NS2
 
Mohanccna
MohanccnaMohanccna
Mohanccna
 
Networking basics
Networking basicsNetworking basics
Networking basics
 
module11-ospf.ppt
module11-ospf.pptmodule11-ospf.ppt
module11-ospf.ppt
 
module11-ospf(Open Shortest Path First).ppt
module11-ospf(Open Shortest Path First).pptmodule11-ospf(Open Shortest Path First).ppt
module11-ospf(Open Shortest Path First).ppt
 
CCNA 200-120 Exam Quick Notes
CCNA 200-120 Exam Quick NotesCCNA 200-120 Exam Quick Notes
CCNA 200-120 Exam Quick Notes
 

Intro 2 Computer Networks

  • 1. Network Essentials Session 1 R. Venkateswaran
  • 2.
  • 3.
  • 4.
  • 5. OSI 7-Layer Model IP TCP/UDP Virtual End-to-end connectivity Path selection, Internetworking Error-free communication links Transmission of raw signal Mail, Web, etc. 1 3 2 4 5 6 7 Ethernet Data encryption,compression Managing sessions Funtionality Examples Layers Application Presentation Session Transport Network Data Link Physical
  • 6. OSI 7-Layer Host Router Router Host End to end Hop by hop Application Presentation Session Transport Network Link Physical Network Link Link Network Link Link Physical Physical Application Presentation Session Transport Network Link
  • 7. TCP/IP Model Host Router Router End to end No session or presentation layers in TCP/IP model Host Hop by hop Application Transport Network Link Physical Network Link Link Network Link Link Physical Physical Application Transport Network Link
  • 8. Packet structure Trailer Header Header Header Application Transport Network Data Link Data Transport Layer Data Network Layer Data Link Layer Data
  • 10.
  • 11.
  • 12. IPv4 Header Transport Layer Data… 0 4 8 16 32 IHL Type of Service Total Length Version Fragment Offset Identification Flags Time to Live Protocol Header Checksum Source Address Destination Address Padding Options
  • 13.
  • 14.
  • 15. Network Mask Examples 137.158.128.0/ 17 (netmask 255.255.128.0 ) 1111 1111 1111 1111 1 000 0000 0000 0000 1111 1111 1111 1111 0000 0000 0000 0000 1111 1111 1111 1111 1111 1111 11 00 0000 198.134.0.0/ 16 (netmask 255.255.0.0 ) 205.37.193.128/ 26 (netmask 255.255.255.192 ) 1000 1001 1001 1110 1 000 0000 0000 0000 1100 0110 1000 0110 0000 0000 0000 0000 1100 1101 0010 0101 1100 0001 10 00 0000
  • 16.
  • 17.
  • 18. Hop by Hop Forwarding
  • 19.
  • 20.
  • 21. Look up Forwarding Table Destination =12.5.9.16 ------------------------------- payload Prefix Interface Next Hop 12.0.0.0/8 10.14.22.19 eth1 12.4.0.0/15 12.5.9.0/24 attached eth2 Serial 1/0/7 10.1.3.77 IP Forwarding Table 0.0.0.0/0 10.14.11.33 eth0 even better OK better best! Longest Prefix Match (Classless) Forwarding
  • 22. IP Forwarding – Example 1 Forwarding Table on host 192.1.1.1 Note: 127.0.0.1 is the special address of the local interface 192.1.3.2 192.1.1.2 192.1.1.1 192.1.1.3 192.1.1.4 192.1.3.1 192.1.3.27
  • 23. IP Forwarding – Example 2 Forwarding Table on host 192.1.1.1 Note: 127.0.0.1 is the special address of the local interface 192.1.3.2 192.1.1.2 192.1.1.1 192.1.1.3 192.1.1.4 192.1.3.1 192.1.3.27
  • 24. IP Forwarding – Example 2 Forwarding Table on host 192.1.1.4 Note: 127.0.0.1 is the special address of the local interface 192.1.3.2 192.1.1.2 192.1.1.1 192.1.1.3 192.1.1.4 192.1.3.1 192.1.3.27
  • 25.
  • 26.
  • 27. 2 0 1 from from x y z x y z 0 2 3 from cost to x y z x y z 0 2 3 from cost to x y z x y z ∞ ∞ ∞ ∞ ∞ cost to x y z x y z 0 2 7 from cost to x y z x y z 0 2 3 from cost to x y z x y z 0 2 3 from cost to x y z x y z 0 2 7 from cost to x y z x y z ∞ ∞ ∞ 7 1 0 cost to ∞ ∞ ∞ 2 0 1 7 1 0 2 0 1 7 1 0 2 0 1 3 1 0 2 0 1 3 1 0 2 0 1 3 1 0 2 0 1 3 1 0 time node x table node y table node z table D x (y) = min{c(x,y) + D y (y), c(x,z) + D z (y)} = min{2+0 , 7+1} = 2 D x (z) = min{ c(x,y) + D y (z), c(x,z) + D z (z) } = min{2+1 , 7+0} = 3 ∞ x y z x y z 0 2 7 ∞ ∞ ∞ ∞ ∞ ∞ from cost to x z 1 2 7 y
  • 28.
  • 29.
  • 30.
  • 32.
  • 33.
  • 34. TCP Header 0 Source Port Destination Port Sequence Number Acknowledgement Number Data Offset Window Reserved ACK URG EOL RST SYN FIN Checksum Urgent Pointer Padding Options 4 8 16 32 Application Layer Data…
  • 35.
  • 36. TCP Connection Setup: FSM CLIENT SERVER
  • 37. TCP – Streams-based Host A Seq=100, 20 bytes data ACK=100 Host B Seq=92, 8 bytes data ACK=120 SendBase = 120 Sendbase = 100 time
  • 38.
  • 39. Stop-and-Wait operation first packet bit transmitted, t = 0 sender receiver RTT last packet bit transmitted, t = L / R first packet bit arrives last packet bit arrives, send ACK ACK arrives, send next packet, t = RTT + L / R
  • 40. Pipelining: increased utilization first packet bit transmitted, t = 0 sender receiver RTT last bit transmitted, t = L / R first packet bit arrives last packet bit arrives, send ACK ACK arrives, send next packet, t = RTT + L / R last bit of 2 nd packet arrives, send ACK last bit of 3 rd packet arrives, send ACK Increase utilization by a factor of 3!
  • 41.
  • 43.
  • 44.
  • 45.
  • 46.
  • 47. TCP Congestion Avoidance: Tahoe /* slowstart is over */ /* Congwin > threshold */ Until (loss event) { every w segments ACKed: Congwin++ } threshold = Congwin/2 Congwin = 1 perform slowstart TCP Tahoe Congestion avoidance
  • 48.
  • 49.
  • 52.
  • 53.
  • 54. TCP Connection Tear-down Sender Receiver FIN FIN-ACK FIN FIN-ACK Data write Data ack
  • 55. TCP Connection Tear-down: FSM CLOSING CLOSE WAIT FIN WAIT-1 ESTAB TIME WAIT snd FIN CLOSE send FIN CLOSE rcv ACK of FIN LAST-ACK CLOSED FIN WAIT-2 snd ACK rcv FIN delete TCB Timeout=2msl send FIN CLOSE send ACK rcv FIN snd ACK rcv FIN rcv ACK of FIN snd ACK rcv FIN+ACK
  • 56.
  • 58. Selective Ack - Example