[go: up one dir, main page]
Scribd
Upload
249 views5 pages

Routing Basics for BCA Students

Routing is the process of selecting a path for traffic between networks or within a network. There are three main routing algorithms: distance vector routing, link state routing, and path vector routing. Routing protocols like RIP, OSPF, and BGP are used to determine the best path using these algorithms. RIP uses distance vector routing and selects paths based on hop count. OSPF uses link state routing to find the shortest path. BGP uses path vector routing to identify the best path for transmitting data.

Uploaded by

Dr. A.BATHSHEBA PARIMALA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
249 views5 pages

Routing Basics for BCA Students

Routing is the process of selecting a path for traffic between networks or within a network. There are three main routing algorithms: distance vector routing, link state routing, and path vector routing. Routing protocols like RIP, OSPF, and BGP are used to determine the best path using these algorithms. RIP uses distance vector routing and selects paths based on hop count. OSPF uses link state routing to find the shortest path. BGP uses path vector routing to identify the best path for transmitting data.

Uploaded by

Dr. A.BATHSHEBA PARIMALA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Computer Network- Routing

Routing Algorithm:

 Routing is the process of selecting a path for traffic in a


network or between or across multiple networks.

There are three main types of routing algorithms:

1. Distance Vector (distance-vector routing)-DVR


2. To link state (link state routing)-(LSR)
3. Path to vector (path-vector routing)-(PVR)

Routing Protocols:

1. RIP(Routing Information Protocol)


-It identifies the availability path between source and
destination(or)sender and receiver
-DVR Algorithm used in this protocol

Routing Table For RIP


S.No Source Address Destination Address Hop Path-
count Identification
1 192.168.1.101(S 192.168.1.110 1 A-B-E
ource A) (Destination E) 2 A-D-F-E
2 A-A-F-E

Availablity path:3

Notes Prepared by, A.Bathsheba Parimala


Assistant Professor, Dept. of BCA
St.John’s College, Palayamkottai
Computer Network- Routing

2.Open Shortest Path First Protocol(OSPF)

-It identifies the shortest path in the network

-Link state Routing protocols used(LSR)

Routing Table For OSPF


S.No Source Address Destination Address Hop Path- Shortest
count Identification Path
1 192.168.1.101(S 192.168.1.110 1 A-B-E A-B-E
ource A) (Destination E) 2 A-D-F-E
2 A-A-F-E

Define by hop count

Availablity path:1

Notes Prepared by, A.Bathsheba Parimala


Assistant Professor, Dept. of BCA
St.John’s College, Palayamkottai
Computer Network- Routing

2.Border Gateway Protocol(BGP)

-It identifies the best path to transmit the data

-PVR algorithm used

Routing Table For BGP


S.No Source Address Destination Address Hop Path- Best
count Identification Path
1 192.168.1.101(S 192.168.1.110 1 A-B-E A-B-E
ource A) (Destination E) 2 A-D-F-E A-D-F-E
2 A-A-F-E

Choosing the best path to transmitting

Availablity path:1

Notes Prepared by, A.Bathsheba Parimala


Assistant Professor, Dept. of BCA
St.John’s College, Palayamkottai
Computer Network- Routing

Related Images could be draw

X------------------------X

X-----------------------X

Notes Prepared by, A.Bathsheba Parimala


Assistant Professor, Dept. of BCA
St.John’s College, Palayamkottai
Computer Network- Routing

This image is important

Notes Prepared by, A.Bathsheba Parimala


Assistant Professor, Dept. of BCA
St.John’s College, Palayamkottai

You might also like