KARPAGA VINAYAGA
COLLEGE OF ENGINEERING AND TECHNOLOGY
(Approved by AICTE, New Delhi, Affiliated to Anna University, Chennai and Accredited by NAAC)
GST Road, Chinna kolambakkam, Madhuranthagam Taluk,
Chengalpattu District – 603 308, Tamil Nadu
Department of ARTIFICIAL INTELLIGENCE AND DATA SCIENCE
Cs3591 Computer Network
Class Test -7
Part –A 5*2=20
1. List out the function of data link layer?
2. What do u mean by framing?
3.compare error detection and error correction?
4.what are two types of error occurred during data transmission?|
5.What do u mean by flow control?
Part –B 1*15=15
1.Explain what is distance vector routing and demonstrate how distance table given routing table?
KARPAGA VINAYAGA
COLLEGE OF ENGINEERING AND TECHNOLOGY
(Approved by AICTE, New Delhi, Affiliated to Anna University, Chennai and Accredited by NAAC)
GST Road, Chinna kolambakkam, Madhuranthagam Taluk,
Chengalpattu District – 603 308, Tamil Nadu
Department of ARTIFICIAL INTELLIGENCE AND DATA SCIENCE
CS3591 Computer Network
Class Test -7
Answer Key
Part –A
1. List out the function of data link layer?
Framing: The data link layer divides the raw data stream from the network layer into logical frames
or data units. It adds header and trailer information to the frames, which include control data for
synchronization, error control, and flow control.
2. What do u mean by framing?
Framing refers to the way information is presented or "framed" to influence people's perceptions,
attitudes, and decisions about that information.
3.compare error detection and error correction?
Error detection and error correction are closely related concepts in the field of data communication
and computer systems, but they serve different purposes.
4.what are two types of error occurred during data transmission?|
Error detection and error correction are closely related concepts in the field of data communication
and computer systems, but they serve different purposes.
5.What do u mean by flow control?
Flow control refers to the ability to control the order in which statements or instructions are
executed in a program. It allows you to make decisions and change the flow of execution based
on certain conditions or loops.
Part –B
1.Explain what is distance vector routing and demonstrate how distance table given routing
table?
Distance vector routing is a algorithm used in computer network routing protocols, where
each router maintains a vector (table) of distances to every other router in the network. The
distance is calculated based on a metric, such as the number of hops or the link cost.
In distance vector routing, each router shares its distance vector (routing table) with its
neighboring routers. The neighboring routers then use this information to update their own
routing tables and propagate the updates to their neighbors. This process continues until all
routers in the network have consistent routing tables.
Here's an example to demonstrate how distance vector routing works and how the distance
table (routing table) is constructed:
Consider the following network topology:
Copy code
A / \ / \B C \ / \ / D
Initially, each router only knows the distances to its directly connected neighbors. Let's
assume the distance (cost) between any two directly connected routers is 1.
The initial distance tables (routing tables) for each router would be:
Copy code
Router A:Destination | Distance | Next Hop-----------+----------+---
-------B | 1 | BC | 1 | CD
| ∞ | -Router B:Destination | Distance | Next Hop---------
--+----------+----------A | 1 | AC |
∞ | -D | 1 | DRouter C:Destination |
Distance | Next Hop-----------+----------+----------A |
1 | AB | ∞ | -D | 1 |
DRouter D:Destination | Distance | Next Hop-----------+----------+--
--------A | ∞ | -B | 1 | BC
| 1 | C
Now, each router shares its distance vector with its neighbors. Router A shares its table with
B and C, Router B shares with A and D, and so on.
After the first exchange, the routing tables will be updated as follows:
Copy code
Router A:Destination | Distance | Next Hop-----------+----------+---
-------B | 1 | BC | 1 | CD
| 2 | B (or C)Router B:Destination | Distance | Next Hop--
---------+----------+----------A | 1 | AC
| 2 | A (or D)D | 1 | DRouter
C:Destination | Distance | Next Hop-----------+----------+----------
A | 1 | AB | 2 | A (or D)D
| 1 | DRouter D:Destination | Distance | Next Hop---------
--+----------+----------A | 2 | B (or C)B
| 1 | BC | 1 | C
This process continues until all routers have consistent routing tables and the shortest paths to
all destinations are known. After a few more iterations, the final routing tables would
converge to the following:
Copy code
Router A:Destination | Distance | Next Hop-----------+----------+---
-------B | 1 | BC | 1 | CD
| 2 | BRouter B:Destination | Distance | Next Hop---------
--+----------+----------A | 1 | AC |
2 | DD | 1 | DRouter C:Destination |
Distance | Next Hop-----------+----------+----------A |
1 | AB | 2 | DD | 1 |
DRouter D:Destination | Distance | Next Hop-----------+----------+--
--------A | 2 | BB | 1 | BC
| 1 | C
In this example, each router now knows the shortest path (minimum distance) to reach every
other router in the network, and the next hop router to forward packets to for each destination.
Distance vector routing algorithms, like the Routing Information Protocol (RIP), use this
approach to calculate and share routing information between routers in a network.
