1 / 46

Subnetting and Supernetting for Address Design

Learn about subnetting and supernetting techniques for designing network addresses, including variable-length subnetting, classless addressing, and address aggregation.

spalomino
Download Presentation

Subnetting and Supernetting for Address Design

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. Chapter 5 Addressing Project 2 Posted Will Review Exam 2 Lecture

  2. Example 4 A company is granted the site address 181.56.0.0 (class B). The company needs 1000 subnets. Design the subnets. Solution The number of 1s in the default mask is 16 (class B). The company needs 1000 subnets. This number is not a power of 2. The next number that is a power of 2 is 1024 (210). We need 10 more 1s in the subnet mask. The total number of 1s in the subnet mask is 26 (16 + 10). The total number of 0s is 6 (32 - 26). The mask is 11111111 11111111 1111111111000000 or 255.255.255.192. The number of subnets is 1024. The number of addresses in each subnet is 26 (6 is the number of 0s) or 64. Lecture

  3. Example 4 Subtract 63 from 255 to get 192 Lecture

  4. SUPERNETTING • Although class A and B addresses are dwindling – there are plenty of class C addresses • The problem with C addresses is, they only have 256 hostids – not enough for any midsize to large size organization – especially if you plan to give every computer, printer, scanner, etc. multiple IP addresses • Supernetting allows an organization the ability to combine several class C blocks in creating a larger range of addresses • Note: breaking up a network = subnetting • Note: combining Class-C networks = supernetting Lecture

  5. Assigning or Choosing Class C Blocks • When assigning class C blocks, there are two approaches: (1) random and (2) superblock • Random Approach: the routers will see each block as a separate network and therefore, for each block there would be an entry in the routing table – a router contains an entry for each destination network • Superblock Approach: instead of multiple routing table entries, there would be a single entry. However, the choices of blocks need to follow a set of rules: • #1 – the # of blocks must be a power of 2 (ie. 1, 2, 4, 8 …) • #2 – blocks must be contiguous (no gaps between blocks) • #3 – the 3rd byte of the first address in the superblock must be evenly divisible by the number of blocks – ie. if the # of blocks is N, the 3rd byte must be divisible by N • Number of 1s removed from Default mask is dictated by the number of C blocks combined (ie 1 for 2, 2 for 4, 3 for 8, etc) Lecture

  6. Example 5 A company needs 600 addresses. Which of the following set of class C blocks can be used to form a supernet for this company? 198.47.32.0 198.47.33.0 198.47.34.0 198.47.32.0 198.47.42.0 198.47.52.0 198.47.62.0 198.47.31.0 198.47.32.0 198.47.33.0 198.47.34.0 198.47.32.0 198.47.33.0 198.47.34.0 198.47.35.0 Solution 1: No, there are only three blocks. Must be a power of 2 2: No, the blocks are not contiguous. 3: No, 31 in the first block is not divisible by 4. 4: Yes, all three requirements are fulfilled. (1. Power of 2, 2. Contiguous and 3. 3rd byte of 1st address is divisible by 4: 32/4=8) Lecture

  7. Example 8 A supernet has a first address of 205.16.32.0 and a supernet mask of 255.255.248.0. How many blocks are in this supernet and what is the range of addresses? Solution • The default mask has 24 1s because 205.16.32.0 is a class C. • Because the supernet mask is 255.255.248.0, the supernet has 21 1s. • Since the difference between the default and supernet masks is 3, there are 23 or 8 blocks in this supernet. • Because the blocks start with 205.16.32.0 and must be contiguous, the blocks are 205.16.32.0, 205.16.33.0, 205.16.34.0………. 205.16.39.0. • The first address is 205.16.32.0. The last address is 205.16.39.255. • The total number of addresses is 8 x 256 = 2048 Lecture

  8. Explain Supernetting Conceptually Back out this bit from netid into host id Causes these 2 blocks to combine as a single block Lecture

  9. Variable-length subnetting • Suppose you were granted a Class C address – this mean you would have 8 bits to play with • Also, suppose you needed 5 subnets consisting of the following # of hosts: 60, 60, 60, 30 and 30 • If you used a 2 bit subnet mask – can get 4 subnets with 64 stations each (too big) • If you used a 3 bit subnet mask – can get 8 subnets with 32 stations each (too small) • What’s the solution ? Lecture

  10. Variable-length Subnetting • Solution: used 2 subnet masks – one applied after the other • Could use a 2 bit subnet mask and get 4 subnets with 64 stations each - this would satisfy the three 60-host subnet requirement – therefore the subnet mask would be 255.255.255.11000000 (192) • We could then further divide one of the 64-host subnets into two 32-host subnets by applying this mask 255.255.255.11100000 (224) after this mask of 255.255.255.11000000 (192) is used Lecture

  11. Ch 5 Classless Addressing Lecture

  12. Guess What ? Classful Addressing is Obsolete However, understanding the classful approach will help you easily understand the classless approach Quickly explain classless vs classful (leave address aggregation for the routing topics) Lecture

  13. CLASSLESS ADDRESSING • Recall the problems with Classful addressing – you have to get a predefined block of addresses – in most cases, the block is either too large or too small • In the 1990’s, ISP came into prominence – they provide Internet access for individuals to midsize organizations that don’t want sponsor their own Internet service (ie. email, etc). • The ISP’s are granted several B and C blocks of addresses and they subdivide their address space into groups of 2, 4, 8, 16, etc.. – blocks can be variable length • Because of the up rise of ISP’s, in 1996, the Internet Authorities announced a new architecture called Classless Addressing (making classful addressing obsolete) Lecture

  14. Number of Addresses in a Classless Block There are two conditions Condition 1: the number of addresses in a block; it must be a power of 2 (2, 4, 8, . . .). A household may be given a block of 2 addresses. A small business may be given 16 addresses. A large organization may be given 1024 addresses. Another Condition: • The beginning address must be evenly divisible by the number of addresses. • For example, if a block contains 4 addresses, the beginning address must be divisible by 4. If the block has less than 256 addresses, we need to check only the rightmost byte. If it has less than 65,536 addresses, we need to check only the two rightmost bytes, and so on. Lecture

  15. Classless Subnet Illustration Netid subnetid Lecture

  16. Example 9 Which of the following can be the beginning address of a block that contains 16 addresses? 123.45.24.52 205.16.37.32190.16.42.4417.17.33.80 Solution The address 205.16.37.32 is eligible because 32 is divisible by 16. The address 17.17.33.80 is eligible because 80 is divisible by 16. Lecture

  17. Example 10 Which of the following can be the beginning address of a block that contains 1024 addresses? 205.16.37.32190.16.42.017.17.32.0 123.45.24.52 Solution • To be divisible by 1024, the rightmost byte of an address should be 0 because any value in that first byte will be a fraction of 1024 (ie. 0 to 255). • To be divisible by 1024, the rightmost byte should be 0 and the second rightmost byte must be divisible by 4 because for every unique number in the second byte position, there exist 256 addresses in the first byte position that maps to it. To get 1024 addresses overall, you will need an increment of 4 in the 2nd byte position. • Therefore, the 2nd byte needs to be divisible by 4. • Only the address 17.17.32.0 meets this condition. Lecture

  18. Mask • Recall the Classful approach, only given an IP – the user defined their mask • For the Classless approach, when an org is given a block, it’s given both the starting address and the mask – these two pieces of info defines the entire block • For classless case, instead of writing out the full mask, we just specify the number of 1’s in the mask and append it to the address – this is called slash notation or CIDR (classless interdomain routing) notation • For classless addressing, the prefix refers to the common part of the address (ie. network portion) • For classless addressing, the suffix refers to the varying part of the address (ie. host portion) Lecture

  19. A block in classes A, B, and C can easily be represented in slash notation as A.B.C.D/ nwhere n is either 8 (class A), 16 (class B), or 24 (class C). Lecture

  20. Example 11 A small organization is given a block with the beginning address and the prefix length 205.16.37.24/29 (in slash notation). What is the range of the block? Solution The beginning address is 205.16.37.24. To find the last address we keep the first 29 bits and change the last 3 bits to 1s. Beginning:11001111 00010000 00100101 00011000 Ending : 11001111 00010000 00100101 00011111 There are only 8 addresses in this block. Lecture

  21. Example 13 What is the network address if one of the addresses is 167.199.170.82/27? Solution The prefix length is 27, which means that we must keep the first 27 bits as is and change the remaining bits (5) to 0s. The 5 bits affect only the last byte. The last byte is 01010010. Changing the last 5 bits to 0s, we get 01000000 or 64. The network address is 167.199.170.64/27. Lecture

  22. Example 14 An organization is granted the block 130.34.12.64/26. The organization needs to have four subnets. What are the subnet addresses and the range of addresses for each subnet? Solution The suffix length is 6. This means the total number of addresses in the block is 64 (26). If we create four subnets, each subnet will have 16 addresses. Lecture

  23. Chapter 7: The Infamous IP Lecture

  24. Position of IP in TCP/IP protocol suite • Packets in the IP layer are called datagrams • IP is an unreliable and connectionless datagram protocol • To make IP reliable, TCP protocol is added Lecture

  25. IP datagram • IP datagram is variable length consisting of two parts (header, data) • Header is 20-60 bytes & contains routing and deliver info • Ver – version of IP • HLEN – header length – total length of the header field (in 4-byte words or units) • Service type – now called Differentiated Services – tells the service type (ie. ftp, dns, telnet, etc..) – will come back to this • Total length – defines the total length of the datagram including the header – need this to determine if padding is needed – recall Ethernet frame can range 46-1500 bytes – so if the IP datagram is less than 46 bytes (need padding) • Identification – used for fragmentation – networks that are not able to encapsulate the full IP datagram will need to fragment – will come back to this • Flags – used for fragmentation – will come back to this • Fragmentation offset – used for fragmentation – will come back to • Time to live – datagram life time as it travels – used to control the number of hops (routers) a datagram can traverse – fix infinite loop problems • Protocol – defines the higher level protocol (ie. TCP, UDP, ICMP, ICMP, etc..) that’s using the service of the IP layer – since the IP Muxes data from the Transport layer – this field is used to demux Lecture

  26. IP datagram Header cont… • Header Checksum – error checking (will cover later) • Source Address – IP address of the source (remain unchanged as data traverses) • Destination Address - IP address of the destination (remain unchanged as data traverses) • Option – are not required for every datagram – used for network testing and debugging – will cover in more detail later Lecture

  27. FRAGMENTATION Recall we stated that networks that are not able to encapsulate the full IP datagram will need to fragment As the datagrams travel through the network hitting various Routers – • the router “decapsulates” the IP datagram from the frame • The router then processes it • Then the router encapsulates it in another frame • This is how routers are able to communicate with various networks Router 1 Router 2 Network 1 Network 2 Network 3 Lecture

  28. MTU Each Data Link Protocol has it own frame format – one field defines the max size of the data field – when datagram is encapsulated, the total size of the datagram must not exceed that max size (why ??? - HW/SW limitations of the physical network) That value is called a MTU (maximum transfer unit) • The largest possible MTU is 65,535 and if this is used – it makes the IP protocol independent of the underlying physical network • If any other MTU is used, there will be cases possibly where the datagram needs to be fragmented in order to pass through that network • As it passes through the network, a previous fragment can be fragmented again if that physical network has a smaller MTU Lecture

  29. Flag field • Fields related to the fragmentation are the ID field, flags field and fragmentation offset field • Id – combo of the Id and source Ip address (IP protocol used a counter to label datagram) • Flags: 1st reserved, if D set, can’t fragment (must drop if can’t pass), if D=0, can fragment. If M is set, means more fragments exist • Fragment offset – shows relative position of the fragment with respect to the whole datagram Lecture

  30. Fragmentation example • Take a datagram of original size 4000 bytes (byte 0 to 3999) and fragment it into 3 fragments • The fragment offset is measured in units of 8 bytes. So the first offset would be 0/8=0 since the starting byte position is 0 • The second starting byte position is 1400 and therefore the offset is 1400/8= 175 • The third starting byte position is 2800 and therefore the offset equals 2800/8=350 This is done to ensure the offset can fit in the 13-bit field Routers/Hosts that fragment must pick a size of each fragment so that the 1st byte is divisible by 8 (ie. 0, 8, 16, 24 ……696 …… 1400 …….. 2096 ……… 2800 … etc) Lecture

  31. Detailed example Total Length Id isn’t changing Allow “more” fragmentation XDM D=1, can’t frag D=0, can frag M=1, more frag exist M=0, no more frag exist offset Lecture

  32. Re-assembly • Even if the fragments arrived to the destination out-of-order, the destination host could reassemble by: • The 1st fragment always has an offset of zero • If the 1st fragment’s length is divided by 8, it equals to the 2nd fragment’s offset • If the 1st and 2nd fragments’ total length are divided by 8, it equals to the 3rd fragment’s offset • Continue … • The last fragment’s “more” bit should be set to 0 – meaning no more fragments remaining Lecture

  33. Recall - IP datagram • IP datagram is variable length consisting of two parts (header, data) • Header is 20-60 bytes & contains routing and deliver info • Haven’t covered options yet • Option – are not required for every datagram – used for network testing and debugging – will cover in more detail later Lecture

  34. Option format Composed of a 1-byte code field, a 1-byte length field and a variable-sized data field Length field defines the total length of the option (including the code field) Data field contains the data of the specific option – some option types don’t require data Code field is 8-bits long and contains 3 subfields: copy, class and number Copy: controls presence of option. If 0, means copy options to the first fragment only; if 1, means copy option to all fragments Class: defines general purpose of options. If 00, options is used for datagram control; if 10, options used for management and debugging. Number: defines the type of option. As of now, only 6 types defined Lecture

  35. Regarding the Number field • Number: defines the type of option. As of now, only 6 types defined • 2 of the option types are 1-byte in size (doesn’t need length and data fields) • 4 of the options are multiple-byte and require the length and data fields • Used as a filler between options (using a 16-bit or 32-bit boundary) – know the starting point of the next option • Used at the end of the last option for padding • Record the Internet routers that can handle the datagram ( can list up to 9 router IP addresses) • Used by the source to predetermine a route for a datagram as it traverses • Used by the source to predetermine a route too (but more relaxed than the Strict Source Route Option) • Record the time the datagram is processed by a router Lecture

  36. Regarding the Record route option • The Tx creates a placeholder for the visited routers to fill in their IP addresses • The pointer field is used to point to the first empty entry so the router knows where to enter it’s outgoing IP address (address the datagram is leaving) Lecture

  37. Record route concept Can have only 3 IP addresses because of 12+3=15 Outgoing IP address Pointer field value of 4 when starting out Increment pointer Lecture

  38. Regarding the Strict source route option • Option used by the source to predetermine a route for the datagram as it traverses the Internet • In this case, the routers are specified up front in dictating the specific route. All routers MUST be visited – if other routers are visited, the datagram is dropped) – if all of the listed routers are not visited, the datagram is dropped • Routers are entered by the sender Why: security, distinguish among different networks, don’t want certain traffic to leave your network, etc. Lecture

  39. Loose source route option • Similar to the Strict Source Route Option but more relaxed • In this case, the routers are specified up front and all MUST be visited ( however, other routers can be visited too) Lecture

  40. Timestamp option • Used to record the time of datagram processing by a router (expressed in milliseconds from midnight) • Use this to track the routers’ behavior – time from one router to the next • O-flow: # of routers that could not add their timestamp • Flags: dictates what the router should do (ie. add timestamp, add timestamp & IP address, etc..) Lecture

  41. CHECKSUM • The error detection method used by most TCP/IP protocols is called checksum • The checksum protects against bit corruption that could possibly occur during transmission • Checksum calculated at the Tx and is appended with the sent data • The Rx repeats the calculation in determining if the data is correct or not Give them an analogy in base-10 Lecture

  42. To create the checksum the sender does the following: • 1. The packet is divided into k sections, each of n bits (usually 16) • 2. All sections are added together using one’s complement arithmetic. • 3. The final result is complemented to make the checksum. • Checksum process at the receiver is as follows: • The received packet is divided into k sections • All sections are added together • 3. The final result is complemented and should equal zero if correct • NOTE: value + (-value) = 0 Lecture

  43. When to apply the checksum • For IP datagram, Checksum is used on the header only (and not the data) • The header needs to be check because it’s changing router-to-router (the data itself is static) • Recall that the higher-level protocols encapsulate data into the datagram and uses their own checksum Lecture

  44. Recall Binary Addition • 1010 (neg 5) • +0010 (pos 2) • 1100 (neg 3) • 1101 (neg 2) • +0111 (pos 7) • 10100 (overflow – add the 1 back) • 0101 (pos 5) • Recall complement • 0011 Lecture

  45. Each Router has an IP address which associates with the packet-switch side of the network (Internet) The ATM side of the router uses its own 20-byte physical ATM address And in guiding the cells across the ATM network, Virtual Circuit Identifiers are used ROUTING IP OVER ATM The IP packet is encapsulated in cells (not just one). An ATM network has its own definition for the physical address of a device. Binding between an IP address and a physical address is attained through a protocol called ATMARP. In a LAN case, broadcasting is used by ARP – in a ATM case, broadcasting can’t be used – another approach is needed - ATMARP Lecture

  46. Exam 2 Results & Grading Scale Average Score = 61 Standard Deviation = 10 (average) • 88-78 A-grade (0 students) • 77-67 B-grade (3 students) • 66-56 C-grade (6 students) • 55-45 D-grade (1 student) • 44-34 F-grade (0 students) Lecture

More Related