1. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 1 Internet Protocol

2. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 2 What is the Internet? A collection of separate networks Interconnected by routers and gateways –routers interconnect similar networks –gateways interconnect differing networks

3. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 3 Connectionless Functions Unicasting of datagrams each datagram routed from source to destination Multicasting of datagrams single datagram routed to many destinations

4. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 4 Internet Protocol (IP) A connectionless (datagram) service Supports connectionless transport (TCP) (TCP also supports connection-oriented transport)

5. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 5 Internet Protocol Routing Allows interconnection of subnetworks within a Local Area Network Allows interconnection of Local Area Networks

6. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 6 Subnet Interconnection

7. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 7 Router Interconnects subnets Many ports, each on separate subnet Operates at Network Layer Restricts traffic - only subnet traffic visible Can interconnect Local Area Networks (LANs)

8. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 8 Hub Interconnects hosts on subnet Many ports, all on same subnet Operates at Data Link Layer Does not restrict traffic (all traffic visible)

9. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 9 LAN Interconnection

10. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 10 Larger Networks Wide Area Networks (WANs) May operate with different protocols Gateway couples these Internet is an example

11. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 11 WAN Interconnection

12. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 12 Effect on Application Data TCP adds header at transport layer IP adds header at network layer

13. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 13 TCP/IP Header Embedding

14. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 14 Addressing of Network Nodes Physical address (Ethernet address) –Medium Access Control (MAC) format 6 octets (uniquely assigned to hardware) Network address –Internet Protocol (IP) format 4 octets (assigned by agency) Translation –Address Resolution Protocol (ARP) –Reverse Address Resolution Protocol (RARP)

15. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 15 Physical (Hardware) Address MAC (Medium Access Control) address 6 octets (48 bits) Note: 2 48 = 2.8147x10 14 –3 octets of vendor code (Assigned by IEEE) 1 octet of flag bits 2 octets of vendor number –3 octets of serial number (Assigned by vendor)

16. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 16 MAC Address Format

17. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 17 Network (IP) Address 4 octets (32 bits) Note: 2 32 = 4.2950x10 9 Left octet(s) are Network address leftmost bits signify address class next bits are network address Right octets are Host address Host addresses may be subnetted left bits are Subnet rightmost bits are Host

18. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 18 Network Address Classes

19. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 19 Example Widener University - Class B address 147.31.xxx.yyy

20. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 20 Addressing limits Class A (Super WAN - e.g. country) –2 7 networks, 2 24 hosts (3 octets) Class B (WAN/LAN) –2 14 networks, 2 16 hosts (2 octets) Class C (LAN) –2 21 networks, 2 8 hosts (1 octet) (Note: all address octets can be 0 to 255 )

21. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 21 Subnets Needed to make efficient use of addresses Reduce routing effort by assigning a single address to all the subnets Resolve local traffic locally; keep Intra-net traffic off the Inter-net Organize hosts into groups (LANs)

22. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 22 Example Class B Subnet Note that the Subnet divides the Host address space Subnet mask will contain 1s in Subnet space; 0s in Host space A 9-bit host space is assumed (510 hosts) A 7-bit subnet space remains (126 subnets) Note: Addresses 0 and 255 are reserved

23. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 23 Subnet Masks Router will AND mask with IP address and pass result through to local network –Example: 254 hosts (H) in subnet (S) IP address is:N.N.S.H subnet mask is:255.255.255.0 –Example: 510 hosts (H) in subnet (S) IP address is:N.N.S-H.H subnet mask is:255.255.254.0

24. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 24 Subnet Calculators Simplify binary subnet calculations Are available free on the Internet Search on “subnet calculator” Example: –http://www.subnet-calculator.com/http://www.subnet-calculator.com/

25. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 25 Host Mask Design Procedure Specify expected number of hosts (N) –all computers –printers –network devices (hubs, routers, etc.) –add 2 (for reserved 0 and 255 addresses) Set k to next power of 2 giving at least N addresses Mask is 1s complement of 2 k -1

26. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 26 Address Translation IP to Hardware Address Resolution Protocol (ARP) Hardware to IP Reverse Address Resolution Protocol (RARP)

27. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 27 ARP/RARP Overview

28. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 28 ARP Request Packet

29. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 29 Address Translation Procedure Source computer to send Outgoing packet is put in queue Special ARP request packet is broadcast on network Target computer responds Target computer returns packet with missing address Note: its “target” is original “source” computer Source computer sends queued packet

30. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 30 147.31.232.120 To Send This packet will be broadcast to every host on 147.31.232.0 network (subnet) Only 147.31.232.100 responds (unicast response)

31. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 31 147.31.232.100 Answers 147.31.232.120 now has the hardware address it needs to build packets to 147.31.232.100.

32. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 32 Name Translation Name to IP-Address (engr.widener.edu => 147.31.230.10) Domain Name Server (DNS) –a hierarchy of database servers on the network –local resolution attempted first; then network –secondary (backup), usually available

33. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 33 IP Header

34. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 34 IP Header Fields Version (4 bits) –version number Header Length (4 bits) –in 32-bit words (5 is minimum) Type of Service (8 bits) –Precedence (bits 0-2)– Throughput (bit 4) –Delay (bit 3)– Reliability (bit 5) –bits 6 & 7 reserved for future use

35. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 35 IP Header Fields (Cont’d) Total length –length of datagram, including header [bytes] –design minimum: 576 bytes Identification –sequence number for fragments Flags (3 bits) –bit 0 = 0 (reserved) bit 2 = more fragments –bit 1 = don’t fragment

36. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 36 IP Header Fields (Cont’d) Fragment offset (13 bits) –location of fragment in datagram (8-byte units) Time to live [seconds] –each router must count down by one Protocol type –for higher level processing of datagram –(TCP = 6, UDP = 17)

37. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 37 IP Header Fields (Cont’d) Source address (32 bits) –IP address Destination address (32 bits) –IP address Options –all devices must implement –typical: security, upper level protocols, etc.

38. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 38 ICMP Internet Control Message Protocol Conveys return error messages to source from an IP network No retransmission if lost

39. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 39 ICMP Header Format

40. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 40 Some ICMP Types & Codes

41. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 41 Some ICMP Interpretations Destination unreachable (router can’t find route) Source quench (reduce source rate) Time exceeded (TTL decremented to zero by router)

42. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 42 Routing Methods Distance Vector Protocol (uses RIP - Routing Information Protocol) Bellman-Ford routing algorithm Link State Protocol (uses OSPF - Open Shortest Path First) SPF routing algorithm (Dijkstra) All routers know complete network

43. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 43 RIP - Routing Information Protocol A distance vector protocol Uses hop count as metric (1 - 16) Peer routers exchange distance vectors every 30 seconds Router considered off-line if timeout exceeded (180 seconds) Problematic above subnet level

44. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 44 RIP2 (RIP) Header Note: White area repeats for each router addressed.

45. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 45 RIP Commands Request:For all or part of routing table of target router (destination address - via next-hop) Response:All or part of routing table from target router - or update COMMANDDESCRIPTION 1Request 2Response

46. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 46 RIP Version Number

47. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 47 OSPF - Open Shortest Path First An internal link state routing protocol Hierarchical routing by “areas” Link State Protocol (LSP) packets advertise routes Routers can advertise 1-hop hosts as sets One router of broadcast LAN is the“designated” router; failover to “backup”

48. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 48 More OSPF Features Allows multiple route definitions –by service types –by costs –by load (allows load balancing) Secures router databases –all data exchanges authenticated –only authenticated data can be propagated

49. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 49 Weighted Digraph Representation Vertices –routers –networks Edges –paths to routers to networks –corresponding costs

50. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 50 OSPF Packet Format

51. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 51 OSPF Fields Version Number at present, always 1 Packet Type 1 = Hello 2 = Database Description 3 = Link State Request 4 = Link State Update 5 = Link State Acknowledgment

52. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 52 OSPF Fields (cont’d) Packet length, including header [bytes] Source router address (ID) Area ID –Note: packets usually cover only 1 hop Checksum (1s complement) Authentication type Authentication field (64-bit)

53. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 53 Link State Tables Destination ID Next Hop ID Distance Metric –delay –data rate –unit cost ($) –combination

54. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 54 Network Routing Diagram

55. 10/13/2015© 2008 Raymond P. Jefferis IIILect 07 55 SPF Routing Table for R2