Digital Assignment

20BDS0251

1) List and compare the features of any two wireless technologies

2) Write short notes on Bluetooth

3) Explain the functioning of wireless LAN or IEEE 802.11 in detail

4) Explain IEEE 802.3 standard or Ethernet in detail

5) What is hidden node problem?

6) Write about unicast, multicast and broadcast routing

7) Why we need to change from IPv4 to IPv6?

8) Consider a point-to-point link 50 km in length. At what bandwidth would propagation delay

(at a speed of 2 × 108 m/sec) equal transmit delay for 100 - byte packets? What about 512-
byte packets?

9) Calculate the latency (from first bit sent to last bit received) for: A 1-Gbps Ethernet with a
single store-and-forward switch in the path, and a packet size of 5,000 bits. Assume that
each link introduces a propagation delay of 10 μs and that the switch begins retransmitting
immediately after it has finished receiving the packet

10) Suppose we want to transmit the message 1011 0010 0100 1011 and protect it from errors
using the CRC8 polynomial x8 +x2 +x1 + 1.

(a)Use polynomial long division to determine the message that should be transmitted.

(b) Suppose the leftmost bit of the message is inverted due to noise on the transmission link.

What is the result of the receiver’s CRC calculation? How does the receiver know that an error has
occurred?
 11) Suppose you are designing a sliding window protocol for a 1-Mbps pointto-point link to the
stationary satellite evolving around Earth at 3 × 104 km altitude. Assumin g that each frame
carries 1 KB of data, what is the minimum number of bits you need for the sequence number
in the following cases? Assume the speed of light is 3×108 meters per second. (a)RWS=1. (b)
RWS=SWS.

12) Suppose we have the forwarding tables shown in Table 4.13 for nodes A and F, in a network
where all links have cost 1. Give a diagram of the smallest network consistent with these
tables.

13) A channel has a bit rate of 4 Kbps and one way propagation delay of 20 msec. The channel
uses stop and wait protocol. The transmission time of the acknowledgement frame is
negligible. To get a channel efficiency of at least 50%, the minimum frame size should be-

A. 80 bytes

B. 80 bits

C. 160 bytes

D. 160 bits

14) Consider a 128 x 103 bits/sec satellited communication link with one way propagation delay
of 150 msec. Selective Retransmission (repeat) protocol is used on this link to send data with
a frame size of 1 KB. Neglect the transmission time of acknowledgement. The minimum
number of bits required for the sequence number field to achieve 100% utilization is
________ .

15) A host with IP Address 200.100.1.1 wants to send a packet to all the hosts in the same
network. What will be-A. Source IP Address B. Destination IP Address
 16) Consider the following subnet masks-

1. 255.0.0.0

2. 255.128.0.0

3. 255.192.0.0

4. 255.240.0.0

5. 255.255.0.0

6. 255.255.254.0

7. 255.255.255.0

8. 255.255.255.224

9. 225.255.255.240

For each subnet mask, find-

A. Number of hosts per subnet

B. Number of subnets if subnet mask belongs to class A

C. Number of subnets if subnet mask belongs to class B

D. Number of subnets if subnet mask belongs to class C

E. Number of subnets if total 10 bits are used for the global network ID

17) Suppose a router receives an IP packet containing 600 data bytes and has to forward the
packet to a network with maximum transmission unit of 200 bytes. Assume that IP header is
20 bytes long. What are fragment offset values for divided packets?

18) A 2 km long broadcast LAN has 10 7 bps bandwidth and uses CSMA/CD. The signal travels
along the wire at 2 × 10 8 m/s. What is the minimum packet size that can be used on this
network?

19) Consider a network with 6 routers R1 to R6 connected with links having weights as shown in
the following diagram
All the routers use the distance vector based routing algorithm to update their routing tables. Each
router starts with its routing table initialized to contain an entry for each neighbor with the weight of
the respective connecting link. After all the routing tables stabilize, how many links in the network
will never be used for carrying any data?

20) Consider a network with five nodes, N1 to N5, as shown below.

The network uses a Distance Vector Routing protocol. Once the routes have stabilized, the distance
vectors at different nodes are as following. N1: (0, 1, 7, 8, 4) N2: (1, 0, 6, 7, 3) N3: (7, 6, 0, 2, 6) N4: (8,
7, 2, 0, 4) N5: (4, 3, 6, 4, 0) Each distance vector is the distance of the best known path at the
instance to nodes, N1 to N5, where the distance to itself is 0. Also, all links are symmetric and the
cost is identical in both directions. In each round, all nodes exchange their distance vectors with
their respective neighbors. Then all nodes update their distance vectors. In between two rounds, any
change in cost of a link will cause the two incident nodes to change only that entry in their distance
vectors. 52. The cost of link N2-N3 reduces to 2(in both directions). After the next round of updates,
what will be the new distance vector at node, N3?