1 / 74

Subject Name: Computer Networks - II Subject Code: 10CS64 Prepared By: Madhuleena Das, Santhiya M

Subject Name: Computer Networks - II Subject Code: 10CS64 Prepared By: Madhuleena Das, Santhiya M Department: Computer Science & Engineering Date : 6.5.15. TCP/IP-II. Engineered for Tomorrow. By, Madhuleena Das, Santhiya M Assistant Professor Dept of CSE MVJCE, B’Lore. Date 06-05-15.

mabels
Download Presentation

Subject Name: Computer Networks - II Subject Code: 10CS64 Prepared By: Madhuleena Das, Santhiya M

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. Subject Name: Computer Networks - II Subject Code: 10CS64 Prepared By: Madhuleena Das, Santhiya M Department: Computer Science & Engineering Date : 6.5.15

  2. TCP/IP-II Engineered for Tomorrow By, Madhuleena Das, Santhiya M Assistant Professor Dept of CSE MVJCE, B’Lore Date 06-05-15

  3. TCP Reliable byte-stream service More complex transmitter & receiver Connection-oriented: full-duplex unicast connection between client & server processes Connection setup, connection state, connection release Higher header overhead Error control, flow control, and congestion control Higher delay than UDP Most applications use TCP HTTP, SMTP, FTP, TELNET, POP3, …

  4. 0 4 10 16 24 31 Source port Destination port Sequence number Acknowledgment number U A P R S F Header R C S S Y I Reserved Window size length G K H T N N Checksum Urgent pointer Options Padding Data TCP Segment Format • Each TCP segment has header of 20 or more bytes + 0 or more bytes of data

  5. TCP Header Port Numbers A socket identifies a connection endpoint IP address + port A connection specified by a socket pair Well-known ports FTP 20 Telnet 23 DNS 53 HTTP 80 Sequence Number Byte count First byte in segment 32 bits long 0  SN  232-1 Initial sequence number selected during connection setup

  6. TCP Header Acknowledgement Number SN of next byte expected by receiver Acknowledges that all prior bytes in stream have been received correctly Valid if ACK flag is set Header length 4 bits Length of header in multiples of 32-bit words Minimum header length is 20 bytes Maximum header length is 60 bytes

  7. TCP Header Reserved 6 bits Control 6 bits URG: urgent pointer flag Urgent message end = SN + urgent pointer ACK: ACK packet flag PSH: tells the receiver TCP module to pass the data to the application immediately, otherwise buffer the segment until enough data accumulates in its buffer RST: reset connection Upon receipt of RST, connection is terminated and application layer notified SYN: establish connection FIN: close connection

  8. TCP Header Window Size 16 bits to advertise window size Used for flow control Maximum window size is 65535 bytes TCP Checksum Internet checksum method TCP pseudoheader + TCP segment

  9. TCP Checksum Calculation TCP error detection uses same procedure as UDP 0 8 16 31 Source IP address Destination IP address 0 0 0 0 0 0 0 0 Protocol = 6 TCP segment length TCP pseudo-header

  10. TCP Header Options Variable length NOP (No Operation) option is used to pad TCP header to multiple of 32 bits Options Maximum Segment Size (MSS) option specifices largest segment a receiver wants to receive Window Scale option increases TCP window from 16 to 32 bits

  11. Connection Establishment Before any host can send data, a connection must be established. TCP establishes the connection using a three-way handshake procedure Host A sends a connection request request to host B by setting the SYN bit. Host A also registers its initial sequence number to use (Seq_no = x) Host B acknowledges the request by setting the ACK bit and indicating the next byte to receive ( Ack_no =x+1). (SYN bit consumes 1 sequence number). At the same time, host B also sends a request by setting the SYN bit and registering its initial sequence number to use (Seq_no=y). Host A acknowledges the request from B by setting the ACK bit and conforming the next byte to receive (Ack_no=y+1). On receipt at B the connection is established.

  12. Host A Host B SYN, Seq_no = x SYN, Seq_no = y, ACK, Ack_no = x+1 Seq_no = x+1, ACK, Ack_no = y+1 TCP Connection Establishment • “Three-way Handshake” • ISN’s protect against segments from prior connections

  13. Host A Host B SYN, Seq_no = n, ACK, Ack_no = n+1 Seq_no = n+1, ACK, Ack_no = n+1 Delayed segment with Seq_no = n+2 will be accepted If host always uses the same ISN If a host always uses the same initial sequence number, Old segments cannot be distinguished from the current ones

  14. Client-Server Application Host B (server) Host A (client) socket bind listen accept(blocks) t1 socket connect (blocks) SYN, Seq_no = x t2 SYN, Seq_no = y, ACK, Ack_no = x+1 connect returns t3 Seq_no = x+1, ACK, Ack_no = y+1 write read (blocks) accept returns read (blocks) t4 t5 Request message read returns t6 write read (blocks) Reply message read returns

  15. Host A Host B t0 Seq_no = 1, Ack_no = 2000, Win = 2048, No Data t1 Seq_no = 2000, Ack_no = 1, Win = 1024, Data = 2000-3023 t2 Seq_no = 3024, Ack_no = 1, Win = 1024, Data = 3024-4047 t3 Seq_no = 1, Ack_no = 4048, Win = 512, Data = 1-128 t4 Seq_no = 4048, Ack_no = 129, Win = 1024, Data = 4048-4559 TCP Window Flow Control 1024 bytes to transmit 1024 bytes to transmit 128 bytes to transmit 1024 bytes to transmit 1024 bytes to transmit can only send 512 bytes

  16. Nagle Algorithm Situation:---to avoid inefficient use of bandwidth user types 1 character at a time Transmitter sends TCP segment per character (41B) Receiver sends ACK (40B) Receiver echoes received character (41B) Transmitter ACKs echo (40 B) 162 bytes transmitted to transfer 1 character! Solution: TCP sends data & waits for ACK New characters buffered Send new characters when ACK arrives Algorithm adjusts to RTT Short RTT send frequently at low efficiency Long RTT send less frequently at greater efficiency

  17. Silly Window Syndrome Situation: Transmitter sends large amount of data Receiver buffer depleted slowly, so buffer fills Every time a few bytes read from buffer, a new advertisement to transmitter is generated Sender immediately sends data & fills buffer Many small, inefficient segments are transmitted Solution: Receiver does not advertize window until window is at least ½ of receiver buffer or maximum segment size Transmitter refrains from sending small segments

  18. TCP Connection Closing Host A Host B FIN, seq = 5086 Ack = 5087 Data, seq. = 303, Ack=5087 Deliver 150 bytes Ack = 453 FIN, seq. =453, Ack = 5087 Ack = 454

  19. TIME_WAIT state When TCP receives ACK to last FIN, TCP enters TIME_WAIT state Protects future incarnations of connection from delayed segments TIME_WAIT = 2 x MSL Only valid segment that can arrive while in TIME_WAIT state is FIN retransmission If such segment arrives, resent ACK & restart TIME_WAIT timer When timer expires, close TCP connection & delete connection record

  20. CLOSED Appli-cation close passive open, create TCB active open, create TCB send SYN LISTEN receive SYN, send SYN, ACK receive RST send SYN application close or timeout, delete TCB receive SYN, send ACK SYN_SENT SYN_RCVD receive SYN, ACK, send ACK receive ACK application close, send FIN ESTABLISHED receive FIN, send ACK application close, send FIN CLOSE_WAIT receive FIN send ACK application close send FIN CLOSING FIN_WAIT_1 receive ACK LAST_ACK receive ACK receive ACK receive FIN, ACK send ACK receive FIN send ACK 2MSL timeout delete TCB FIN_WAIT_2 TIME_WAIT TCP State Transition Diagram

  21. TCP Congestion Control TCP uses a sliding window protocol for end to end flow control Advertised window size is used to ensure that receiver’s buffer will not overflow However, buffers at intermediate routers between source and destination may overflow, so congestion occurs TCP window mechanism can be used to control congestion in the network The objective of TCP congestion control is to have each sender transmit just the right amount of data to keep the network resources utilized but not overloadtive TCP protocol defines ed To achieve this objective, the TCP protocol defines another window called the congestion window which specifies the maximum number of bytes that a TCP sender is allowed to transmit with the assumption that congestion will not be triggered with the given amount of data TCP sender sends minimum of the advertised window and the congestion window

  22. TCP Congestion Control: Slow Start Slow start: increase congestion window size by one segment (1 MSS) upon receiving an ACK from receiver After sending first segment, if the segment receives an ACK before a time out, the sender increses the congestion window to two segments, later to four segments and so on. congestion window increases exponentially to fill the pipe as quickly as possible to utilize network resources maximally cwnd 8 4 2 1 RTTs Seg ACK

  23. TCP Congestion Control: Congestion Avoidance Algorithm progressively sets a congestion threshold When cwnd > congestion threshold, congestion avoidance phase takes place. It assumes that the pipe is approaching full utilization, so rate is reduced Increase congestion window size by one segment per round-trip-time (RTT) The congestion window stops increasing when TCP detects that the network is congested cwnd 8 threshold 4 2 1 RTTs

  24. TCP Congestion Control: Congestion Congestion is detected upon timeout or receipt of duplicate ACKs Assume current cwnd corresponds to available bandwidth Adjust congestion threshold = ½ x current cwnd Reset cwnd to 1 Go back to slow-start Over several cycles expect to converge to congestion threshold equal to about ½ the available bandwidth Congestion avoidance 20 Time-out 15 Threshold Congestion window 10 Slow start 5 0 Round-trip times

  25. Fast Retransmit & Fast Recovery Congestion causes many segments to be dropped If only a single segment is dropped, then subsequent segments trigger duplicate ACKs before timeout Can avoid large decrease in cwnd as follows: When three duplicate ACKs arrive, retransmit lost segment immediately Reset congestion threshold to ½ cwnd Reset cwnd to congestion threshold + 3 to account for the three segments that triggered duplicate ACKs Remain in congestion avoidance phase However if timeout expires, reset cwnd to 1 In absence of timeouts, cwnd will oscillate around optimal value SN=1 ACK=1 SN=2 SN=3 SN=4 ACK=2 SN=5 ACK=2 ACK=2

  26. TCP Congestion Control: Fast Retransmit & Fast Recovery Congestion avoidance 20 Time-out 15 Threshold Congestion window 10 Slow start 5 0 Round-trip times

  27. Autonomous Systems Global Internet viewed as collection of autonomous systems. Autonomous system (AS) is a set of routers or networks administered by a single organization Same routing protocol need not be run within the AS But, to the outside world, an AS should present a consistent picture of what ASs are reachable through it Stub AS: has only a single connection to the outside world. Also called single homes AS Multihomed AS: has multiple connections to the outside world, but refuses to carry transit traffic(traffic that originates and terminates in the outside world), carries only local traffic (traffic that originates or terminates in that AS) Transit AS: has multiple connections to the outside world, and can carry transit and local traffic.

  28. Inter and Intra Domain Routing • Interior Gateway Protocol (IGP): routing within AS • RIP, OSPF • Exterior Gateway Protocol (EGP): routing between AS’s • BGPv4 IGP R EGP IGP R R R R R AS A AS C R R IGP AS B

  29. RFC 1058 RIP based on routed, “route d”, distributed in BSD UNIX Uses the distance-vector algorithm Runs on top of UDP, port number 520 Metric: number of hops Max limited to 15 suitable for small networks (local area environments) value of 16 is reserved to represent infinity small number limits the count-to-infinity problem Routing Information Protocol (RIP)

  30. RIP Operation Router sends update message to neighbors every 30 sec A router expects to receive an update message from each of its neighbors within 180 seconds in the worst case If router does not receive update message from neighbor X within this limit, it assumes the link to X has failed and sets the corresponding minimum cost to 16 (infinity) Uses split horizon with poisoned reverse to reduce routing loops Convergence speeded up by triggered updates neighbors notified immediately of changes in distance vector table

  31. RIP Protocol Routers run RIP in active mode (advertise distance vector tables) Hosts can run RIP in passive mode (update distance vector tables, but do not advertise) RIP datagrams broadcast over LANs & specifically addressed on pt-pt or multi-access non-broadcast nets Two RIP packet types: request to ask neighbor for distance vector table response to advertise distance vector table periodically; in response to request; triggered

  32. RIP Message Format 0 8 16 31 Zero Command Version Address family identifier Zero IP address Zero Zero Metric . . . Request/Response 1/2 2 for IP RIP entry RIP message format

  33. Command: request or response—purpose of the message Version: v1 or v2 One or more of: Address Family: 2 for IP IP Address: network or host destination Metric: number of hops to destination. 1 to 15. 16 unreachable Does not have access to subnet mask information Cannot work with variable-length subnet masks RIP v2 (RFC 2453): Subnet mask, next hop, routing domain can work with CIDR still uses max cost of 16 RIP Message Format

  34. RFC 2328 (v2) Fixes some of the deficiencies in RIP Enables each router to learn complete network topology Each router monitors the link state to each neighbor and floods the link-state information to other routers Each router builds an identical link-state database Allows router to build shortest path tree with router as root OSPF typically converges faster than RIP when there is a failure in the network Open Shortest Path First

  35. Multiple routes to a given destination, one for each IP type of service Support for variable-length subnetting by including the subnet mask in the routing message More flexible link cost which can range from 1 to 65,535 Distribution of traffic over multiple paths of equal cost Authentication to ensure routers exchange information with trusted neighbors Multicast rather than broadcast of its messages to reduce the load on systems Support host-specific routes as well as net-specific routes Designated router to minimize table maintenance overhead OSPF Features

  36. To improve scalability, AS may be partitioned into areas Area is identified by 32-bit number known as Area ID Router in area only knows complete topology inside area & limits the flooding of link-state information to area Area border routers summarize info from other areas Each area must be connected to backbone area (0.0.0.0) Distributes routing info between areas Internal router has all links connected to network within the same area Area border router has links connected to more than one area backbone router has links connected to the backbone Autonomous system boundary router (ASBR) has links to another autonomous system. OSPF Network

  37. OSPF Areas To another AS N1 R1 N5 N4 N2 R3 R6 R7 R2 N6 R4 R5 N3 Area 0.0.0.2 Area 0.0.0.0 Area 0.0.0.1 R8 ASBR: 4 ABR: 3, 6, and 8 IR: 1,2,7 BBR: 3,4,5,6,8 N7 R = router N = network Area 0.0.0.3

  38. OSPF packets transmitted directly on IP datagrams; Protocol ID 89 OSPF packets sent to multicast address 224.0.0.5 (allSPFRouters on pt-2-pt and broadcast multiaccess networks) OSPF packets sent on specific IP addresses on non-broadcast network Five OSPF packet types: Hello Database description Link state request; Link state update; Link state ack OSPF Protocol

  39. OSPF Header Type: Hello, Database description, Link state request, Link state update, Link state acknowledgements 0 8 16 31 Version Type Packet length Router ID Area ID OSPF common header Checksum Authentication type Authentication Authentication OSPF packet body Data

  40. Stage 1: OSPF Hello Packet Network mask:associated with the interface the packet is sent on Hello interval: number of seconds between Hello packets Priority: used to elect designated router & backup Dead interval: # sec before declaring a non-responding neighbor down. Designated router:identifies the designated router for this network Neighbor: the Router ID of each neighbor from whom Hello packets have recently been received 0 16 24 31 Network mask Hello interval Options Priority Dead interval Designated router Backup designated router Neighbor 1 . . . Neighbor n • Send Hello packets to establish & maintain neighbor relationship

  41. Stage 2: OSPF Database Description • Once neighbor routers become adjacent, they exchange database description packets to synchronize their link-state databases.

  42. Interface MTU: specifies the maximum transmission unit of the associated interface Init bit 1 if pkt is first in sequence of database description packets More bit 1 if there are more database description packets to follow Master/Slave bit indicates that the router is the master. Database description seq no: identifies the packet number sequentially to detect missing packet Link state ad (LSA) header describes state of router or network; contains info to uniquely identify entry in LSA (type, ID, and advertising router). Can have multiple LSA headers

  43. LSA Header LS age : describes how long the LSA was originated LS type: Router LSAs generated by all OSPF routers; Network LSAs generated by designated routers; Summary LSAs by area border routers; AS-external LSAs by ASBRs LS id: identifies piece of routing domain being described by LSA LS Seq. Number: numbers LSAs to detect old/duplicate LSAs LS checksum: covers contents of LSA except link state age 0 16 24 31 Link-state age Options Link-state type Link-state ID Advertising router Link-state sequence number Link-state checksum Length

  44. Router sends a LS request packet to neighbor to update part of its link-state database Each LSA request is specified by the link state type, link state ID, and the advertising router. Stage 3: OSPF Link State Request 0 31 Link-state type Link-state ID Advertising router . . .

  45. OSPF Link State Update In response to LS request or trigger, router will send new LS info using the LS update message Contents are composed of link state advertisements (LSAs) LS update message is acknowledged using LS ack pkt to ensure that the flooding algorithm is reliable; Link state acknowledgement packets consist of a list of LSA headers. 0 31 Number of LSAs LSA 1 . . . LSA n

  46. Exterior Gateway Protocols Within each AS, there is a consistent set of routes connecting the constituent networks The Internet is woven into a coherent whole by Exterior Gateway Protocols (EGPs) that operate between AS’s EGP enables two AS’s to exchange routing information about: The networks that are contained within each AS The AS’s that can be reached through each AS EGP path selection guided by policy rather than path optimality Trust, peering arrangements, etc

  47. EGP Example R4 advertises that network N1 can be reached through AS3 R3 examines announcement & applies policy to decide whether it will forward packets to N1 through R4 If yes, routing table updated in R3 to indicate R4 as next hop to N1 IGP propagates N1 reachability information through AS2 R2 R3 AS2 R1 R4 N1 AS1 AS3 Only EGP routers are shown N1 reachable through AS3 www.Bookspar.com | Website for Students | VTU - Notes - Question Papers

  48. EGP Example EGP routers within an AS, e.g. R3 and R2, are kept consistent Suppose AS2 willing to handle transit packets from AS1 to N1 R2 advertises to AS1 the reachability of N1 through AS2 R1 applies its policy to decide whether to send to N1 via AS2 R2 R3 AS2 R1 R4 N1 AS1 AS3 N1 reachable through AS2

  49. Border Gateway Protocol v4 BGP (RFC 1771) an EGP routing protocol to exchange network reachability information among BGP routers (also called BGP speakers) Network reachability info contains sequence of ASs that packets traverse to reach a destination network Info exchanged between BGP speakers allows a router to construct a graph of AS connectivity Routing loops can be pruned Routing policy at AS level can be applied AS2 AS1 AS6 AS5 AS3 AS4 AS7

  50. BGP Features BGP is path vector protocol: advertises sequence of AS numbers to the destination network Path vector info used to prevent routing loops BGP enforces policy through selection of different paths to a destination and by control of redistribution of routing information Uses CIDR to support aggregation & reduction of routing information

More Related