1.

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.
2. How to find Shortest Paths from Source to all Vertices using Dijkstra’s Algorithm (src=0,
Des=4)

Write in detail about Path vector routing.

Write in detail about RIP V1 and V2.

3. Consider a source computer (S) transmitting a file of size 106 bits to a destination
computer (D) over a network of two routers (R1 and R2) and three links (L1, L2 and L3).
L1 connects S to R1;L2 connects R1 to R2; and L3 connects R2 to D. Let each link be of
length 100km. Assume signals travel over each link at a speed of 10^8 meters per
second. Assume that the link bandwidth on each link is 1Mbps. Let the file be broken
 down into 1000 packets each of size 1000 bits. Find the total sum of transmission and
propagation delays in transmitting the file from S to D?
4. Consider a CSMA/CD network that transmits data at a rate of 100 Mbps (10^8 bits per
second) over a 1 km (kilometer) cable with no repeaters. If the minimum frame size
required for this network is 1250 bytes, what is the signal speed (km/sec) in the cable?
5. Consider building a CSMA/CD network running at 1 Gbps over a 1 km cable with no
repeaters. The signal speed in the cable is 200000km/sec. What is the minimum frame
size?
6. In a sliding window ARQ scheme, the transmitter’s window size is N and the receiver’s
window size is M. The minimum number of distinct sequence numbers required to
ensure correct operation of the ARQ scheme is________
7. Write in detail about ALOHA and its variants.
https://www.prepbytes.com/blog/computer-network/aloha-in-computer-networks

8. Write in detail about various CSMA protocols.

https://www.prepbytes.com/blog/computer-network/carrier-sense-multiple-access-
csma/

9. Write in detail about Stop and wait ARQ protocol.

https://www.geeksforgeeks.org/stop-and-wait-arq/

10. Write in detail about Sliding window protocol.

https://www.tutorialspoint.com/sliding-window-protocol

https://bhavanakhivsara.files.wordpress.com/2015/01/sliding-window-protocol.pdf

Sliding Window Protocol (Selective Repeat) (tutorialspoint.com)

https://www.javatpoint.com/go-back-n-arq

11. Write in detail about single bit parity, two dimensional parity with example.

https://www.geeksforgeeks.org/error-detection-in-computer-networks/

12. Write in detail about checksum with example.

https://www.tutorialspoint.com/error-detecting-codes-checksums

13. Write in detail about Cyclic redundancy check with example.

 https://www.gatevidyalay.com/cyclic-redundancy-check-crc-error-detection/

14. Write in detail about Hamming code.

15. Write in detail about OSPF.
16. Write in detail about BGP.
17. Write in detail about EIGRP.
18. Write in detail about IPV6 addressing.
19. Write in detail about Token ring.
20. Write in detail about static and dynamic routing.

1. Explain how the Distance Vector Routing protocol works and provide an
example to help illustrate your explanation. (6 marks)
2. Describe how the Link State Routing protocol operates and give an example to
show how it is used in networks. (6 marks)
3. What is Path Vector Routing? Explain it in detail and highlight how it is different
from other routing methods. (6 marks)
4. Compare RIP Version 1 and Version 2. What are the key differences between
the two versions? (4 marks)
5. What is the ALOHA protocol? Explain its purpose and describe the different
types (variants) of ALOHA. (4 marks)
6. Describe the different types of CSMA protocols. How do they work to control
access to the network? (4 marks)
7. What is the Stop-and-Wait ARQ protocol? Explain how it works for error control
in data transmission. (4 marks)
8. Explain how the Sliding Window protocol functions and describe how it
manages the flow of data and handles errors. (6 marks)
9. What is single-bit parity? Explain how it detects errors and use an example to
show how it works. What about two-dimensional parity? Explain that as well
with an example. (6 marks)
10. Explain the checksum method with an example. How does it help in detecting
errors in data transmission? (4 marks)
11. Describe the Cyclic Redundancy Check (CRC) method with an example. How
does CRC detect and correct errors? (6 marks)
12. What is Hamming Code? Explain how it works with an example, and show how
it can correct errors in data. (6 marks)
13. Describe the OSPF (Open Shortest Path First) protocol. How does it help routers
find the best path for data to travel in large networks? (4 marks)
14. Explain the BGP (Border Gateway Protocol) and describe how it manages data
routing between different networks (autonomous systems). (4 marks)
15. What is EIGRP (Enhanced Interior Gateway Routing Protocol)? Explain how it
simplifies routing and describe its advantages in network communication. (6
marks)
 16. Describe the structure of IPv6 addressing. How does it differ from IPv4? Why is
IPv6 important? (4 marks)
17. What is a Token Ring network? Explain how it works and describe its
importance in network design. (4 marks)
18. Compare static and dynamic routing. What are the differences between them,
and when would you use each type? (4 marks)

1. 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. 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.

Answer :
As soon as N2−N3 reduces to 2, both N2 and N3 instantly updates their distance
to N3 and N2 to 2 respectively.
So, N2: (1,0,2,7,3), N3: (7,2,0,2,6) becomes this.
After this starts first round of update in which each node shares its table with their
respective neighbors ONLY.
N1: (0,1,7,8,4),
N2: (1,0,2,7,3),
N3: (7,2,0,2,6),
N4: (8,7,2,0,4),
 N5: (4,3,6,4,0).
SEE at this time all the entries are old EXCEPT in N2 and N3 where value changes
to 2 instead of 6.
N3 receives tables from N2: (1,0,2,7,3) and N4: (8,7,2,0,4). Using THIS ONLY
original N3: (7,2,0,2,6) updates to N3(3,2,0,2,5). (For updation and forming the tables
for this refer FOROUZAN.)

2. How to find Shortest Paths from Source to all Vertices using Dijkstra’s Algorithm

Given a weighted graph and a source vertex in the graph, find the shortest paths from
the source to all the other vertices in the given graph.
https://www.geeksforgeeks.org/dijkstras-shortest-path-algorithm-greedy-algo-7/
Note: The given graph does not contain any negative edge.
Examples:
Input: src = 0, the graph is shown below.

Output: 0 4 12 19 21 11 9 8 14
Explanation: The distance from 0 to 1 = 4.
The minimum distance from 0 to 2 = 12. 0->1->2
The minimum distance from 0 to 3 = 19. 0->1->2->3
The minimum distance from 0 to 4 = 21. 0->7->6->5->4
The minimum distance from 0 to 5 = 11. 0->7->6->5
The minimum distance from 0 to 6 = 9. 0->7->6
The minimum distance from 0 to 7 = 8. 0->7
The minimum distance from 0 to 8 = 14. 0->1->2->8
3. Consider a source computer (S) transmitting a file of size 106 bits to a destination
computer (D) over a network of two routers (R1 and R2) and three links (L1, L2 and L3).
L1 connects S to R1;L2 connects R1 to R2; and L3 connects R2 to D. Let each link be of
length 100km. Assume signals travel over each link at a speed of 10^8 meters per
second. Assume that the link bandwidth on each link is 1Mbps. Let the file be broken
down into 1000 packets each of size 1000 bits. Find the total sum of transmission and
propagation delays in transmitting the file from S to D?

Tp from S to R1 = (Distance) / (Link Speed) = 105 /108 = 1ms

Total prorogation delay to travel from S to D = 3*1 ms = 3ms
Total Ttransmission delay for 1 packet = 3 * (Number of Bits) / Bandwidth
= 3*(1000/106 ) = 3ms.
The first packet will take 6ms to reach D. While first packet was reaching D, other
packets must have been processing in parallel. So D will receive remaining packets 1
packet per 1 ms from R2. So remaining 999 packets will take 999 ms. And total time will
be
999 + 6 = 1005 ms

4. Consider a CSMA/CD network that transmits data at a rate of 100 Mbps (10^8 bits per
second) over a 1 km (kilometer) cable with no repeaters. If the minimum frame size
required for this network is 1250 bytes, what is the signal speed (km/sec) in the cable?
5. Consider building a CSMA/CD network running at 1 Gbps over a 1 km cable with no
repeaters. The signal speed in the cable is 200000km/sec. What is the minimum frame
size?
Frame Size S >= 2BL/P

Where,

Cable Length L = 1KM = 1000M

Propagation Speed P = 2 x 10^8 m/sec
Bandwidth = 1 Gbps = 10^9 bps

See this for details of above formula.

S >= (2 * 10^9 * 1000) / (2 x 10^8)

= 10000 bits
104 bits / 8 = 1250 bytes
6. In a sliding window ARQ scheme, the transmitter’s window size is N and the receiver’s
window size is M. The minimum number of distinct sequence numbers required to
ensure correct operation of the ARQ scheme is________
Answer :
In general sliding window ARQ scheme , the sending process sends a number of
frames without worrying about receiving an ACK(acknowledgement) packet from the
receiver. The sending window size in general is N and receiver window is 1. This means
it can transmit N frames to its peer before requiring an ACK. The receiver keeps track
of the sequence number of the next frame it expects to receive and sends that
number with ever ACK it sends. But in case of the question the sender window size is
N and receiver is M so the receiver will accept M frames instead of 1 frame in general.
Thus sending M sequence numbers attached with the acknowledgement. Hence, for
such a scheme to work properly we will need a total of M+ N distinct sequence
numbers.