NWC203c_PE2_01

Q.
1:
a)
Size text file = 1 x 1024 x 1024 x 8 (bit)
Speed = 32 x 1000 (bit / second)
=> T (32k) = (1 x 1024 x 1024 x 8) / (32 x 1000) = 262.144 (seconds)
b)
Size text file = 1 x 1024 x 1024 x 8 (bit)
Speed = 1 x 1000 x 1000 (bit / second)
=> T (1M) = (1 x 1024 x 1024 x 8) / (1 x 1000 x 1000) = 8.38 (seconds)
c)
If data compression is applied to the text file, the transmission times in parts (a) and
(b) will change depending on the level of compression achieved. Data compression
reduces the size of the file, which means that fewer bits need to be transmitted over
the network. The amount of compression achieved depends on the type of
compression algorithm used and the characteristics of the file being compressed.
Generally, higher levels of compression can lead to larger reductions in file size,
resulting in shorter transmission times. However, achieving higher levels of
compression may require more processing time and computational resources, which
can increase the time required for compression.
In general, if data compression results in a reduction in file size, the transmission
time for downloading the file will decrease proportionally. For example, if the file
size is reduced to half its original size due to compression, the transmission time will
also be halved.
However, it is important to note that the effectiveness of data compression depends
on the type of data being compressed. Some types of data, such as already
compressed files like JPEG or MP3 files, may not be able to be compressed much
further, if at all. In such cases, data compression may have little effect on
transmission times.
Ex: If we assume a maximum compression ratio of 1:6, then we have the following times
for the 32 kilobit and 1 megabit lines respectively
=> T (32k) = (1 x 1024 x 1024 x 8) / (32 x 1000 x 6) = 43.69 (seconds)
=> T (1M) = (1 x 1024 x 1024 x 8) / (1 x 1000 x 1000 x 6) = 1.4 (seconds)
Q2:
R = 1.5 Mbps or R = 1,5 x 106 bps , and nf =250 bytes or 2000 bits (250 x 8).
The distance that the information must travel is the earth-to-satellite distance, or
D 36,000 7km
= 3,6 x 10 m .
The speed of light c is 3 x 108 . We can calculate the propagation delay and processing
rate as follows:
7
D 3 ,6 × 10
t ¿= = 8
=0 , 12 s=120 ms
c 3× 10
nf 2000
tf = = =0,00133 s=1 ,33 ms
R 1 ,5 ×10 6
We can use either Go-Back-N or Selective Repeat ARQ. The default window size is N =
7 (with a 3- bit sequence number).
The maximum information rate is achieved with no error, and hence, no retransmission.
t cycle= minimum time to transmit a group of N packets
= t f + 2 t ¿ = 1.33 + 2 x 120 = 241.33 ms

In which, t cycleis the minimum time to transmit a group of N packets.
n = no. of bits transmitted in a cycle = N. n f = 7 x 2000 = 14000 bits

Rmax = no. of bits sent in a cycle / minimum cycle time = n / t cycle= 58 kbps
In which, n is number of bits transmitted in a cycle, Rmax is number of bits sent in a cycle /
minimum cycle time.
If the extended sequence numbering option (7-bit) is used, the maximum send window
size would be N = 27– 1 = 127, and hence, the maximum information rate is:
n=N × n f =127 × 2000=254000 bits
n 254000
Rmax = = =1052 , 5 kbps=1,0525 Mbps
t cycle 241 , 33
Q3:
a/Message size is important because in real-time signals of voice it is necessary to

transfer a fixed packet size of that holds no more than 20 ms of the speech signal. The
handling of arbitrary message size is not as important as long as the desired packet size
for voice can be handled.
Sequencing is essential because each packet needs to arrive in the same sequence that it
was generated. Reliability is moderately important since voice transmission can tolerate a
certain level of loss and error.
Pacing and flow control are not as important because the synchronous nature of the voice
signal implies that the end systems will be matched in speed.
Timing, for real-time voice transfer, is important because this adaptation function helps to
control the jitter in the delivered signal.
Addressing is only during the connection setup phase if we assume some form of virtual
circuit packet switching method.
Privacy, integrity, and authentication have traditionally not been as important as the other
issues discussed above.
b/If the underlying network is reliable then the end-to-end approach is better because the
probability of error is very low so processing at the edge suffices to provide acceptable
performance.
If the underlying network is unreliable then the hop-by-hop approach may be required.
For example, if the probability of error is very high, as in a wireless channel, then error
recovery at each hop may be necessary to make effective communication possible.
Q4:
Find
Number of Subnet Bits 6
Number of Subnets Created 64
Number of Host Bits per Subnet 2
Number of Hosts per Subnet 2
Network Address of this Subnet 192.168.1.244
Ipv4 Address of First Host on this Subnet 192.168.1.245
Ipv4 Address of Last Host on this Subnet 192.168.1.246
Ipv4 Broadcast Address on this Subnet 195.168.1.247
Q5:
a. How many host addresses are needed in the largest required subnet?
Soln: 50
b. What is the minimum number of subnets required?

Soln : According to the question , two subnet are required for LAN-A and LAN-B and
two subnets are needed to be left for future use Therefor the total number of subnets are 4
.
c. The network that you are tasked to subnet is 192.168.12.0/24. What is the /24 subnet
mask in binary?
Soln : 24 is prefix length.

In binary, it is: 11111111.11111111.11111111.00000000
There are 24 bits 1. It means that the address left 24 first bits for network portion
d. The subnet mask is made up of two portions, the network portion, and the host
portion. This is represented in the binary by the ones and the zeros in the subnet mask. In
the network mask, what do the ones and zeros represent?
Soln : In the nerwork mask, the ones represent the network portion and the zeroes
represent the host portion.
e. When you have determined which subnet mask meets all of the stated network
requirements, derive each of the subnets. List the subnets from first to last in the table.
Remember that the first subnet is 192.168.12.0 with the chosen subnet mask.
Subnet Address Prefix Subnet Mask
192.168.12.0 /26 255.255.255.192
192.168.12.64 /26 255.255.255.192
192.168.12.128 /26 255.255.255.192
192.168.12.192 /26 255.255.255.192

NWC203c_PE2_01

Uploaded by

Copyright:

Available Formats

NWC203c_PE2_01

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

NWC203c_PE2_01

Uploaded by

Copyright:

Available Formats

Q.

= t f + 2 t ¿ = 1.33 + 2 x 120 = 241.33 ms

n = no. of bits transmitted in a cycle = N. n f = 7 x 2000 = 14000 bits

a/Message size is important because in real-time signals of voice it is necessary to

b. What is the minimum number of subnets required?

Soln : 24 is prefix length.

Subnet Address Prefix Subnet Mask

192.168.12.0 /26 255.255.255.192

192.168.12.64 /26 255.255.255.192

192.168.12.128 /26 255.255.255.192

192.168.12.192 /26 255.255.255.192

You might also like