This document provides an overview of IPv4 addressing and classful addressing. It discusses IP address classes and how to identify the class of an address. It also covers network addresses, subnetting, and supernetting. The key points are:
- IPv4 addresses are 32-bit addresses divided into classes A, B, C, D and E based on the high-order bits.
- Classful addressing assigns address blocks to networks but wastes many addresses.
- Subnetting and supernetting were introduced to allow better allocation of addresses within classful blocks through the use of subnet and supernet masks.
An IP address is a unique 32-bit number that identifies each device on a network. It allows devices to communicate by sending and receiving data packets. IP addresses are made up of a network portion and host portion, with four sections that each range from 0-255. There are five classes of IP addresses - A, B, C, D and E - that determine the number of networks and hosts. IPv4 uses 32-bit addresses written in dotted decimal notation, while IPv6 uses 128-bit addresses written in hex. IP addresses can be static or dynamically assigned by a DHCP server.
IP addressing and subnetting allows networks to be logically organized and divided. The key objectives covered include explaining IP address classes, configuring addresses, subnetting networks, and advanced concepts like CIDR, summarization, and VLSM. Transitioning to IPv6 is also discussed as a way to address the depletion of IPv4 addresses and improve security.
Complete understanding of subnet masking
also available on the youtube channal in three parts 1,2,3
link:-
https://www.youtube.com/channel/UC36lyOTi8w1EhQ-yZssjX1g?view_as=subscriber.
IPv6 addresses are 128-bit addresses used to identify nodes in an IPv6 network. They are conventionally written in hexadecimal colon notation, divided into eight sections of four hexadecimal digits each. IPv6 addresses have a hierarchical structure, with the type prefix in the first bits indicating the address category such as unicast, multicast, anycast, reserved, or local. Unicast addresses are used to identify a single interface, multicast for groups of interfaces, and anycast to select the nearest available node in a group.
The document describes external sorting techniques used when data is too large to fit in main memory. It discusses two-way sorting which uses two tape drive pairs to alternately write sorted runs. It also covers multi-way merging which merges multiple runs simultaneously using a heap. The techniques can improve performance over standard internal sorting.
The document discusses subnet masks and how they are used to separate the network and host portions of an IP address. A subnet mask contains a binary pattern of ones and zeros that is applied using Boolean algebra to determine if an IP address is on the local network or needs to be routed externally. Default subnet masks exist for each address class, and their function is to filter out bits and identify the network address portion of a destination IP.
This is Powerpoint Presentation on IP addressing & Subnet masking. This presentation describes how IP address works, what its classes and how the subnet masking works and more.
B-Trees are tree data structures used to store data on disk storage. They allow for efficient retrieval of data compared to binary trees when using disk storage due to reduced height. B-Trees group data into nodes that can have multiple children, reducing the height needed compared to binary trees. Keys are inserted by adding to leaf nodes or splitting nodes and promoting middle keys. Deletion involves removing from leaf nodes, borrowing/promoting keys, or joining nodes.
This document discusses different types of cyber attacks including passive attacks like eavesdropping and masquerading, active attacks like denial of service, and methods attackers use like spoofing, backdoors, brute force attacks, and dictionary attacks. It provides details on how each attack compromises security through unauthorized access, modification of data, denial of service, or repudiation.
This document provides an overview of IPv6, including:
- The need for IPv6 due to the depletion of IPv4 addresses and limitations of IPv4's classful addressing.
- Techniques used to extend IPv4 like subnetting, CIDR, and NAT.
- Key features of IPv6 like its larger 128-bit address space, stateless autoconfiguration, and security improvements.
- Differences between IPv4 and IPv6 headers and IPv6's use of extension headers.
- The presentation concludes that IPv6 builds upon IPv4's foundations but addresses its limitations.
IP addresses are numeric identifiers assigned to devices connected to a network. IPv4 uses 32-bit addresses represented in dotted decimal notation, while IPv6 uses 128-bit addresses represented by 8 groups of hexadecimal digits separated by colons. IP addresses have two parts - a network portion allocated by ISPs and a host portion assigned to individual devices. IPv4 classes (A, B, C, D, E) determine how many bits are used for the network vs host portions. IPv6 supports a much larger address space and easier auto-configuration compared to IPv4.
- The document discusses Internet Protocol (IP) which is the principal communications protocol for relaying datagrams across network boundaries. There are two major versions - IPv4 which is the dominant protocol, and IPv6 which is its successor.
- IPv4 uses 32-bit addresses divided into five classes (A, B, C, D, E). It allows for over 4 billion addresses but deficiencies in the classful addressing system led to address depletion.
- Classless addressing was introduced to overcome depletion by granting variable length address blocks defined by an IP address and network mask. This provides a hierarchical addressing structure and greater flexibility.
This presentation gives a brief description about IP Address (Internet protocol address), Classes of IPv4. And also included, what is IPv4 and what is IPv6.
This document provides an overview of communication network layered architectures, including the OSI reference model and TCP/IP model. It discusses the need for layering, socket programming interfaces, example applications like FTP, and network utilities like ping, netstat, and traceroute. The document is from a lecture on communication networks that covers these topics at a high level.
This document discusses subnetting and IP addressing. It introduces subnet masks and how they are used to divide networks into subnets. Specific examples are provided on subnetting Class A, B, and C networks using subnet masks like /28, 255.255.255.192, and 255.255.240.0. The document also discusses calculating the number of subnets and valid hosts for different subnet masks. Multiple practice questions are provided at the end to help understand subnetting.
Syntax-Directed Translation into Three Address Codesanchi29
油
The document discusses syntax-directed translation of code into three-address code. It defines semantic rules for generating three-address code for expressions, boolean expressions, and control flow statements. Temporary variables are generated for subexpressions and intermediate values. The semantic rules specify generating three-address code statements using temporary variables. Backpatching is also discussed as a technique to replace symbolic names in goto statements with actual addresses after code generation.
This study guide is intended to provide those pursuing the CCNA certification with a framework of what concepts need to be studied. This is not a comprehensive document containing all the secrets of the CCNP nor is it a braindump of questions and answers.
I sincerely hope that this document provides some assistance and clarity in your studies.
unit 4.pptx of hash function in cryptographyNithyasriA2
油
This document discusses cryptographic hash functions and their applications. It provides 3 key points:
1. Cryptographic hash functions are algorithms that take a variable-length input and produce a fixed-length output (hash value) that uniquely identifies the input. They have properties of one-wayness and collision resistance.
2. Hash functions have important applications in message authentication, digital signatures, and password protection by providing a means to verify message integrity and authenticity.
3. The security of cryptographic hash functions depends on their resistance to brute-force attacks and cryptanalysis. Attacks aim to find collisions or preimages more efficiently than brute force search. Iterated hash functions are most commonly used due to their security
This document discusses different types of routing protocols. It describes static routing protocols where routes are manually configured by an administrator. It then covers dynamic routing protocols which automatically update routing tables. The main dynamic routing protocols covered are RIP, RIPv2, IGRP, and EIGRP. RIP is a distance vector protocol that exchanges full routing tables every 30 seconds. RIPv2, IGRP, and EIGRP are also discussed with their key characteristics.
The document discusses hashing techniques for data structures. It describes how hashing is used to store and retrieve records from a hash table using a key and hash function. When two keys hash to the same location (collision), different collision resolution strategies can be used like open addressing, separate chaining, and bucket hashing. Open addressing methods like linear probing and quadratic probing search for the next empty location to store collided records. Separate chaining stores collided records in linked lists at hash table locations.
The IP addresses used to identify systems on a TCP/IP network. The IP address is an absolute identifier of both the individual machine and the network on which it resides.
Every IP datagram packet transmitted over a TCP/IP network contains the IP addresses of the source system that generated it and the destination system for which its intended in its IP header.
This document discusses block ciphers, including their definition, structure, design principles, and avalanche effect. A block cipher operates on fixed-length blocks of bits and uses a symmetric key. It encrypts bits in blocks rather than one by one. Block ciphers have advantages like high diffusion but are slower than stream ciphers. They are built using the Feistel cipher structure with a number of rounds and keys. Important design principles for block ciphers include the number of rounds, design of the round function, and key schedule algorithm. The avalanche effect causes a small input change to result in a significant output change.
hey! everybody this is my third and last pps of this month and i ensure that this will definately guide you about ip address and its contain and what r all different kinds of ip r available with questions tags specified also. all thoes who u cannot find on any search engine u can get all stuff here!!!!!!
hope u loved it ???!@@@#
This document discusses IP addressing and classful addressing. It covers the different address classes (A, B, C, D, E), how they divide up the IP address space, network addresses, subnet masks, and provides examples of converting between binary, decimal and hexadecimal notation. It also discusses concepts like broadcast addresses and private addressing blocks.
This is Powerpoint Presentation on IP addressing & Subnet masking. This presentation describes how IP address works, what its classes and how the subnet masking works and more.
B-Trees are tree data structures used to store data on disk storage. They allow for efficient retrieval of data compared to binary trees when using disk storage due to reduced height. B-Trees group data into nodes that can have multiple children, reducing the height needed compared to binary trees. Keys are inserted by adding to leaf nodes or splitting nodes and promoting middle keys. Deletion involves removing from leaf nodes, borrowing/promoting keys, or joining nodes.
This document discusses different types of cyber attacks including passive attacks like eavesdropping and masquerading, active attacks like denial of service, and methods attackers use like spoofing, backdoors, brute force attacks, and dictionary attacks. It provides details on how each attack compromises security through unauthorized access, modification of data, denial of service, or repudiation.
This document provides an overview of IPv6, including:
- The need for IPv6 due to the depletion of IPv4 addresses and limitations of IPv4's classful addressing.
- Techniques used to extend IPv4 like subnetting, CIDR, and NAT.
- Key features of IPv6 like its larger 128-bit address space, stateless autoconfiguration, and security improvements.
- Differences between IPv4 and IPv6 headers and IPv6's use of extension headers.
- The presentation concludes that IPv6 builds upon IPv4's foundations but addresses its limitations.
IP addresses are numeric identifiers assigned to devices connected to a network. IPv4 uses 32-bit addresses represented in dotted decimal notation, while IPv6 uses 128-bit addresses represented by 8 groups of hexadecimal digits separated by colons. IP addresses have two parts - a network portion allocated by ISPs and a host portion assigned to individual devices. IPv4 classes (A, B, C, D, E) determine how many bits are used for the network vs host portions. IPv6 supports a much larger address space and easier auto-configuration compared to IPv4.
- The document discusses Internet Protocol (IP) which is the principal communications protocol for relaying datagrams across network boundaries. There are two major versions - IPv4 which is the dominant protocol, and IPv6 which is its successor.
- IPv4 uses 32-bit addresses divided into five classes (A, B, C, D, E). It allows for over 4 billion addresses but deficiencies in the classful addressing system led to address depletion.
- Classless addressing was introduced to overcome depletion by granting variable length address blocks defined by an IP address and network mask. This provides a hierarchical addressing structure and greater flexibility.
This presentation gives a brief description about IP Address (Internet protocol address), Classes of IPv4. And also included, what is IPv4 and what is IPv6.
This document provides an overview of communication network layered architectures, including the OSI reference model and TCP/IP model. It discusses the need for layering, socket programming interfaces, example applications like FTP, and network utilities like ping, netstat, and traceroute. The document is from a lecture on communication networks that covers these topics at a high level.
This document discusses subnetting and IP addressing. It introduces subnet masks and how they are used to divide networks into subnets. Specific examples are provided on subnetting Class A, B, and C networks using subnet masks like /28, 255.255.255.192, and 255.255.240.0. The document also discusses calculating the number of subnets and valid hosts for different subnet masks. Multiple practice questions are provided at the end to help understand subnetting.
Syntax-Directed Translation into Three Address Codesanchi29
油
The document discusses syntax-directed translation of code into three-address code. It defines semantic rules for generating three-address code for expressions, boolean expressions, and control flow statements. Temporary variables are generated for subexpressions and intermediate values. The semantic rules specify generating three-address code statements using temporary variables. Backpatching is also discussed as a technique to replace symbolic names in goto statements with actual addresses after code generation.
This study guide is intended to provide those pursuing the CCNA certification with a framework of what concepts need to be studied. This is not a comprehensive document containing all the secrets of the CCNP nor is it a braindump of questions and answers.
I sincerely hope that this document provides some assistance and clarity in your studies.
unit 4.pptx of hash function in cryptographyNithyasriA2
油
This document discusses cryptographic hash functions and their applications. It provides 3 key points:
1. Cryptographic hash functions are algorithms that take a variable-length input and produce a fixed-length output (hash value) that uniquely identifies the input. They have properties of one-wayness and collision resistance.
2. Hash functions have important applications in message authentication, digital signatures, and password protection by providing a means to verify message integrity and authenticity.
3. The security of cryptographic hash functions depends on their resistance to brute-force attacks and cryptanalysis. Attacks aim to find collisions or preimages more efficiently than brute force search. Iterated hash functions are most commonly used due to their security
This document discusses different types of routing protocols. It describes static routing protocols where routes are manually configured by an administrator. It then covers dynamic routing protocols which automatically update routing tables. The main dynamic routing protocols covered are RIP, RIPv2, IGRP, and EIGRP. RIP is a distance vector protocol that exchanges full routing tables every 30 seconds. RIPv2, IGRP, and EIGRP are also discussed with their key characteristics.
The document discusses hashing techniques for data structures. It describes how hashing is used to store and retrieve records from a hash table using a key and hash function. When two keys hash to the same location (collision), different collision resolution strategies can be used like open addressing, separate chaining, and bucket hashing. Open addressing methods like linear probing and quadratic probing search for the next empty location to store collided records. Separate chaining stores collided records in linked lists at hash table locations.
The IP addresses used to identify systems on a TCP/IP network. The IP address is an absolute identifier of both the individual machine and the network on which it resides.
Every IP datagram packet transmitted over a TCP/IP network contains the IP addresses of the source system that generated it and the destination system for which its intended in its IP header.
This document discusses block ciphers, including their definition, structure, design principles, and avalanche effect. A block cipher operates on fixed-length blocks of bits and uses a symmetric key. It encrypts bits in blocks rather than one by one. Block ciphers have advantages like high diffusion but are slower than stream ciphers. They are built using the Feistel cipher structure with a number of rounds and keys. Important design principles for block ciphers include the number of rounds, design of the round function, and key schedule algorithm. The avalanche effect causes a small input change to result in a significant output change.
hey! everybody this is my third and last pps of this month and i ensure that this will definately guide you about ip address and its contain and what r all different kinds of ip r available with questions tags specified also. all thoes who u cannot find on any search engine u can get all stuff here!!!!!!
hope u loved it ???!@@@#
This document discusses IP addressing and classful addressing. It covers the different address classes (A, B, C, D, E), how they divide up the IP address space, network addresses, subnet masks, and provides examples of converting between binary, decimal and hexadecimal notation. It also discusses concepts like broadcast addresses and private addressing blocks.
This document discusses IP addressing and provides an overview of:
- The IPv4 address space and address notation in binary, dotted-decimal, and hexadecimal formats.
- Classful addressing which divides the IP address space into classes A, B, C, D and E and assigns a fixed number of addresses to each block within a class. This leads to inefficient use of addresses.
- The concept of hierarchical or two-level addressing used in classful addressing where each address contains a network ID and host ID portion.
This document discusses computer networks and IPv4 addressing. It covers:
- IPv4 addresses are 32-bit numbers that uniquely identify devices on the internet. They can be written in binary, decimal, or hexadecimal notation.
- Examples are provided to convert between these notations and find network addresses, prefixes, suffixes, and number of addresses in blocks.
- The concept of classful addressing is introduced, which divides IPv4 space into classes A, B, C, D, and E based on address bits. Subnetting and classless addressing are also covered.
- Classless addressing uses variable length blocks and prefix notation to provide more flexibility than classful addressing. Block allocation and extraction of block
This document discusses IP address classes and classful addressing in IPv4. It begins by introducing the objectives and topics to be covered, which include IPv4 addresses and classes, identifying address classes, finding network addresses from IP addresses, and understanding masks and subnets. It then covers address classes A, B, C, D and E, including how they divide up the address space and the number of addresses in each class. Examples are provided to identify address classes from both binary and decimal notation. The concepts of network IDs, host IDs, blocks, and network addresses are also explained.
This document discusses TCP/IP addressing and the IPv4 address space. It covers IP address classes, classful addressing, and how addresses are assigned in blocks to networks. It also introduces the concepts of subnetting and supernetting which were approaches used to help alleviate the depletion of available classful address space as demand grew. Subnetting created additional hierarchy by dividing network blocks into smaller subnets, while supernetting combined blocks into larger supernets. Both techniques are now largely obsolete with the introduction of classless or CIDR addressing.
hello everyone this a very interesting pps about general concepts of ip address here u can find lot of stuff and all those matter which u could not find even in a search engine
HOPE U LOVE IT
This document discusses IP addressing and the TCP/IP protocol suite. It covers the following topics:
- IP addresses are 32-bit addresses that uniquely identify devices on the Internet. Early IP addressing used a system of address classes (A, B, C, etc.) that is now obsolete.
- Subnetting and supernetting were techniques used to work around the limitations of classful addressing and allow for more flexible allocation of address blocks.
- The document provides examples of converting between binary, decimal and hexadecimal IP address notations. It also covers how to determine the network address, subnet mask, and address range for given IP addresses.
This document discusses IP addressing and classful addressing in TCP/IP networking. It covers the following key points:
- IP addresses are 32-bit addresses that uniquely identify devices on the Internet. They are organized into classes A, B, C, D and E based on the binary pattern of the address.
- Classful addressing allocates address blocks to organizations based on these classes. However, this led to inefficient address usage and rapid depletion of available addresses.
- Subnetting and supernetting were introduced to allow better allocation of addresses within the original classful blocks through the use of subnet and supernet masks. However, classful addressing is now mostly obsolete.
IP addresses are divided into classes (A, B, C, D, E) based on the first bits of the address. Classful addressing wastes address space. Subnetting and supernetting borrow bits from the host/network parts to create more efficient variable length subnets and supernets. Classless addressing uses CIDR notation of address/prefix length to define variable length blocks.
The document discusses IPv4 addressing and networking concepts. It defines an IPv4 address as a 32-bit address that uniquely identifies devices on the Internet. IPv4 addresses have either a binary or dotted decimal notation. The document also covers IPv4 classes, subnetting, supernetting, and classless addressing which allow for flexible allocation of address blocks.
The document discusses IP addressing and networking concepts. It covers IP address classes A, B, C, D and E; converting between binary and dotted-decimal notation; finding the network address and class of an IP; default subnet masks; and IP addressing hierarchy with network and host IDs.
The document discusses IP addressing and networking concepts. It covers IP address classes A, B, C, D and E; converting between binary and dotted-decimal notation; finding the network address and class of an IP; default subnet masks; and IP addressing hierarchy with network and host IDs.
The document discusses IPv4 addressing and subnetting. It provides an example where an ISP is granted a block of 65,536 IPv4 addresses. The ISP needs to allocate these addresses to three groups of customers with different address requirements. It designs the subnet blocks for each group using variable length subnet masking to efficiently allocate the addresses. In total, 40,960 addresses are allocated, leaving 24,576 addresses still available.
This document discusses IPv4 addressing and subnetting. It begins by explaining IPv4 addresses in binary, decimal, and hexadecimal notation. It then covers classful addressing, including the five address classes (A, B, C, D, E) and how to determine an address's class. The document also discusses subnetting and classless addressing with variable length prefixes. It provides examples of extracting network information from addresses using masks. Finally, it discusses special addresses like loopback addresses and private addresses.
This document discusses IP addressing and subnetting. It begins by explaining IP addresses, which are 32-bit identifiers for devices connected to the Internet. IP addresses are divided into classes based on the values of their most significant bits, with Class A having 8 network bits, Class B having 16 network bits, and Class C having 24 network bits. The document then covers subnetting, which adds additional network bits to IP addresses, creating hierarchical subnetworks and conserving address space. It also briefly discusses supernetting, which combines network blocks into larger supernetworks.
This document discusses IP addressing and subnetting. It begins by explaining IP addresses, classes of addresses, and how to determine the class of an address. It then discusses subnetting and supernetting as ways to address the depletion of classful addresses. It provides examples of converting between binary, decimal, and dotted-decimal notation. It also covers network addresses, default masks, and how to calculate subnet addresses using subnet masks.
1. Chapter 4 Objectives Upon completion you will be able to: IP Addresses: Classful Addressing Understand IPv4 addresses and classes Identify the class of an IP address Find the network address given an IP address Understand masks and how to use them Understand subnets and supernets
2. 4.1 INTRODUCTION 4.1 INTRODUCTION The identifier used in the IP layer of the TCP/IP protocol suite to identify each device connected to the Internet is called the Internet address or IP address. An IP address is a 32-bit address that uniquely and universally defines the connection of a host or a router to the Internet. IP addresses are unique. They are unique in the sense that each address defines one, and only one, connection to the Internet. Two devices on the Internet can never have the same address. The topics discussed in this section include: Address Space Notation
7. The binary, decimal, and hexadecimal number systems are reviewed in Appendix B. Note:
8. Change the following IP addresses from binary notation to dotted-decimal notation. a. 10000001 00001011 00001011 11101111 b . 11000001 10000011 00011011 11111111 c. 11100111 11011011 10001011 01101111 d. 11111001 10011011 11111011 00001111 Example 1 Solution We replace each group of 8 bits with its equivalent decimal number (see Appendix B) and add dots for separation: a. 129.11.11.239 b. 193.131.27.255 c. 231.219.139.111 d. 249.155.251.15
9. Change the following IP addresses from dotted-decimal notation to binary notation. a. 111.56.45.78 b. 221.34.7.82 c. 241.8.56.12 d. 75.45.34.78 Example 2 Solution We replace each decimal number with its binary equivalent: a. 01101111 00111000 00101101 01001110 b. 11011101 00100010 00000111 01010010 c. 11110001 00001000 00111000 00001100 d. 01001011 00101101 00100010 01001110
10. Find the error, if any, in the following IP addresses: a. 111.56.045.78 b. 221.34.7.8.20 c. 75.45.301.14 d. 11100010.23.14.67 Example 3 Solution a. There are no leading zeroes in dotted-decimal notation (045). b. We may not have more than four numbers in an IP address. c. In dotted-decimal notation, each number is less than or equal to 255; 301 is outside this range. d. A mixture of binary notation and dotted-decimal notation is not allowed.
11. Change the following IP addresses from binary notation to hexadecimal notation. a. 10000001 00001011 00001011 11101111 b. 11000001 10000011 00011011 11111111 Example 4 Solution We replace each group of 4 bits with its hexadecimal equivalent (see Appendix B). Note that hexadecimal notation normally has no added spaces or dots; however, 0X (or 0x) is added at the beginning or the subscript 16 at the end to show that the number is in hexadecimal. a. 0X810B0BEF or 810B0BEF 16 b. 0XC1831BFF or C1831BFF 16
12. 4.2 CLASSFUL ADDRESSING IP addresses, when started a few decades ago, used the concept of classes. This architecture is called classful addressing . In the mid-1990s, a new architecture, called classless addressing, was introduced and will eventually supersede the original architecture. However, part of the Internet is still using classful addressing, but the migration is very fast. The topics discussed in this section include: Recognizing Classes Netid and Hostid Classes and Blocks Network Addresses Sufficient Information Mask CIDR Notation Address Depletion
17. How can we prove that we have 2,147,483,648 addresses in class A? Example 5 Solution In class A, only 1 bit defines the class. The remaining 31 bits are available for the address. With 31 bits, we can have 2 31 or 2,147,483,648 addresses.
18. Find the class of each address: a. 0 0000001 00001011 00001011 11101111 b. 110 00001 10000011 00011011 11111111 c. 10 100111 11011011 10001011 01101111 d. 1111 0011 10011011 11111011 00001111 Example 6 Solution See the procedure in Figure 4.4. a. The first bit is 0. This is a class A address. b. The first 2 bits are 1; the third bit is 0. This is a class C address. c. The first bit is 0; the second bit is 1. This is a class B address. d. The first 4 bits are 1s. This is a class E address..
19. Figure 4.5 Finding the class in decimal notation
20. Find the class of each address: a. 227.12.14.87 b. 193.14.56.22 c. 14.23.120.8 d. 252.5.15.111 e. 134.11.78.56 Example 7 Solution a. The first byte is 227 (between 224 and 239); the class is D. b . The first byte is 193 (between 192 and 223); the class is C. c. The first byte is 14 (between 0 and 127); the class is A. d. The first byte is 252 (between 240 and 255); the class is E. e. The first byte is 134 (between 128 and 191); the class is B.
21. In Example 5 we showed that class A has 2 31 (2,147,483,648) addresses. How can we prove this same fact using dotted-decimal notation? Example 8 Solution The addresses in class A range from 0.0.0.0 to 127.255.255.255. We need to show that the difference between these two numbers is 2,147,483,648. This is a good exercise because it shows us how to define the range of addresses between two addresses. We notice that we are dealing with base 256 numbers here. Each byte in the notation has a weight. The weights are as follows (see Appendix B): See Next 際際滷
22. 256 3 , 256 2 , 256 1 , 256 0 Example 8 (continued) Last address: 127 256 3 + 255 256 2 + 255 256 1 + 255 256 0 = 2,147,483,647 First address: = 0 Now to find the integer value of each number, we multiply each byte by its weight: If we subtract the first from the last and add 1 to the result (remember we always add 1 to get the range), we get 2,147,483,648 or 2 31 .
29. The number of addresses in class C is smaller than the needs of most organizations. Note:
30. Class D addresses are used for multicasting; there is only one block in this class. Note:
31. Class E addresses are reserved for future purposes; most of the block is wasted. Note:
32. In classful addressing, the network address (the first address in the block) is the one that is assigned to the organization. The range of addresses can automatically be inferred from the network address. Note:
33. Given the network address 17.0.0.0, find the class, the block, and the range of the addresses. Example 9 Solution The class is A because the first byte is between 0 and 127. The block has a netid of 17. The addresses range from 17.0.0.0 to 17.255.255.255.
34. Given the network address 132.21.0.0, find the class, the block, and the range of the addresses. Example 10 Solution The class is B because the first byte is between 128 and 191. The block has a netid of 132.21. The addresses range from 132.21.0.0 to 132.21.255.255.
35. Given the network address 220.34.76.0, find the class, the block, and the range of the addresses. Example 11 Solution The class is C because the first byte is between 192 and 223. The block has a netid of 220.34.76. The addresses range from 220.34.76.0 to 220.34.76.255.
39. The network address is the beginning address of each block. It can be found by applying the default mask to any of the addresses in the block (including itself). It retains the netid of the block and sets the hostid to zero. Note:
40. Given the address 23.56.7.91, find the beginning address (network address). Example 12 Solution The default mask is 255.0.0.0, which means that only the first byte is preserved and the other 3 bytes are set to 0s. The network address is 23.0.0.0.
41. Given the address 132.6.17.85, find the beginning address (network address). Example 13 Solution The default mask is 255.255.0.0, which means that the first 2 bytes are preserved and the other 2 bytes are set to 0s. The network address is 132.6.0.0 .
42. Given the address 201.180.56.5, find the beginning address (network address). Example 14 Solution The default mask is 255.255.255.0, which means that the first 3 bytes are preserved and the last byte is set to 0. The network address is 201.180.56.0 .
43. Note that we must not apply the default mask of one class to an address belonging to another class. Note:
44. 4.3 OTHER ISSUES In this section, we discuss some other issues that are related to addressing in general and classful addressing in particular. The topics discussed in this section include: Multihomed Devices Location, Not Names Special Addresses Private Addresses Unicast, Multicast, and Broadcast Addresses
58. 4.4 SUBNETTING AND SUPERNETTING In the previous sections we discussed the problems associated with classful addressing. Specifically, the network addresses available for assignment to organizations are close to depletion. This is coupled with the ever-increasing demand for addresses from organizations that want connection to the Internet. In this section we briefly discuss two solutions: subnetting and supernetting. The topics discussed in this section include: Subnetting Supernetting Supernet Mask Obsolescence
65. What is the subnetwork address if the destination address is 200.45.34.56 and the subnet mask is 255.255.240.0? Example 15 Solution We apply the AND operation on the address and the subnet mask. Address 11001000 00101101 00100010 00111000 Subnet Mask 11111111 11111111 11110000 00000000 Subnetwork Address 11001000 00101101 00100000 00000000.
66. Figure 4.25 Comparison of a default mask and a subnet mask
68. In subnetting, we need the first address of the subnet and the subnet mask to define the range of addresses. In supernetting, we need the first address of the supernet and the supernet mask to define the range of addresses. Note:
69. Figure 4.27 Comparison of subnet, default, and supernet masks
70. The idea of subnetting and supernetting of classful addresses is almost obsolete. Note: