SlideShare uma empresa Scribd logo
1 de 41
Computer Networks (CIE 447)
Problem set 3 – Chapter 4
Dr. / Samy Soliman
T. A. :Eng. Menna Mohamed
:Eng. Nourhan Tarek
CIE 447- SPRING 2020
IPv4 addresses
IPv4 address is the logical address of a network device, which is composed of a 32-bits
address.
It is written as 4 octets, that are separated by a dot.
Ex.: 172.16.254.1
Each octet in the IPv4 address has a value range from 0 to 255 , where each octet is a 4-bit
long.
CIE 447- SPRING 2020 2
The subnet
Class A
Class A addresses were originally designed for networks with a very large number of hosts.
The default subnet mask is 255.0.0.0 or /8.
Some of this class addresses are reserved or invalid to be assigned to hosts.
0.0.0.1 to 0.255.255.255 are invalid host addresses.
127.0.0.1 to 127.255.255.255 are invalid host addresses, However, they are used for testing the
local computer
127.0.0.1 is used for testing the TCP/IP.
CIE 447- SPRING 2020 3
The subnet
Classes B & C
Class B
Class B addresses were originally designed for medium-sized to large-sized networks.
The default subnet mask is 255.255.0.0 or /16.
The range of valid addresses are from 128.0.0.0 to 191.255.0.0 / 16.
Class C
Class C addresses were designed for small networks.
The default subnet mask is 255.255.255.0 or /24.
The range of valid addresses are from 192.0.0.0 to 123.255.255.0 / 24.
CIE 447- SPRING 2020 4
The subnet
Classes D & E
Class D
Class D addresses are reserved for multicasting IP addresses.
The addresses are not assigned to hosts, which means there is no default subnet mask.
 the range of valid addresses is from 224.0.0.0 to 239.255.255.255
Class E
Class E addresses are experimental and reserved for future use.
These addresses are not assigned to hosts and there is no default subnet mask.
The valid range of addresses is from 240.0.0.0 to 255.255.255.255
CIE 447- SPRING 2020 5
Classless Interdomain routing (CIDR)
CIE 447- SPRING 2020 6
Class
Size
of network
number bit
field
Size of rest bit
field
Start address End address
Default subnet
mask
CIDR notation
Class A
(unicast)
8 24 0.0.0.0
127.255.255.2
55
255.0.0.0 /8
Class B
(unicast)
16 16 128.0.0.0
191.255.255.2
55
255.255.0.0 /16
Class C
(unicast)
24 8 192.0.0.0
223.255.255.2
55
255.255.255.0 /24
Class D
(multicast)
not defined not defined 224.0.0.0
239.255.255.2
55
not defined not defined
Class E
(reserved)
not defined not defined 240.0.0.0
255.255.255.2
55
not defined not defined
Classless Interdomain routing (CIDR)
Classless
Completely eliminates traditional concepts of Class A, B and C addresses.
Network prefix based:
 Routers do not make any assumption on the basis of the three leading bits.
They require an explicit network prefix to determine dividing point between
network_id (prefix) and host_id.
CIE 447- SPRING 2020 7
Classless Interdomain routing (CIDR)
Example:
Subnet 1: 213.2.96.0 → 11010101.00000010.01100000.00000000
Subnet 2: 213.2.97.0 → 11010101.00000010.01100001.00000000
Subnet 3: 213.2.98.0 → 11010101.00000010.01100010.00000000
Subnet 4: 213.2.99.0 → 11010101.00000010.01100011.00000000
Supernet mask: 255.255.252.0
Supernet address: 213.2.96.0/22 → 11010101 . 00000010 . 011000 00 . 00000000
CIE 447- SPRING 2020 8
Longest prefix match
Matching the longest prefix of an IP destination address to the entries in a routing table, to
determine the appropriate outgoing link.
Subnet 1’s IP addresses are from 213.2.96.0 → 11010101.00000010.01100000.00000000
to 213.2.96.23 → 11010101.00000010.01100000.00110111
The longest prefix match that is used in the forwarding table of the router is:
11010101.00000010.01100000.00
Subnet 2’s IP addresses are from 213.2.97.0 → 11010101.00000010.01100001.00000000
to 213.2.97.226 → 11010101.00000010.01100001.11100010
The longest prefix match that is used in the forwarding table of the router is:
11010101.00000010.01100001
CIE 447- SPRING 2020 9
Problem 4
 Consider the network below.
a. Suppose that this network is a datagram network.
Show the forwarding table in router A, such that all
traffic destined to host H3 is forwarded through interface
3.
CIE 447- SPRING 2020 10
Problem 4
 Consider the network below.
a. Suppose that this network is a datagram network.
Show the forwarding table in router A, such that all
traffic destined to host H3 is forwarded through interface
3.
Solution:
CIE 447- SPRING 2020 11
Destination address Interface link
H3 3
Problem 4
 Consider the network below.
b. Suppose that this network is a datagram network. Can
you write down a forwarding table in router A, such that
all traffic from H1 destined to host H3 is forwarded
through interface 3, while all traffic from H2 destined to
host H3 is forwarded through interface 4? (Hint: this is a
trick question.)
CIE 447- SPRING 2020 12
Problem 4
 Consider the network below.
b. Suppose that this network is a datagram network. Can
you write down a forwarding table in router A, such that
all traffic from H1 destined to host H3 is forwarded
through interface 3, while all traffic from H2 destined to
host H3 is forwarded through interface 4? (Hint: this is a
trick question.)
Solution:
No, because the forwarding table is based on the
destination address, not the source address
CIE 447- SPRING 2020 13
Destination address Interface link
H3 3
H3 4
Problem 4
 Consider the network below.
c. Now suppose that this network is a virtual circuit
network and that there is one ongoing call between H1
and H3, and another ongoing call between H2 and H3.
Write down a forwarding table in router A, such that all
traffic from H1 destined to host H3 is forwarded through
interface 3, while all traffic from H2 destined to host H3
is forwarded through interface 4.
CIE 447- SPRING 2020 14
Problem 4
 Consider the network below.
c. Now suppose that this network is a virtual circuit
network and that there is one ongoing call between H1
and H3, and another ongoing call between H2 and H3.
Write down a forwarding table in router A, such that all
traffic from H1 destined to host H3 is forwarded through
interface 3, while all traffic from H2 destined to host H3
is forwarded through interface 4.
Solution: the forwarding table at router A
CIE 447- SPRING 2020 15
14
24
Incoming
interface
Incoming VC Outgoing
interface
Outgoing VC
1 11 3 12
2 21 4 22
Problem 4
 Consider the network below.
d. Assuming the same scenario as (c), write down the
forwarding tables in nodes B, C, and D.
CIE 447- SPRING 2020 16
14
24
Problem 4
 Consider the network below.
d. Assuming the same scenario as (c), write down the
forwarding tables in nodes B, C, and D.
Solution:
The forwarding table at router B:
The forwarding table at router C:
CIE 447- SPRING 2020 17
Incoming
interface
Incoming
VC
Outgoing
interface
Outgoing
VC
1 12 2 13
Incoming
interface
Incoming
VC
Outgoing
interface
Outgoing
VC
1 22 2 23
The forwarding table at router D:
Incoming
interface
Incoming
VC
Outgoing
interface
Outgoing
VC
1 13 3 14
2 23 3 24
Problem 5(*)
Consider a VC network with a 2-bit field for the VC
number. Suppose that the network wants to set up
a virtual circuit over four links: link A, link B, link C,
and link D.
Suppose that each of these links is currently carrying
two other virtual circuits, and the VC numbers of
these other VCs are as follows:
CIE 447- SPRING 2020 18
In answering the following questions, keep in mind that each of the existing VCs may only be traversing
one of the four links.
a. If each VC is required to use the same VC number on all links along its path, what VC number could be
assigned to the new VC?
Problem 5(*)
Consider a VC network with a 2-bit field for the VC
number. Suppose that the network wants to set up
a virtual circuit over four links: link A, link B, link C,
and link D.
Suppose that each of these links is currently carrying
two other virtual circuits, and the VC numbers of
these other VCs are as follows:
CIE 447- SPRING 2020 19
In answering the following questions, keep in mind that each of the existing VCs may only be traversing
one of the four links.
a. If each VC is required to use the same VC number on all links along its path, what VC number could be
assigned to the new VC?
Solution:
A new VC can’t be established, as the VC number is 2 bits.
∴ The max. number of links that could be established 22 = 4 links
Problem 5(*)
Consider a VC network with a 2-bit field for the VC
number. Suppose that the network wants to set up
a virtual circuit over four links: link A, link B, link C,
and link D.
CIE 447- SPRING 2020 20
b. If each VC is permitted to have different VC numbers in the different links along its path (so that
forwarding tables must perform VC number translation), how many different combinations of four VC
numbers (one for each of the four links) could be used?
Problem 5(*)
Consider a VC network with a 2-bit field for the VC
number. Suppose that the network wants to set up
a virtual circuit over four links: link A, link B, link C,
and link D.
CIE 447- SPRING 2020 21
b. If each VC is permitted to have different VC numbers in the different links along its path (so that
forwarding tables must perform VC number translation), how many different combinations of four VC
numbers (one for each of the four links) could be used?
Solution:
The number of link = 4 and each link has 2 VC numbers
∴ The total combinations of the 4 VC links = 24 = 16 combination
(10, 00, 00, 10) or (00, 10, 00, 10)
Problem 10
Consider a datagram network using 32-bit host
addresses. Suppose a router has four links,
numbered 0 through 3, and packets are to be
forwarded to the link interfaces as follows:
a. Provide a forwarding table that has five entries,
uses longest prefix matching, and forwards
packets to the correct link interfaces.
CIE 447- SPRING 2020 22
Destination Address Range Link
Interface
11100000 00000000 00000000 00000000
Through
11100000 00111111 11111111 11111111
0
11100000 01000000 00000000 00000000
Through
11100000 01000000 11111111 11111111
1
11100000 01000001 00000000 00000000
Through
11100001 01111111 11111111 11111111
2
Otherwise 3
Problem 10
Consider a datagram network using 32-bit host
addresses. Suppose a router has four links,
numbered 0 through 3, and packets are to be
forwarded to the link interfaces as follows:
a. Provide a forwarding table that has five entries,
uses longest prefix matching, and forwards
packets to the correct link interfaces.
Solution:
CIE 447- SPRING 2020 23
Destination Address Range Link
Interface
11100000 00000000 00000000 00000000
Through
11100000 00111111 11111111 11111111
0
11100000 01000000 00000000 00000000
Through
11100000 01000000 11111111 11111111
1
11100000 01000001 00000000 00000000
Through
11100001 01111111 11111111 11111111
2
Otherwise 3
Entry no. Prefix match Link interface
1 11100000 00 0
2 11100000 01000000 1
3 1110000 2
4 11100001 1 3
5 Otherwise 3
Problem 10
Consider a datagram network using 32-bit host addresses. Suppose a router has four
links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as
follows:
b. Describe how your forwarding table determines the appropriate link interface for
datagrams with destination addresses:
11001000 10010001 01010001 01010101
11100001 01000000 11000011 00111100
11100001 10000000 00010001 01110111
CIE 447- SPRING 2020 24
Problem 10
Consider a datagram network using 32-bit host
addresses. Suppose a router has four links, numbered 0
through 3, and packets are to be forwarded to the link
interfaces as follows:
b. Describe how your forwarding table determines the
appropriate link interface for datagrams with destination
addresses:
CIE 447- SPRING 2020 25
Entry no. Prefix match Link interface
1 11100000 00 0
2 11100000 01000000 1
3 1110000 2
4 11100001 1 3
5 Otherwise 3
Solution:
11001000 10010001 01010001 01010101 → it matches 5𝑡ℎ entry: otherwise, it will be forwarded to link 3
11100001 01000000 11000011 00111100 → it matches 3𝑡ℎ entry, it will be forwarded to link 2
11100001 10000000 00010001 01110111 → it matches 4𝑡ℎ
entry, it will be forwarded to link 3
Problem 11
Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix
matching and has the following forwarding table:
For each of the four interfaces, give the associated range of destination host addresses and the
number of addresses in the range.
CIE 447- SPRING 2020 26
Problem 11
Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has
the following forwarding table:
For each of the four interfaces, give the associated range of destination host addresses and the number of
addresses in the range.
Solution:
CIE 447- SPRING 2020 27
Destination Address Range Link
Interface
No. of
addresses in a
link
00000000 Through 00111111 0 26 = 64
01000000 Through 01011111 1 25 = 32
01100000 Through 01111111 2 25 + 26
= 32 + 64
= 96
10000000 Through 10111111 2
11000000 Through 11111111 3 26
= 64
Problem 12(*)
Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix
matching and has the following forwarding table:
For each of the four interfaces, give the associated range of destination host addresses and the
number of addresses in the range.
CIE 447- SPRING 2020 28
Problem 12(*)
Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix
matching and has the following forwarding table:
For each of the four interfaces, give the associated range of destination host addresses and the
number of addresses in the range.
Solution:
CIE 447- SPRING 2020 29
Destination Address Range Link
Interface
No. of
addresses in a
link
10000000 Through 11111111 0 27 = 128
10000000 Through 10111111 1 26 = 64
11100000 Through 11111111 2 25 =32
00000000 Through 01111111 3 27
= 128
Problem 13
Consider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3.
Suppose all of the interfaces in each of these three subnets are required to have the prefix
223.1.17/24. Also suppose that Subnet 1 is required to support at least 60 interfaces, Subnet 2 is
to support at least 90 interfaces, and Subnet 3 is to support at least 12 interfaces.
Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints.
CIE 447- SPRING 2020 30
Problem 13
Consider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3. Suppose all of the interfaces in each
of these three subnets are required to have the prefix 223.1.17/24. Also suppose that Subnet 1 is required to support at least
60 interfaces, Subnet 2 is to support at least 90 interfaces, and Subnet 3 is to support at least 12 interfaces.
Solution:
The total no. of addresses = 28
= 256 and by mapping the CIDR into binary address
The IP address: 223.1.17.0 → network address, can’t be used as an interface and the IP address: 223.1.17.225 → broadcast
address
For subnet 1: it needs 60 interfaces +2 (network and broadcast) = 26
= 64 ∴ The subnet 1 address: 223.1.17.0/25
For subnet 2: it needs 90 interfaces +2 (network and broadcast) = 27
= 128 ∴ The subnet 2 address: 223.1.17.64/24
For subnet 3: it needs 12 interfaces +2 (network and broadcast) = 24
= 16 ∴ The subnet 3 address: 223.1.17.192/28
CIE 447- SPRING 2020 31
223 1 17 x
11011111 00000001 00010001 xxxxxxxx
Problem 17
Consider the topology shown in Figure 4.17. Denote the three
subnets with hosts (starting clockwise at 12:00) as Networks A,
B, and C. Denote the subnets without hosts as Networks D, E,
and F.
a. Assign network addresses to each of these six subnets, with
the following constraints:
All addresses must be allocated from 214.97.254/23;
Subnet A should have enough addresses to support 250 interfaces;
Subnet B should have enough addresses to support 120 interfaces;
Subnet C should have enough addresses to support 120 interfaces.
subnets D, E and F should each be able to support two interfaces.
CIE 447- SPRING 2020 32
Problem 17
Consider the topology shown in Figure 4.17. Denote the three
subnets with hosts (starting clockwise at 12:00) as Networks A,
B, and C. Denote the subnets without hosts as Networks D, E,
and F.
a. Assign network addresses to each of these six subnets, with
the following constraints:
All addresses must be allocated from 214.97.254/23;
∴ The total no. of available addresses = 29 = 512
CIE 447- SPRING 2020 33
214 97 254 x
11010110 01100001 11111110 xxxxxxxx
Problem 17
a. Assign network addresses to each of these six subnets, with the
following constraints:
Subnet A should have enough addresses to support 250 interfaces;
∴ it needs 250 interfaces +2 (network and broadcast) = 28
= 256
Subnet B should have enough addresses to support 120 interfaces;
∴ it needs 120 interfaces +2 (network and broadcast) = 27
= 128
Subnet C should have enough addresses to support 120 interfaces.
∴ it needs 120 interfaces +2 (network and broadcast) = 27 = 128
subnets D, E and F should each be able to support two interfaces.
∴ Each needs 2 interfaces = 22
= 4
∴ The total no. of the designed addresses = 516, which exceeds the
available number of addresses
Sol. : Deduct a number of addresses from one of the subnets → Subnet B
CIE 447- SPRING 2020 34
Problem 17
a. Assign network addresses to each of these six subnets, with the following
constraints:
Subnet A should have enough addresses to support 250 interfaces;
∴ it needs 250 interfaces +2 (network and broadcast) = 28
= 256
The range of addresses are 214.97.255.00000000 → 214.97.255. 00000001
The range of addresses are 214.97.255.0 → 214.97.255.254
Subnet A’s network address: 214.97.255/24
Subnet B should have enough addresses to support 120 interfaces;
∴ it needs 120 interfaces +2 (network and broadcast) = 27
= 128
Only 120 addresses will be used. ∴ a set of IP addresses will be deducted.
The range of addresses are 214.97.254.00000000 → 214.97.255. 01111111
∵ The required no. of addresses to be deducted = 8
∴ The deducted range of addresses: 214.97.254.00000000 → 214.97.254.00000111
CIE 447- SPRING 2020 35
∴ Subnet B’s network address : 214.97.254.0/25 - 214.97.254.0/29
Problem 17
a. Assign network addresses to each of these six subnets, with the
following constraints:
Subnet C should have enough addresses to support 120 interfaces.
∴ it needs 120 interfaces +2 (network and broadcast) = 27
= 128
The range of addresses are 214.97.254.10000000 → 214.97.254. 11110111
The range of addresses are 214.97.254.128 → 214.97.254.247
Subnet C’s network address: 214.97.254.128/25
subnets D, E and F should each be able to support two interfaces.
Subnet D has 2 addresses : 214.97.254.0/31
Subnet E has 2 addresses : 214.97.254.2/31
Subnet F has 4 addresses : 214.97.254.4/30
CIE 447- SPRING 2020 36
Problem 17
CIE 447- SPRING 2020 37
Problem 17
Consider the topology shown in Figure 4.17. Denote the three subnets with hosts (starting
clockwise at 12:00) as Networks A, B, and C. Denote the subnets without hosts as Networks D, E,
and F.
b. Using your answer to part (a), provide the forwarding tables (using longest prefix matching) for
each of the three routers.
Router 1:
CIE 447- SPRING 2020 38
Longest prefix match Link interface
11010110 01100001 11111111 A
11010110 01100001 11111110 0000000 D
11010110 01100001 11111110 000001 F
Problem 17
Consider the topology shown in Figure 4.17. Denote the three subnets with hosts (starting
clockwise at 12:00) as Networks A, B, and C. Denote the subnets without hosts as Networks D, E,
and F.
b. Using your answer to part (a), provide the forwarding tables (using longest prefix matching) for
each of the three routers.
Router 2:
CIE 447- SPRING 2020 39
Longest prefix match Link interface
11010110 01100001 11111110 1 C
11010110 01100001 11111110 0000001 E
11010110 01100001 11111110 000001 F
Problem 17
Consider the topology shown in Figure 4.17. Denote the three subnets with hosts (starting
clockwise at 12:00) as Networks A, B, and C. Denote the subnets without hosts as Networks D, E,
and F.
b. Using your answer to part (a), provide the forwarding tables (using longest prefix matching) for
each of the three routers.
Router 3:
CIE 447- SPRING 2020 40
Longest prefix match Link interface
11010110 01100001 11111110 0 B
11010110 01100001 11111110 0000000 D
11010110 01100001 11111110 0000001 E
Homework
Solve problems 14, 15 and 16.
Due date: 5/4/2020
CIE 447- SPRING 2020 41

Mais conteúdo relacionado

Mais procurados

Mais procurados (20)

Chapter 21
Chapter 21Chapter 21
Chapter 21
 
Subnetting
SubnettingSubnetting
Subnetting
 
Chapter 19
Chapter 19Chapter 19
Chapter 19
 
Ch22
Ch22Ch22
Ch22
 
Subnetting Presentation
Subnetting PresentationSubnetting Presentation
Subnetting Presentation
 
IPv4
IPv4IPv4
IPv4
 
Chapter 20
Chapter 20Chapter 20
Chapter 20
 
Ip addressing
Ip addressingIp addressing
Ip addressing
 
computer communication networks MCQs
 computer communication networks MCQs   computer communication networks MCQs
computer communication networks MCQs
 
I pv4 address classes
I pv4 address classesI pv4 address classes
I pv4 address classes
 
2.6.6 Packet Tracer - Verify Single-Area OSPFv2 - ILM.docx
2.6.6 Packet Tracer - Verify Single-Area OSPFv2 - ILM.docx2.6.6 Packet Tracer - Verify Single-Area OSPFv2 - ILM.docx
2.6.6 Packet Tracer - Verify Single-Area OSPFv2 - ILM.docx
 
Network Layer Numericals
Network Layer NumericalsNetwork Layer Numericals
Network Layer Numericals
 
Circuit Switching, Packet Switching, Virtual Circuit Networks and Datagram Ne...
Circuit Switching, Packet Switching, Virtual Circuit Networks and Datagram Ne...Circuit Switching, Packet Switching, Virtual Circuit Networks and Datagram Ne...
Circuit Switching, Packet Switching, Virtual Circuit Networks and Datagram Ne...
 
Ip addressing classful
Ip addressing classfulIp addressing classful
Ip addressing classful
 
Final exam review answer(networking)
Final exam review answer(networking)Final exam review answer(networking)
Final exam review answer(networking)
 
IP addressing
IP addressingIP addressing
IP addressing
 
Subnetting
SubnettingSubnetting
Subnetting
 
Chapter 23
Chapter 23Chapter 23
Chapter 23
 
IPv4 Addressing
 IPv4 Addressing   IPv4 Addressing
IPv4 Addressing
 
Ch20
Ch20Ch20
Ch20
 

Semelhante a Problem set 3-solution.pptx

Midterm review questions ans(networking)
Midterm review questions ans(networking)Midterm review questions ans(networking)
Midterm review questions ans(networking)welcometofacebook
 
CyberLab TCP/IP and IP Addressing & Subnetting
CyberLab TCP/IP and IP Addressing & SubnettingCyberLab TCP/IP and IP Addressing & Subnetting
CyberLab TCP/IP and IP Addressing & SubnettingVivek chan
 
IP and CIDR ipv6 addressing.ppt
IP and CIDR ipv6 addressing.pptIP and CIDR ipv6 addressing.ppt
IP and CIDR ipv6 addressing.pptAkkiKumar26
 
module03-ipaddr.ppt
module03-ipaddr.pptmodule03-ipaddr.ppt
module03-ipaddr.pptImXaib
 
Subnetting and routing
Subnetting and routingSubnetting and routing
Subnetting and routingGaurav Juneja
 
CCNAX 200 120 dumps
CCNAX 200 120 dumpsCCNAX 200 120 dumps
CCNAX 200 120 dumpsabdulquyyum
 
Expl net fund_chapter_06_i_pv4_part_2
Expl net fund_chapter_06_i_pv4_part_2Expl net fund_chapter_06_i_pv4_part_2
Expl net fund_chapter_06_i_pv4_part_2kurtmctaggart
 
Ccna discovery
Ccna discoveryCcna discovery
Ccna discoveryccnaguide
 
200+ [updated] computer networking mc qs and answers 2020
200+ [updated] computer networking mc qs and answers 2020200+ [updated] computer networking mc qs and answers 2020
200+ [updated] computer networking mc qs and answers 2020tadeseguchi
 
200+ [updated] computer networking mc qs and answers 2020
200+ [updated] computer networking mc qs and answers 2020200+ [updated] computer networking mc qs and answers 2020
200+ [updated] computer networking mc qs and answers 2020tadeseguchi
 

Semelhante a Problem set 3-solution.pptx (20)

Day 5.5 subnetting
Day 5.5 subnettingDay 5.5 subnetting
Day 5.5 subnetting
 
Lecture 06
Lecture 06Lecture 06
Lecture 06
 
Ccna 200-120 Exam Dumps
Ccna 200-120 Exam DumpsCcna 200-120 Exam Dumps
Ccna 200-120 Exam Dumps
 
Prb#5
Prb#5Prb#5
Prb#5
 
13788 3
13788 313788 3
13788 3
 
IP classes and subnetting.
IP classes and subnetting.IP classes and subnetting.
IP classes and subnetting.
 
Midterm review questions ans(networking)
Midterm review questions ans(networking)Midterm review questions ans(networking)
Midterm review questions ans(networking)
 
CyberLab TCP/IP and IP Addressing & Subnetting
CyberLab TCP/IP and IP Addressing & SubnettingCyberLab TCP/IP and IP Addressing & Subnetting
CyberLab TCP/IP and IP Addressing & Subnetting
 
CCNA 1 Chapter 9 v5.0 2014
CCNA 1 Chapter 9 v5.0 2014CCNA 1 Chapter 9 v5.0 2014
CCNA 1 Chapter 9 v5.0 2014
 
Explaining ip address
Explaining ip addressExplaining ip address
Explaining ip address
 
IP and CIDR ipv6 addressing.ppt
IP and CIDR ipv6 addressing.pptIP and CIDR ipv6 addressing.ppt
IP and CIDR ipv6 addressing.ppt
 
module03-ipaddr.ppt
module03-ipaddr.pptmodule03-ipaddr.ppt
module03-ipaddr.ppt
 
Subnetting and routing
Subnetting and routingSubnetting and routing
Subnetting and routing
 
Lecture 03 networking
Lecture 03 networkingLecture 03 networking
Lecture 03 networking
 
CCNA DUMPS 200-120
CCNA DUMPS 200-120CCNA DUMPS 200-120
CCNA DUMPS 200-120
 
CCNAX 200 120 dumps
CCNAX 200 120 dumpsCCNAX 200 120 dumps
CCNAX 200 120 dumps
 
Expl net fund_chapter_06_i_pv4_part_2
Expl net fund_chapter_06_i_pv4_part_2Expl net fund_chapter_06_i_pv4_part_2
Expl net fund_chapter_06_i_pv4_part_2
 
Ccna discovery
Ccna discoveryCcna discovery
Ccna discovery
 
200+ [updated] computer networking mc qs and answers 2020
200+ [updated] computer networking mc qs and answers 2020200+ [updated] computer networking mc qs and answers 2020
200+ [updated] computer networking mc qs and answers 2020
 
200+ [updated] computer networking mc qs and answers 2020
200+ [updated] computer networking mc qs and answers 2020200+ [updated] computer networking mc qs and answers 2020
200+ [updated] computer networking mc qs and answers 2020
 

Mais de NourhanTarek23

CSE031.Lecture_05.Networks.pdf
CSE031.Lecture_05.Networks.pdfCSE031.Lecture_05.Networks.pdf
CSE031.Lecture_05.Networks.pdfNourhanTarek23
 
CSE031.Lecture_07-FlowCharts_Pseudocode .Part_II.pdf
CSE031.Lecture_07-FlowCharts_Pseudocode .Part_II.pdfCSE031.Lecture_07-FlowCharts_Pseudocode .Part_II.pdf
CSE031.Lecture_07-FlowCharts_Pseudocode .Part_II.pdfNourhanTarek23
 
CSE031.Lecture_11-Operating_Systems.Part_I.pptx
CSE031.Lecture_11-Operating_Systems.Part_I.pptxCSE031.Lecture_11-Operating_Systems.Part_I.pptx
CSE031.Lecture_11-Operating_Systems.Part_I.pptxNourhanTarek23
 
Lect02 Introducing Programming.ppt
Lect02 Introducing Programming.pptLect02 Introducing Programming.ppt
Lect02 Introducing Programming.pptNourhanTarek23
 
Lect01 Introduction of Visual Basic.ppt
Lect01 Introduction of Visual Basic.pptLect01 Introduction of Visual Basic.ppt
Lect01 Introduction of Visual Basic.pptNourhanTarek23
 
Software engineering.pptx
Software engineering.pptxSoftware engineering.pptx
Software engineering.pptxNourhanTarek23
 
Lect01 Computers Impact on Our lives IOT and Big Data Era.pptx
Lect01 Computers Impact on Our lives  IOT and Big Data Era.pptxLect01 Computers Impact on Our lives  IOT and Big Data Era.pptx
Lect01 Computers Impact on Our lives IOT and Big Data Era.pptxNourhanTarek23
 
Lab 7 - Bash Script.pptx
Lab 7 - Bash Script.pptxLab 7 - Bash Script.pptx
Lab 7 - Bash Script.pptxNourhanTarek23
 
Introduction to computer.pptx
Introduction to computer.pptxIntroduction to computer.pptx
Introduction to computer.pptxNourhanTarek23
 
Introduction to Spring sec2.pptx
Introduction to Spring sec2.pptxIntroduction to Spring sec2.pptx
Introduction to Spring sec2.pptxNourhanTarek23
 
Introduction to Spring sec1.pptx
Introduction to Spring sec1.pptxIntroduction to Spring sec1.pptx
Introduction to Spring sec1.pptxNourhanTarek23
 

Mais de NourhanTarek23 (15)

CSE031.Lecture_05.Networks.pdf
CSE031.Lecture_05.Networks.pdfCSE031.Lecture_05.Networks.pdf
CSE031.Lecture_05.Networks.pdf
 
CSE031.Lecture_07-FlowCharts_Pseudocode .Part_II.pdf
CSE031.Lecture_07-FlowCharts_Pseudocode .Part_II.pdfCSE031.Lecture_07-FlowCharts_Pseudocode .Part_II.pdf
CSE031.Lecture_07-FlowCharts_Pseudocode .Part_II.pdf
 
CSE031.Lecture_11-Operating_Systems.Part_I.pptx
CSE031.Lecture_11-Operating_Systems.Part_I.pptxCSE031.Lecture_11-Operating_Systems.Part_I.pptx
CSE031.Lecture_11-Operating_Systems.Part_I.pptx
 
Lect02 Introducing Programming.ppt
Lect02 Introducing Programming.pptLect02 Introducing Programming.ppt
Lect02 Introducing Programming.ppt
 
Lect01 Introduction of Visual Basic.ppt
Lect01 Introduction of Visual Basic.pptLect01 Introduction of Visual Basic.ppt
Lect01 Introduction of Visual Basic.ppt
 
Software engineering.pptx
Software engineering.pptxSoftware engineering.pptx
Software engineering.pptx
 
Lect01 Computers Impact on Our lives IOT and Big Data Era.pptx
Lect01 Computers Impact on Our lives  IOT and Big Data Era.pptxLect01 Computers Impact on Our lives  IOT and Big Data Era.pptx
Lect01 Computers Impact on Our lives IOT and Big Data Era.pptx
 
Lab 7 - Bash Script.pptx
Lab 7 - Bash Script.pptxLab 7 - Bash Script.pptx
Lab 7 - Bash Script.pptx
 
section5.pptx
section5.pptxsection5.pptx
section5.pptx
 
Introduction to computer.pptx
Introduction to computer.pptxIntroduction to computer.pptx
Introduction to computer.pptx
 
AOP sec3.pptx
AOP sec3.pptxAOP sec3.pptx
AOP sec3.pptx
 
Introduction to Spring sec2.pptx
Introduction to Spring sec2.pptxIntroduction to Spring sec2.pptx
Introduction to Spring sec2.pptx
 
Introduction to Spring sec1.pptx
Introduction to Spring sec1.pptxIntroduction to Spring sec1.pptx
Introduction to Spring sec1.pptx
 
QoS.pptx
QoS.pptxQoS.pptx
QoS.pptx
 
’mobile ip.pptx
’mobile ip.pptx’mobile ip.pptx
’mobile ip.pptx
 

Último

Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...Dr.Costas Sachpazis
 
Introduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptxIntroduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptxupamatechverse
 
Processing & Properties of Floor and Wall Tiles.pptx
Processing & Properties of Floor and Wall Tiles.pptxProcessing & Properties of Floor and Wall Tiles.pptx
Processing & Properties of Floor and Wall Tiles.pptxpranjaldaimarysona
 
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...ranjana rawat
 
Coefficient of Thermal Expansion and their Importance.pptx
Coefficient of Thermal Expansion and their Importance.pptxCoefficient of Thermal Expansion and their Importance.pptx
Coefficient of Thermal Expansion and their Importance.pptxAsutosh Ranjan
 
Call Girls in Nagpur Suman Call 7001035870 Meet With Nagpur Escorts
Call Girls in Nagpur Suman Call 7001035870 Meet With Nagpur EscortsCall Girls in Nagpur Suman Call 7001035870 Meet With Nagpur Escorts
Call Girls in Nagpur Suman Call 7001035870 Meet With Nagpur EscortsCall Girls in Nagpur High Profile
 
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service NashikCall Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service NashikCall Girls in Nagpur High Profile
 
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...ranjana rawat
 
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...Dr.Costas Sachpazis
 
Software Development Life Cycle By Team Orange (Dept. of Pharmacy)
Software Development Life Cycle By  Team Orange (Dept. of Pharmacy)Software Development Life Cycle By  Team Orange (Dept. of Pharmacy)
Software Development Life Cycle By Team Orange (Dept. of Pharmacy)Suman Mia
 
result management system report for college project
result management system report for college projectresult management system report for college project
result management system report for college projectTonystark477637
 
Booking open Available Pune Call Girls Koregaon Park 6297143586 Call Hot Ind...
Booking open Available Pune Call Girls Koregaon Park  6297143586 Call Hot Ind...Booking open Available Pune Call Girls Koregaon Park  6297143586 Call Hot Ind...
Booking open Available Pune Call Girls Koregaon Park 6297143586 Call Hot Ind...Call Girls in Nagpur High Profile
 
AKTU Computer Networks notes --- Unit 3.pdf
AKTU Computer Networks notes ---  Unit 3.pdfAKTU Computer Networks notes ---  Unit 3.pdf
AKTU Computer Networks notes --- Unit 3.pdfankushspencer015
 
Java Programming :Event Handling(Types of Events)
Java Programming :Event Handling(Types of Events)Java Programming :Event Handling(Types of Events)
Java Programming :Event Handling(Types of Events)simmis5
 
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...Christo Ananth
 
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...ranjana rawat
 
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...Call Girls in Nagpur High Profile
 
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINEMANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINESIVASHANKAR N
 
KubeKraft presentation @CloudNativeHooghly
KubeKraft presentation @CloudNativeHooghlyKubeKraft presentation @CloudNativeHooghly
KubeKraft presentation @CloudNativeHooghlysanyuktamishra911
 

Último (20)

Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
Sheet Pile Wall Design and Construction: A Practical Guide for Civil Engineer...
 
Introduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptxIntroduction to Multiple Access Protocol.pptx
Introduction to Multiple Access Protocol.pptx
 
Processing & Properties of Floor and Wall Tiles.pptx
Processing & Properties of Floor and Wall Tiles.pptxProcessing & Properties of Floor and Wall Tiles.pptx
Processing & Properties of Floor and Wall Tiles.pptx
 
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(ANJALI) Dange Chowk Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
 
Coefficient of Thermal Expansion and their Importance.pptx
Coefficient of Thermal Expansion and their Importance.pptxCoefficient of Thermal Expansion and their Importance.pptx
Coefficient of Thermal Expansion and their Importance.pptx
 
Call Girls in Nagpur Suman Call 7001035870 Meet With Nagpur Escorts
Call Girls in Nagpur Suman Call 7001035870 Meet With Nagpur EscortsCall Girls in Nagpur Suman Call 7001035870 Meet With Nagpur Escorts
Call Girls in Nagpur Suman Call 7001035870 Meet With Nagpur Escorts
 
Roadmap to Membership of RICS - Pathways and Routes
Roadmap to Membership of RICS - Pathways and RoutesRoadmap to Membership of RICS - Pathways and Routes
Roadmap to Membership of RICS - Pathways and Routes
 
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service NashikCall Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
Call Girls Service Nashik Vaishnavi 7001305949 Independent Escort Service Nashik
 
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
(SHREYA) Chakan Call Girls Just Call 7001035870 [ Cash on Delivery ] Pune Esc...
 
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
Structural Analysis and Design of Foundations: A Comprehensive Handbook for S...
 
Software Development Life Cycle By Team Orange (Dept. of Pharmacy)
Software Development Life Cycle By  Team Orange (Dept. of Pharmacy)Software Development Life Cycle By  Team Orange (Dept. of Pharmacy)
Software Development Life Cycle By Team Orange (Dept. of Pharmacy)
 
result management system report for college project
result management system report for college projectresult management system report for college project
result management system report for college project
 
Booking open Available Pune Call Girls Koregaon Park 6297143586 Call Hot Ind...
Booking open Available Pune Call Girls Koregaon Park  6297143586 Call Hot Ind...Booking open Available Pune Call Girls Koregaon Park  6297143586 Call Hot Ind...
Booking open Available Pune Call Girls Koregaon Park 6297143586 Call Hot Ind...
 
AKTU Computer Networks notes --- Unit 3.pdf
AKTU Computer Networks notes ---  Unit 3.pdfAKTU Computer Networks notes ---  Unit 3.pdf
AKTU Computer Networks notes --- Unit 3.pdf
 
Java Programming :Event Handling(Types of Events)
Java Programming :Event Handling(Types of Events)Java Programming :Event Handling(Types of Events)
Java Programming :Event Handling(Types of Events)
 
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
Call for Papers - Educational Administration: Theory and Practice, E-ISSN: 21...
 
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
(PRIYA) Rajgurunagar Call Girls Just Call 7001035870 [ Cash on Delivery ] Pun...
 
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...Top Rated  Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
Top Rated Pune Call Girls Budhwar Peth ⟟ 6297143586 ⟟ Call Me For Genuine Se...
 
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINEMANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
MANUFACTURING PROCESS-II UNIT-2 LATHE MACHINE
 
KubeKraft presentation @CloudNativeHooghly
KubeKraft presentation @CloudNativeHooghlyKubeKraft presentation @CloudNativeHooghly
KubeKraft presentation @CloudNativeHooghly
 

Problem set 3-solution.pptx

  • 1. Computer Networks (CIE 447) Problem set 3 – Chapter 4 Dr. / Samy Soliman T. A. :Eng. Menna Mohamed :Eng. Nourhan Tarek CIE 447- SPRING 2020
  • 2. IPv4 addresses IPv4 address is the logical address of a network device, which is composed of a 32-bits address. It is written as 4 octets, that are separated by a dot. Ex.: 172.16.254.1 Each octet in the IPv4 address has a value range from 0 to 255 , where each octet is a 4-bit long. CIE 447- SPRING 2020 2
  • 3. The subnet Class A Class A addresses were originally designed for networks with a very large number of hosts. The default subnet mask is 255.0.0.0 or /8. Some of this class addresses are reserved or invalid to be assigned to hosts. 0.0.0.1 to 0.255.255.255 are invalid host addresses. 127.0.0.1 to 127.255.255.255 are invalid host addresses, However, they are used for testing the local computer 127.0.0.1 is used for testing the TCP/IP. CIE 447- SPRING 2020 3
  • 4. The subnet Classes B & C Class B Class B addresses were originally designed for medium-sized to large-sized networks. The default subnet mask is 255.255.0.0 or /16. The range of valid addresses are from 128.0.0.0 to 191.255.0.0 / 16. Class C Class C addresses were designed for small networks. The default subnet mask is 255.255.255.0 or /24. The range of valid addresses are from 192.0.0.0 to 123.255.255.0 / 24. CIE 447- SPRING 2020 4
  • 5. The subnet Classes D & E Class D Class D addresses are reserved for multicasting IP addresses. The addresses are not assigned to hosts, which means there is no default subnet mask.  the range of valid addresses is from 224.0.0.0 to 239.255.255.255 Class E Class E addresses are experimental and reserved for future use. These addresses are not assigned to hosts and there is no default subnet mask. The valid range of addresses is from 240.0.0.0 to 255.255.255.255 CIE 447- SPRING 2020 5
  • 6. Classless Interdomain routing (CIDR) CIE 447- SPRING 2020 6 Class Size of network number bit field Size of rest bit field Start address End address Default subnet mask CIDR notation Class A (unicast) 8 24 0.0.0.0 127.255.255.2 55 255.0.0.0 /8 Class B (unicast) 16 16 128.0.0.0 191.255.255.2 55 255.255.0.0 /16 Class C (unicast) 24 8 192.0.0.0 223.255.255.2 55 255.255.255.0 /24 Class D (multicast) not defined not defined 224.0.0.0 239.255.255.2 55 not defined not defined Class E (reserved) not defined not defined 240.0.0.0 255.255.255.2 55 not defined not defined
  • 7. Classless Interdomain routing (CIDR) Classless Completely eliminates traditional concepts of Class A, B and C addresses. Network prefix based:  Routers do not make any assumption on the basis of the three leading bits. They require an explicit network prefix to determine dividing point between network_id (prefix) and host_id. CIE 447- SPRING 2020 7
  • 8. Classless Interdomain routing (CIDR) Example: Subnet 1: 213.2.96.0 → 11010101.00000010.01100000.00000000 Subnet 2: 213.2.97.0 → 11010101.00000010.01100001.00000000 Subnet 3: 213.2.98.0 → 11010101.00000010.01100010.00000000 Subnet 4: 213.2.99.0 → 11010101.00000010.01100011.00000000 Supernet mask: 255.255.252.0 Supernet address: 213.2.96.0/22 → 11010101 . 00000010 . 011000 00 . 00000000 CIE 447- SPRING 2020 8
  • 9. Longest prefix match Matching the longest prefix of an IP destination address to the entries in a routing table, to determine the appropriate outgoing link. Subnet 1’s IP addresses are from 213.2.96.0 → 11010101.00000010.01100000.00000000 to 213.2.96.23 → 11010101.00000010.01100000.00110111 The longest prefix match that is used in the forwarding table of the router is: 11010101.00000010.01100000.00 Subnet 2’s IP addresses are from 213.2.97.0 → 11010101.00000010.01100001.00000000 to 213.2.97.226 → 11010101.00000010.01100001.11100010 The longest prefix match that is used in the forwarding table of the router is: 11010101.00000010.01100001 CIE 447- SPRING 2020 9
  • 10. Problem 4  Consider the network below. a. Suppose that this network is a datagram network. Show the forwarding table in router A, such that all traffic destined to host H3 is forwarded through interface 3. CIE 447- SPRING 2020 10
  • 11. Problem 4  Consider the network below. a. Suppose that this network is a datagram network. Show the forwarding table in router A, such that all traffic destined to host H3 is forwarded through interface 3. Solution: CIE 447- SPRING 2020 11 Destination address Interface link H3 3
  • 12. Problem 4  Consider the network below. b. Suppose that this network is a datagram network. Can you write down a forwarding table in router A, such that all traffic from H1 destined to host H3 is forwarded through interface 3, while all traffic from H2 destined to host H3 is forwarded through interface 4? (Hint: this is a trick question.) CIE 447- SPRING 2020 12
  • 13. Problem 4  Consider the network below. b. Suppose that this network is a datagram network. Can you write down a forwarding table in router A, such that all traffic from H1 destined to host H3 is forwarded through interface 3, while all traffic from H2 destined to host H3 is forwarded through interface 4? (Hint: this is a trick question.) Solution: No, because the forwarding table is based on the destination address, not the source address CIE 447- SPRING 2020 13 Destination address Interface link H3 3 H3 4
  • 14. Problem 4  Consider the network below. c. Now suppose that this network is a virtual circuit network and that there is one ongoing call between H1 and H3, and another ongoing call between H2 and H3. Write down a forwarding table in router A, such that all traffic from H1 destined to host H3 is forwarded through interface 3, while all traffic from H2 destined to host H3 is forwarded through interface 4. CIE 447- SPRING 2020 14
  • 15. Problem 4  Consider the network below. c. Now suppose that this network is a virtual circuit network and that there is one ongoing call between H1 and H3, and another ongoing call between H2 and H3. Write down a forwarding table in router A, such that all traffic from H1 destined to host H3 is forwarded through interface 3, while all traffic from H2 destined to host H3 is forwarded through interface 4. Solution: the forwarding table at router A CIE 447- SPRING 2020 15 14 24 Incoming interface Incoming VC Outgoing interface Outgoing VC 1 11 3 12 2 21 4 22
  • 16. Problem 4  Consider the network below. d. Assuming the same scenario as (c), write down the forwarding tables in nodes B, C, and D. CIE 447- SPRING 2020 16
  • 17. 14 24 Problem 4  Consider the network below. d. Assuming the same scenario as (c), write down the forwarding tables in nodes B, C, and D. Solution: The forwarding table at router B: The forwarding table at router C: CIE 447- SPRING 2020 17 Incoming interface Incoming VC Outgoing interface Outgoing VC 1 12 2 13 Incoming interface Incoming VC Outgoing interface Outgoing VC 1 22 2 23 The forwarding table at router D: Incoming interface Incoming VC Outgoing interface Outgoing VC 1 13 3 14 2 23 3 24
  • 18. Problem 5(*) Consider a VC network with a 2-bit field for the VC number. Suppose that the network wants to set up a virtual circuit over four links: link A, link B, link C, and link D. Suppose that each of these links is currently carrying two other virtual circuits, and the VC numbers of these other VCs are as follows: CIE 447- SPRING 2020 18 In answering the following questions, keep in mind that each of the existing VCs may only be traversing one of the four links. a. If each VC is required to use the same VC number on all links along its path, what VC number could be assigned to the new VC?
  • 19. Problem 5(*) Consider a VC network with a 2-bit field for the VC number. Suppose that the network wants to set up a virtual circuit over four links: link A, link B, link C, and link D. Suppose that each of these links is currently carrying two other virtual circuits, and the VC numbers of these other VCs are as follows: CIE 447- SPRING 2020 19 In answering the following questions, keep in mind that each of the existing VCs may only be traversing one of the four links. a. If each VC is required to use the same VC number on all links along its path, what VC number could be assigned to the new VC? Solution: A new VC can’t be established, as the VC number is 2 bits. ∴ The max. number of links that could be established 22 = 4 links
  • 20. Problem 5(*) Consider a VC network with a 2-bit field for the VC number. Suppose that the network wants to set up a virtual circuit over four links: link A, link B, link C, and link D. CIE 447- SPRING 2020 20 b. If each VC is permitted to have different VC numbers in the different links along its path (so that forwarding tables must perform VC number translation), how many different combinations of four VC numbers (one for each of the four links) could be used?
  • 21. Problem 5(*) Consider a VC network with a 2-bit field for the VC number. Suppose that the network wants to set up a virtual circuit over four links: link A, link B, link C, and link D. CIE 447- SPRING 2020 21 b. If each VC is permitted to have different VC numbers in the different links along its path (so that forwarding tables must perform VC number translation), how many different combinations of four VC numbers (one for each of the four links) could be used? Solution: The number of link = 4 and each link has 2 VC numbers ∴ The total combinations of the 4 VC links = 24 = 16 combination (10, 00, 00, 10) or (00, 10, 00, 10)
  • 22. Problem 10 Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows: a. Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces. CIE 447- SPRING 2020 22 Destination Address Range Link Interface 11100000 00000000 00000000 00000000 Through 11100000 00111111 11111111 11111111 0 11100000 01000000 00000000 00000000 Through 11100000 01000000 11111111 11111111 1 11100000 01000001 00000000 00000000 Through 11100001 01111111 11111111 11111111 2 Otherwise 3
  • 23. Problem 10 Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows: a. Provide a forwarding table that has five entries, uses longest prefix matching, and forwards packets to the correct link interfaces. Solution: CIE 447- SPRING 2020 23 Destination Address Range Link Interface 11100000 00000000 00000000 00000000 Through 11100000 00111111 11111111 11111111 0 11100000 01000000 00000000 00000000 Through 11100000 01000000 11111111 11111111 1 11100000 01000001 00000000 00000000 Through 11100001 01111111 11111111 11111111 2 Otherwise 3 Entry no. Prefix match Link interface 1 11100000 00 0 2 11100000 01000000 1 3 1110000 2 4 11100001 1 3 5 Otherwise 3
  • 24. Problem 10 Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows: b. Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses: 11001000 10010001 01010001 01010101 11100001 01000000 11000011 00111100 11100001 10000000 00010001 01110111 CIE 447- SPRING 2020 24
  • 25. Problem 10 Consider a datagram network using 32-bit host addresses. Suppose a router has four links, numbered 0 through 3, and packets are to be forwarded to the link interfaces as follows: b. Describe how your forwarding table determines the appropriate link interface for datagrams with destination addresses: CIE 447- SPRING 2020 25 Entry no. Prefix match Link interface 1 11100000 00 0 2 11100000 01000000 1 3 1110000 2 4 11100001 1 3 5 Otherwise 3 Solution: 11001000 10010001 01010001 01010101 → it matches 5𝑡ℎ entry: otherwise, it will be forwarded to link 3 11100001 01000000 11000011 00111100 → it matches 3𝑡ℎ entry, it will be forwarded to link 2 11100001 10000000 00010001 01110111 → it matches 4𝑡ℎ entry, it will be forwarded to link 3
  • 26. Problem 11 Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table: For each of the four interfaces, give the associated range of destination host addresses and the number of addresses in the range. CIE 447- SPRING 2020 26
  • 27. Problem 11 Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table: For each of the four interfaces, give the associated range of destination host addresses and the number of addresses in the range. Solution: CIE 447- SPRING 2020 27 Destination Address Range Link Interface No. of addresses in a link 00000000 Through 00111111 0 26 = 64 01000000 Through 01011111 1 25 = 32 01100000 Through 01111111 2 25 + 26 = 32 + 64 = 96 10000000 Through 10111111 2 11000000 Through 11111111 3 26 = 64
  • 28. Problem 12(*) Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table: For each of the four interfaces, give the associated range of destination host addresses and the number of addresses in the range. CIE 447- SPRING 2020 28
  • 29. Problem 12(*) Consider a datagram network using 8-bit host addresses. Suppose a router uses longest prefix matching and has the following forwarding table: For each of the four interfaces, give the associated range of destination host addresses and the number of addresses in the range. Solution: CIE 447- SPRING 2020 29 Destination Address Range Link Interface No. of addresses in a link 10000000 Through 11111111 0 27 = 128 10000000 Through 10111111 1 26 = 64 11100000 Through 11111111 2 25 =32 00000000 Through 01111111 3 27 = 128
  • 30. Problem 13 Consider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3. Suppose all of the interfaces in each of these three subnets are required to have the prefix 223.1.17/24. Also suppose that Subnet 1 is required to support at least 60 interfaces, Subnet 2 is to support at least 90 interfaces, and Subnet 3 is to support at least 12 interfaces. Provide three network addresses (of the form a.b.c.d/x) that satisfy these constraints. CIE 447- SPRING 2020 30
  • 31. Problem 13 Consider a router that interconnects three subnets: Subnet 1, Subnet 2, and Subnet 3. Suppose all of the interfaces in each of these three subnets are required to have the prefix 223.1.17/24. Also suppose that Subnet 1 is required to support at least 60 interfaces, Subnet 2 is to support at least 90 interfaces, and Subnet 3 is to support at least 12 interfaces. Solution: The total no. of addresses = 28 = 256 and by mapping the CIDR into binary address The IP address: 223.1.17.0 → network address, can’t be used as an interface and the IP address: 223.1.17.225 → broadcast address For subnet 1: it needs 60 interfaces +2 (network and broadcast) = 26 = 64 ∴ The subnet 1 address: 223.1.17.0/25 For subnet 2: it needs 90 interfaces +2 (network and broadcast) = 27 = 128 ∴ The subnet 2 address: 223.1.17.64/24 For subnet 3: it needs 12 interfaces +2 (network and broadcast) = 24 = 16 ∴ The subnet 3 address: 223.1.17.192/28 CIE 447- SPRING 2020 31 223 1 17 x 11011111 00000001 00010001 xxxxxxxx
  • 32. Problem 17 Consider the topology shown in Figure 4.17. Denote the three subnets with hosts (starting clockwise at 12:00) as Networks A, B, and C. Denote the subnets without hosts as Networks D, E, and F. a. Assign network addresses to each of these six subnets, with the following constraints: All addresses must be allocated from 214.97.254/23; Subnet A should have enough addresses to support 250 interfaces; Subnet B should have enough addresses to support 120 interfaces; Subnet C should have enough addresses to support 120 interfaces. subnets D, E and F should each be able to support two interfaces. CIE 447- SPRING 2020 32
  • 33. Problem 17 Consider the topology shown in Figure 4.17. Denote the three subnets with hosts (starting clockwise at 12:00) as Networks A, B, and C. Denote the subnets without hosts as Networks D, E, and F. a. Assign network addresses to each of these six subnets, with the following constraints: All addresses must be allocated from 214.97.254/23; ∴ The total no. of available addresses = 29 = 512 CIE 447- SPRING 2020 33 214 97 254 x 11010110 01100001 11111110 xxxxxxxx
  • 34. Problem 17 a. Assign network addresses to each of these six subnets, with the following constraints: Subnet A should have enough addresses to support 250 interfaces; ∴ it needs 250 interfaces +2 (network and broadcast) = 28 = 256 Subnet B should have enough addresses to support 120 interfaces; ∴ it needs 120 interfaces +2 (network and broadcast) = 27 = 128 Subnet C should have enough addresses to support 120 interfaces. ∴ it needs 120 interfaces +2 (network and broadcast) = 27 = 128 subnets D, E and F should each be able to support two interfaces. ∴ Each needs 2 interfaces = 22 = 4 ∴ The total no. of the designed addresses = 516, which exceeds the available number of addresses Sol. : Deduct a number of addresses from one of the subnets → Subnet B CIE 447- SPRING 2020 34
  • 35. Problem 17 a. Assign network addresses to each of these six subnets, with the following constraints: Subnet A should have enough addresses to support 250 interfaces; ∴ it needs 250 interfaces +2 (network and broadcast) = 28 = 256 The range of addresses are 214.97.255.00000000 → 214.97.255. 00000001 The range of addresses are 214.97.255.0 → 214.97.255.254 Subnet A’s network address: 214.97.255/24 Subnet B should have enough addresses to support 120 interfaces; ∴ it needs 120 interfaces +2 (network and broadcast) = 27 = 128 Only 120 addresses will be used. ∴ a set of IP addresses will be deducted. The range of addresses are 214.97.254.00000000 → 214.97.255. 01111111 ∵ The required no. of addresses to be deducted = 8 ∴ The deducted range of addresses: 214.97.254.00000000 → 214.97.254.00000111 CIE 447- SPRING 2020 35 ∴ Subnet B’s network address : 214.97.254.0/25 - 214.97.254.0/29
  • 36. Problem 17 a. Assign network addresses to each of these six subnets, with the following constraints: Subnet C should have enough addresses to support 120 interfaces. ∴ it needs 120 interfaces +2 (network and broadcast) = 27 = 128 The range of addresses are 214.97.254.10000000 → 214.97.254. 11110111 The range of addresses are 214.97.254.128 → 214.97.254.247 Subnet C’s network address: 214.97.254.128/25 subnets D, E and F should each be able to support two interfaces. Subnet D has 2 addresses : 214.97.254.0/31 Subnet E has 2 addresses : 214.97.254.2/31 Subnet F has 4 addresses : 214.97.254.4/30 CIE 447- SPRING 2020 36
  • 37. Problem 17 CIE 447- SPRING 2020 37
  • 38. Problem 17 Consider the topology shown in Figure 4.17. Denote the three subnets with hosts (starting clockwise at 12:00) as Networks A, B, and C. Denote the subnets without hosts as Networks D, E, and F. b. Using your answer to part (a), provide the forwarding tables (using longest prefix matching) for each of the three routers. Router 1: CIE 447- SPRING 2020 38 Longest prefix match Link interface 11010110 01100001 11111111 A 11010110 01100001 11111110 0000000 D 11010110 01100001 11111110 000001 F
  • 39. Problem 17 Consider the topology shown in Figure 4.17. Denote the three subnets with hosts (starting clockwise at 12:00) as Networks A, B, and C. Denote the subnets without hosts as Networks D, E, and F. b. Using your answer to part (a), provide the forwarding tables (using longest prefix matching) for each of the three routers. Router 2: CIE 447- SPRING 2020 39 Longest prefix match Link interface 11010110 01100001 11111110 1 C 11010110 01100001 11111110 0000001 E 11010110 01100001 11111110 000001 F
  • 40. Problem 17 Consider the topology shown in Figure 4.17. Denote the three subnets with hosts (starting clockwise at 12:00) as Networks A, B, and C. Denote the subnets without hosts as Networks D, E, and F. b. Using your answer to part (a), provide the forwarding tables (using longest prefix matching) for each of the three routers. Router 3: CIE 447- SPRING 2020 40 Longest prefix match Link interface 11010110 01100001 11111110 0 B 11010110 01100001 11111110 0000000 D 11010110 01100001 11111110 0000001 E
  • 41. Homework Solve problems 14, 15 and 16. Due date: 5/4/2020 CIE 447- SPRING 2020 41