AMITY SCHOOL OF ENGINEERING & TECHNOLOGY

COMPUTER COMMUNICATION AND NETWORKS (ECE-635)

TUTORIAL NO. – 7(Network layer)

1. Assume that the velocity of propagation on a TDM bus is 0.8 c, its

length is 10 m, and the data rate is 500 Mbps. How many bits should
be transmitted in a time slot to achieve a bus efficiency of 99%?
2. Consider a simple telephone network consisting of two end offices
and one intermediate switch with a 1-MHz full-duplex trunk between
each end office and the intermediate switch. The average telephone is
used to make four calls per 8-hour workday, with mean call duration
of six minutes. Ten percent of the calls are long distance, what is the
maximum number of telephones an end office can support? (sol :
Each telephone makes 0.5 calls/hour at 6 minutes each. Thus a
telephone occupies a circuit for 3 minutes per hour. Twenty
telephones can share a circuit (although this 100% utilization
implies long queuing delays). Since 10% of the calls are long
distance, it takes 200 telephones to occupy a long distance (4
kHz) channel full time. The interoffice trunk has 106/(4 × 103 ) =
250 channels. With 200 telephones per channel, an end office
can support 200 × 250 = 50, 000 telephones.)
3. Consider a packet-switching network of N nodes, connected by the
following topologies:
a. Star: one central node with no attached station; all other nodes
attach to the central node.
b. Loop: each node connects to two other nodes to form a closed
loop.
c. Fully connected: each node is directly connected to all other
nodes. The average is based on assumptions that each
node communicates to each other node an equal number of
times. Another way to look at it is if each node talks to all
other nodes exactly once.

a) STAR - at most 2 hops between any two nodes, avg hop is

also 2. Basically, it must make 2 hops to talk to any other
node, except the central node, which is one hop.
   max hops= 2
   avg hops= 2 (unless going to central node in which case,
1.5)
 b) LOOP
   max hops= N - 1 (if not minimizing hops)
           = N/2 then round down to the nearest integer (if
using shortest hops constraint) so a 4 node network would be
2 hops, 5 node network would also be 2 hops, 6 and 7 node
network would be 3 hops, etc. Draw it out if you need help
visualizing this
   avg hops= MaxHops(N - 1)/N
             so a 4 node network would be 2(4-1)/4 = 1.5
avg hops

c) FULLY CONNECTED (also called FULL MESH) since all

nodes are connected to each other, only 1 hop is necessary to
get to any other node
   max hops: 1
   avg hops: 1
4. For each case, give the average number of hops between stations.
5. Consider a binary tree topology for a packet-switching network. The
root node connects to two other nodes. All intermediate nodes connect
to one node in the direction toward the root, and two in the direction
away from the root. At the bottom are nodes with just one link back
toward the root. If there are 2N - 1 nodes, derive an expression for the
mean number of hops per packet for large N, assuming that trips
between all node pairs are equally likely. Q8 of tut 8
6. It was shown that flooding can be used to determine the minimum-
hop route. Can it be used to determine the minimum delay route?
7. With random routing, only one copy of the packet is in existence at a
time. Nevertheless, it would be wise to utilize a hop count field. Why?
8. Another adaptive routing scheme is known as backward learning. As a
packet is routed through the network, it carries not only the
destination address, but the source address plus a running hop count
that is incremented for each hop. Each node builds a routing table that
gives the next node and hop count for each destination. How is the
packet information used to build the table? What are the advantages
and disadvantages of this technique?
9. The token ring MAC protocol specifies that the A and C bits may be
set by a station on the ring to indicate address recognized and frame
copied, respectively. This information is then available to the source
station when the frame returns after circulating around the ring. If a
 bridge captures a frame and forwards it, should it set the A and C bits
or not? Make a case for each policy.
10.Two blue armies are each poised on opposite hills preparing to attack
a single red army in the valley. The red army can defeat either of the
blue armies separately but will fail to defeat both blue armies if they
attack simultaneously. The blue armies communicate via an unreliable
communications system (a foot soldier). The commander, with one of
the blue armies, would like to attack at noon. His problem is this: If he
sends a message ordering the attack, he cannot be sure it will get
through. He could ask for acknowledgment but that might not get
through. Is there a protocol that the two blue armies can use to avoid
defeat?
11.A transport layer message consisting of 1500 bits of data and 160 bits
of header is sent to an internet layer which appends another 160 bits
of header; this is then transmitted through two networks, each of
which uses a 24-bit packet header. The destination network has a
maximum packet size of 800 bits. How many bits, including headers,
are delivered to the network layer protocol at the destination?
12.The ICMP format includes the first 64 bits of the datagram data field.
What might be the purpose of including these bits?
13.The architecture suggested by Figure is to be used. What functions
could be added to the routers to alleviate some of the problems caused
by the mismatched local and long-haul networks?

14.Would the spanning tree approach be good for an internet including

routers?
15.Should internetworking be concerned with a network's internal
routing? Why or why not?
16.Compare the individual fields of the IPv4 header with the IPv6
header. Account for the functionality provided by each IPv4 field by
showing how the same functionality is provided in IPv6.