Bahir Dar University

Institute Of Technology

Faculty Of Computing

MSc Program in Computer Science

Advanced Computer Networking Assignment I

Prepared By: Rahel Alemeneh

ID No: BDU1101125

Submitted to: Mekuanint A.

(Ph.D.)

7/11/22

AddisAbeba
 1. Explain why a minimum frame size is required for Ethernet. For example, 10Base
Ethernet imposes a minimum frame size constraint of 64 bytes.
Answer
Because
 Frames must be at least 64 bytes long, not including the preamble, so, if the data field is
shorter than 46 bytes, it must be compensated by the Pad field. The reason for specifying
a minimum length lies with the collision-detect mechanism. In CSMA/CD a station must
never be allowed to believe it has transmitted a frame successfully if that frame has, in
fact, experienced a collision.
 In the worst case, it takes twice the maximum propagation delay across the network
before a station can be sure that a transmission has been successful.
 802.3 FRAME has:
Ethernet Header = 18 Bytes [Dst Mac(6) + Src Mac(6) + Length (2) +CRC(4)]
Minimum Data Portion = 46 Bytes
Minimum Ethernet Frame Size = 64
Bytes
 Fast Ethernet operates at 100Mbps. For the most part, the scheme/protocol remains the
same as the 10Mbps case, except now the maximum length of the network is shortened.
 Minimum frame size is still kept at 64 bytes (for backward compatibility), which now
arrive 10 times faster than they do in 10Mbps Ethernet.
 Hence the maximum length of the network must be 10 times smaller or about around 250
meters.

2. Explain the difference between 3G and 4G in detail

Answer

 The difference between 3G and 4G

They are both mobile data connections, but 3G is an older technology that usually delivers
slower speeds. 4G is a newer technology that has the capacity to deliver faster speeds. 4G can
reach speeds of up to 50Mbps – 10 times faster than most 3G connections. 3G is available in
more places — you will tend to find the best 4G coverage in densely populated areas, but in rural
locations 3G is still mostly used. 4G networks can only be used with newer 4G compatible
mobile phones — older models may only be compatible with 3G networks. The difference in
speeds is even more noticeable in larger files — if you’re downloading movies, you may notice a
big difference.
 4G is vastly superior to 3G in most situations. There are only two real possible downsides to
using 4G:

 It drains more of your battery than 3G does

 You may use more data due to the higher speeds,

3G vs 4G Technology

3G 4G
Introduction  3G, the 3rd generation of wireless 4G is the 4th generation of
mobile telecommunications tech, broadband cellular network
offers faster internet speed than 2G technology, succeeding 3G. A 4G
and 2.5G GPRS networks. 3G system must provide capabilities
networks comply with the IMT- defined by ITU in IMT Advanced.
2000 specifications; uses include 4G applications include mobile web
voice telephony, mobile TV, video access, IP telephony, gaming,
calls and web access. HDTV and video conferencing.
Data Throughput Up to 3.1Mbps with an average Practically speaking, 2 to 12 Mbps
speed range between 0.5 to 1.5 (Telstra in Australia claims up to 40
Mbps Mbps) but potential estimated at a
range of 100 to 300 Mbps.
Peak Upload Rate 5 Mbps 500 Mbps
Switching Technique packet switching packet switching, message
switching
Peak Download Rate 100 Mbps 1Gbps
Network Architecture Wide Area Cell-Based Integration of wireless area. Hybrid
cell-based
Frequency Band 1.8 – 2.5 GHz 2 – 8 GHz

Services And Applications CDMA 2000, UMTS, EDGE etc. Wimax2 and LTE-Advance

Forward error correction 3G uses Turbo codes for error Concatenated codes are used for
(FEC) correction. error corrections in 4G.
Handoff management done vertically in 3G 4G it’s done vertically as well as
The transfer of horizontally.
a cellular phone transmission
from one radio
frequency within a cell to
another radio frequency in an
adjacent cell.

Limitations of 3G and 4G network

Limitations of 3G

 The cost of cellular infrastructure, and upgrading base stations is very high.
 Roaming and data/voice work collectively have not yet been implemented.
 Power utilization is high and needs short-distance base stations and are expensive.

Limitations of 4G

 Limited voice calls and services can be handled any time.

 Being a concentrated data service, it requires broad bandwidth
 It doesn’t provide good services in rural areas due to the requirement of the wireless
network and 4G network isn’t expanded well in those areas.

3. Consider a router that interconnects three subnets: Subnet I, 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 I is required to support up to 63 interfaces, Subnet
2 is to support up to 95 interfaces, and Subnet 3 is to support up to 16 interfaces. Provide
three network addresses (of the form a.b.c .dJx) that satisfy these constraints.
Answer
 According to the Variable Length Subnet Masking (VLSM) Principle that each subnet
should be sorted in decreasing order of the number of supported interfaces before
subnetting is performed and each subnet is required to support different interfaces.
Therefore, we have to first sort subnets in descending order of the number of supported
interfaces as below.
No Subnets Number of supported
Interfaces
1 Subnet 2 Up to 95
2 Subnet 1 Up to 63
3 Subnet 3 Up to 16

1. Subnet 2(95 interfaces)

The number of hosts per a given subnet is calculated as 2 n-2 where 'n' is the number of host bits
and subtracted 2 from the total number of available IP addresses because 2 IP addresses are
reserved for the network and broadcast addresses.
so, 2n-2 ≤ 95, Considering "Up to" means a maximum of 95.

2n≤97, so n =6 because when n becomes 7, 128≤97, which is False

The number of bits allocated to the host part = n = 6, which means a maximum of 64 host
address is embraced in each subnet.

Number of bits allocated to network part = Prefix length = 32 -n = 32 -6 = 26

To determine the Network Address, we can use the “AND” operation between IP Address and
Subnet Mask in binary mode. AND is simply Multiplication. so, we have 26 bits of subnet mask.

subnet mask= 11111111.11111111.11111111.11000000

The last five bits are the host bits.

 The network address of the first subnet is always the address of the given address space
because when we apply the "AND" operation between the first subnet and the subnet
mask we get, we acquire the following.

11011111.00000001.00010001.00000000
AND =11011111.00000001.00010001.00000000
11111111.11111111.11111111.11000000

11011111.00000001.00010001.00000000=223.1.17.0

So, Network address of first subnet = 223.1.17.0/26 = 223.1.17/26

To obtain the broadcast address of a subnet, we can take "OR" operation between the network
address and invert of subnet mask. So,

Network address = 11011111.00000001.00010001.00000000

Invert of subnet mask=00000000.00000000.00000000.00111111

Then when we apply "OR" operation, we get 11011111.00000001.00010001.00111111

which is equivalent to 223.1.17.63

Broadcast address of first subnet = 223.1.17. 00111111/26 = 223.1.17.63/26

2. Subnet 1(63 interfaces)

NB: The number of hosts per a given subnet is calculated as 2 n-2 where 'n' is the number of host
bits and subtracted 2 from the total number of available IP addresses because 2 IP addresses are
reserved for the network and broadcast addresses.
so, 2n-2 ≤ 63, Considering "Up to" means a maximum of 63.

2n≤65, so n =6 because when n become 7, 128≤65, which is False

Number of bits allocated to host part = n = 6

Number of bits allocated to network part = Prefix length = 32 -n = 32 -6 = 26

 The network address of any subnet (that is NOT the first subnet) is obtained by adding
one to the broadcast address of its preceding subnet.

Network address of second subnet= broadcast address of its preceding subnet+1.

Network address of second subnet=63+1=64

The network address of second subnet = 223.1.17.64/26

The broadcast address of the second subnet = "Network address of second subnet "OR "Inverse
of subnet mask".

The broadcast address of the second subnet =11011111.00000001.00010001.01000000 OR

00000000.00000000.00000000.00111111

The broadcast address of second subnet= 11011111.00000001.00010001.01111111

Broadcast address of second subnet=223.1.17. 01111111/26 =223.1.17.127/26

3. Subnet 3(16 interfaces)

The number of hosts per a given subnet is calculated as 2 n-2 where 'n' is the number of host bits
and subtracted 2 from the total number of available IP addresses because 2 IP addresses are
reserved for the network and broadcast addresses.

so, 2n-2 ≤ 16, Considering "Up to" means a maximum of 16.

2n≤18, so n =4 because when n become 5 , 32≤18 , which is False

Number of bits allocated to host part = n = 4

Number of bits allocated to network part = Prefix length = 32 -n = 32 -4 = 28

 The network address of any subnet (that is NOT the first subnet) is obtained by adding
one to the broadcast address of its preceding subnet.

Network address of third subnet= broadcast address of its preceding subnet+1.

Network address of third subnet=127+1=128

Network address of third subnet= 223.1.17.128/28

Subnet mask=11111111.11111111.11111111.11110000

Invert of subnet mask=00000000.00000000.00000000.00001111

Broadcast address of second subnet = "Network address of second subnet "OR "Inverse of subnet
mask".

Broadcast address of second subnet =11011111.00000001.00010001.01000000 OR

00000000.00000000.00000000.00001111

11011111.00000001.000010001.01001111 =223.1.17.79/24

4. Define and contrast the following terms: subnet, prefix, and BGP Rout

Answer:

Subnet:

 A subnet is defined as a sub-portion of a larger network; which does not contain a router.
 A subnet is a logical subdivision of an IP network done by a process called subnetting.
 its boundaries are defined by the router and host interfaces.
Prefix
 A prefix is the network portion of a CIDR address (Classless Inter-Domain Routing).
 CIDR generalizes the notation of subnet addressing.
 The General notation for the CIDR class to represent the IP address is a.b.c.d/x.
 The x most significant bit of the addresses a.b.c.d/x consist of the network portion of the IP
address and is referred to as a prefix.
 A prefix covers one or more subnets.

BGP Route

 The BGP message along with the TCP connection sent over a link is called as BGP session.
 When a router advertises a prefix across a BGP session, it includes with the prefix a number of
BGP attributes. In BGP jargon, a prefix along with its attributes is a BGP route (or simply a
route).
 5. Consider the network shown below, and assume that each node initially knows the costs
to each of its neighbors. Consider the distance-vector algorithm and show the distance
table entries at node D.

Answer

Distance Vector Routing is a dynamic routing algorithm. It works in the following steps-
Step-01:
Each router prepares its routing table. By their local knowledge. each router knows about-

 All the routers present in the network

 Distance to its neighboring routers
 Each router exchanges its distance vector with its neighboring routers.
 Each router prepares a new routing table using the distance vectors it has obtained from its
neighbors. But the question says to show the distance table entries at node D.
 Routing tables are prepared to total (n-1) times if there are n routers in the given network.
 After this, routing tables converge/become stable.
 Next Hop is an intermediate node or router which allows for identifying unused links.
Each router prepares its routing table using its local knowledge. The routing table prepared by
router "D" is shown below- Initial State

Info At Distance to Node

Node

A B C D E

A 0 7 ∞ ∞ 1

B 7 0 1 ∞ 8

C ∞ 1 0 2 ∞
 D ∞ ∞ 2 0 2

E 1 8 ∞ 2 0

D sends to vector E

Info At Node Distance to Node

A B C D E

A 0 7 ∞ ∞ 1

B 7 0 1 ∞ 8

C ∞ 1 0 2 ∞

D ∞ ∞ 2 0 2

E 1 8 4 2 0

E to C
E-D-C=4, E-B-C=9, E-A-B-
C=9 so the minimum cost is 4
B sends Vector to A

Info At Node Distance to Node

A B C D E

A 0 7 8 ∞ 1

B 7 0 1 ∞ 8

C ∞ 1 0 2 ∞

D ∞ ∞ 2 0 2

E 1 8 4 2 0

A to C A-B-C=8, A-E-D-C=5, A-E-B-C=10 So 8<∞

E sends Vector to A

Info At Node Distance to Node

A B C D E

A 0 7 5 3 1

B 7 0 1 ∞ 8

C ∞ 1 0 2 ∞

D ∞ ∞ 2 0 2

E 1 8 4 2 0

A to C A-B-C=8, A-E-D-C=5, A-E-B-C=10 So 5<8 A to D A-E-D=3, A-B-C-

D=9, A-E-B-C-D =12

It continues to find the minimum cost in every Node until it Converge

Info At Node Distance to Node

A B C D E

A 0 6 5 3 1

B 6 0 1 3 5

C 5 1 0 2 4

D 3 3 2 0 2

E 1 5 4 2 0

Node B’s distance Vectors

Destination
A E C
A 7 9 6
 C 12 12 1
D 10 10 3
E 8 8 5

To handle Link Failure

A marks distance to E as  and tells B, E marks distance to A as  and tells B and D, B and D
recompute routes and tell C, E, until converge

Info At Node Distance to Node

A B C D E

A 0 7 8 10 12

B 7 0 1 3 5

C 8 1 0 2 4

D 10 3 2 0 2

E 12 5 4 2 0