BIT 204 Computer Systems and Networks

2016
TASK1
25MB

= 25 x 1024 x 1024 x 8
= 209,715,200bits

Transmit

= Size / Bandwidth
= 209,715,200 / 15 x 10 6
= 13.981seconds

Queue

= 1 x RTT
= 1 x 120ms
= 120ms(0.12)seconds

Initial
Queue

= 2 x RTT
= 2 x 120ms
= 240/1000
= 0.24seconds

Propagati
on

= Distance(RTT) / 2
= 0.12s / 2
= 0.06 seconds

(a)
Let N

= Time required to transfer

= Initial queue + Transmit +

Propagation
= 0.240 + 13.981 + 0.06 seconds
= 14.281seconds

No.
packets
required

= 25MB/1KB

(b)

= 25,600KB
# to get no of packet for RTT
25MB / 1KB
(25 * 1024) / 1
25600/1
Inbetween
RTTs

= (Required packet -1) x RTT

= (25,599 x 0.120)
= 3071.88
Let X

= New time required to transfer

= N + (Required packet-1 x RTT)

= 14.281 + 3071.88
= 3086.16 seconds

Semester 1

BIT 204 Computer Systems and Networks

2016
(c)
Total
batches
to send

Semester 1

= total packet to send / max packet

per RTT
= 25,600 / 25
= 1024 batches

# total RTT required

1 RTT can transfer 1 batch, thus 1024 batch = 1024 RTT
However, for the last 25 packet only need (RTT/2), so the total RTTs required are
1023.5 * RTT (0.12)
Let Y

= Another new time required to

transfer

= Initial queue + required RTT

+ propagation
= 0.24 + 1023.5 * 0.12 + 0.06
= 123.06seconds

50 km

= 50 x 1000
= 50,000m

150 bytes

= 150 x 8
= 1,200 bits

Propagati
on delay

= Length / Speed
= 50,000m / (2 x 108 m/sec)
= 0.00025seconds or 250s(micro
second)

Transmit
delay for
150-byte

= Packet size / propagation delay

= 1,200bits / 0.00025 seconds

= 4,800,000 bps or 4.8mbps

512 bytes

= 512 x 8
= 4,096 bits

Transmit
delay for
512-byte

= Packet size / propagation delay

= 4,096 bits / 0.00025 seconds

= 16,384,000 bps or 16.384 mbps

BIT 204 Computer Systems and Networks

2016

Semester 1

Task 2
NRZ

NRZ-I

Mancheste
r

4B/5B

Conversion to extended-ASCII bits representation:

A

= 01000001

= 01000011

= 01001011

spa
ce

= 00100000

= 00110010

Plotting results for NRZ-I and Manchester:

Conversion 4B/5B:
#
0000 = 11110
0100
0001 = 01001
0101
0010 = 10100
0110
0011 = 10101
0111
4bit
A = 01
00
00
01
C = 01
00
00
11
K

spa
ce

5-bit

01010
01011
01110
01111

1000
1001
1010
1011
10

=
=
=
=

0101
0
0100
1
0101
0
1010
1

= 01
00
10
11
= 00
10
00
00

2 = 00
11
00

=
=
=
=

0101
0
1011
1
1010
0
1111
0

1010
1
1010
3

10010
10011
10110
10111

1100
1101
1110
1111

=
=
=
=

11010
11011
11100
11101

BIT 204 Computer Systems and Networks

2016

Semester 1

Plotting results for 4B/5B:

Task 3
Exerc
ise
part
a)

b)

c)

d)

e)

f)

Swit
ch
1
2
3
3

Input
Po
V
rt
CI
2
0
3
0
0
0
3
0

Switch 1

Output
Po
V
rt
CI
1
0
0
0
1
0
2
0

1
2
4
1
2
4
2
4

3
3
3
0
3
3
2
3

0
1
0
0
2
1
0
2

1
1
0
1
1
1
1
2

1
0
0
2
1
0
2
0

4
2

2
1

1
3

3
2

3
1

Cumula
tive
VCIs
used

0
1
2

Switch 2
Cumula
tive
VCIs
used

0
1
2

Switch 3
Cumula
tive
VCIs
used

Switch 4
Cumula
tive
VCIs
used

0
1
2
3

BIT 204 Computer Systems and Networks

2016

Semester 1

Task 4

Address class

Class B

Default subnet mask

255.255.0.0

Custom subnet mask

255.255.254.0

Total no. of subnets

2^7 =128
126

No. of usable subnets

Total no. of host addresses

2^9

# 3rd
octet
:0
+254
#
Subnets
128
2
126

=512

No. of usable host addresses

510
No. of bits borrowed

What is the 13th usable subnet range?

170.110.26.0 to 170.110.27.255
What is the subnet ID for the 10th usable subnet?
170.110.20.0
What is the subnet broadcast address for the 12 th usable subnet?
170.110.25.255
What are the assignable addresses for the 8 th usable subnet?
170.110.16.1 to

# 4th
octet
0

# Hosts
512
2
510

Supernetting working for 170.110/23

Task 5
For IPv6's addresses and directing, IPv6 gives a 128-bit address space, instead of the
32 bits of rendition 4. Along these lines, while rendition 4 might address 4 billion hubs
if manage assignment execution gets to 100%, IPv6 can address more than 1038
hubs, again assuming 100% execution. As we seen, however, 100% execution in
manage errand is not likely. In view of the most cynical reports of execution used by
this exploration, the IPv6 address space is expected to offer more than 1500 addresses
for each m2 having into record various leveled task and being skeptical. Directing in
IPv6, it is like IPv4 steering with CIRD, yet with the adaptability that 128bits
addresses permit. There are negligible adjustments to dynamic steering conventions,
for example, OSPF and RIP, keeping in mind the end goal to work with IPv6.
In address space allocation, Similar to the case with IPv4, the two essential issues in
deciding how to part the IPv6 address space with address task and directing. The
creators of IPv6 wished to structure the address space to make allocation of addresses
to ISPs, associations and people as simple as could reasonably be expected. This
allocation of the address space ought to get a little discourse. To start with, the entire
execution of IPv4's three essential address classes (A, B, and C) is incorporated inside
the "everything else" assortment. These are the primary ones of enthusiasm as of right
now, with more than 99% of the aggregate IPv6 address space accessible to this
fundamental type of address.
The multicast address space is for multicast, in this way serving the same part as class
D addresses in IPv4. The idea driving connection nearby utilize addresses is to permit
a host to build an address that will chip away at the system to which it is connected
without being included about the worldwide uniqueness of the address. This might be
valuable for autoconfiguration. Essentially, the website nearby utilize addresses are
intended to permit legitimate addresses to be built on a webpage (e.g., a private
corporate system) that is not connected to the bigger Internet; once more, worldwide
uniqueness need not be an issue.
Pretty much as with IPv4, there is some unique documentation for forming down
IPv6 addresses. The standard representation is x:x:x:x:x:x:x:x, where every "x" is a
hexadecimal representation of a 16 bit of the address. Any IPv6 address can be
composed utilizing this documentation. Since there are a couple of novel sorts of IPv6
addresses, there are some unique documentations that might be benefical in certain
circumstances.Example, an address with an expansive number of adjacent 0s can be
distributed all the more minimally by excluding all the 0 fields. In this way,
47CD:0000:0000:0000:0000:0000:A456:0124 could be distributed as
47CD::A456:0124.