MANIPAL INSTITUTE OF TECHNOLOGY

(A constituent college of Manipal University, Manipal)

Manipal Karnataka 576 104

DEPARTMENT OF ELECTRONICS AND COMMUNICATION

B.Tech 5th Sem COMMUNICATION NETWORKS (ECE-309)
Assignment-3 Date: 03-10-2015
1. A) For a Gigabit Ethernet the minimum packet length is 512 bytes, for
100Mbps the
minimum packet length is 64 bytes. Compute media (or wire) speed
for Gigabit and
100 Mbps Ethernet for minimum length packets. What conclusion
can you draw?
B) A 4Mbps token ring has a token holding time value of 10msec. What
is the longest
frame that can be sent on this ring?
C) If a 200-meter 4Mbps token ring containing 20 computers, each
transmitting with
equal priority. Suppose no computer is allowed to transmit more than
5000 data bytes
before giving up the token. Once a computer gives up a token how
long will it take (in
the worst case) for that station to get the token again? Assume
Speed of signal is 200
meters/msec.

2. Draw and Explain the Frame formats of the following:

A) IEEE 802.3

B) IEEE 802.5

C) FDDI

3. A) If the length of a 10Base-5 cable is 2.5 km and the speed of

propagation in a
thick co-axial cable is 60% of the speed of light, how long does it take
for a bit to travel
from the beginning to the end of the cable? Ignore any propagation
delay in the
equipment.
B) The following figure shows the frame transition diagram of standard
Ethernet frame exchange between computers A and B connected
via a 10BT Hub. Each frame sent by A contains 1500 Bytes of
Ethernet payload data, while each frame sent by B contains 40

Bytes of Ethernet payload data. Calculate the average utilization of

the media during this exchange. Assume that the Inter Frame Gap
(IFG) ignored.

4. A) Execute the Dijkstras algorithm for the following Network Topology.

Assume the
Source node is 1 and the links are bidirectional.

B) Explain Counting to Infinity Problem with an example and the ways

to address this problem.
5. A) Execute the Bellman- Ford Algorithm for the following Network

Topology.

B) After forming the Routing Table for the above Network Topology,
assume that there is

a link failure between nodes 3 and 6. Now, update the routing

Table.