Chapter-7

ROUTING ALGORITHM

Prepared By Mr.Hang Vannak 1

Routing Algorithm

 An internet KWRtUv)anpÁúMKñaén Network RtUv)anPa¢b;eday Routers.

 enAeBl Packet eFVIdMeNIrBIRbPBeTAeKaledA vanwgqøgkat; Routers CaeRcInrhUtdl;
va)aneTAdl; Router Edl)anP¢ab;CamYynwg Network EdlCaeKaledA .
 Router edaHRsay Routing Table mYyenAeBl Packet )anqøgkat;eTAmux .

 Routing Table )anbBa¢ak;bgðajpøÚvd¾l¥RbesIrbMputsMrab; Packet qøgkat; .

 müa:geTot Table GacCa Static b¤Ca Dynamic k¾)an .

 Static table KWmin)anbþÚrtamlMdab;enaHeT .

Prepared By Mr.Hang Vannak 2

Routing Algorithm

 Dynamic table )anpþl;kar UpdateedaysV½yRbvtþienAeBlBYkva)anbþÚrBIkEnøgmYy

enAkñúg internet .
 bc©úb,nñ internet RtUvkar Dynamic routing tables .
 Routing table RtUvkar Update Pøam²enAeBlBYkva)anbþÚrenAkñúg internet .

 Routing protocol )anbegáItsMrab;eFVIkarTTYlxusRtUvrdIm,ItMrUvkñúg Dynamic routing

table .

 Routing protocol KWCakarpÁúMc,ab;nigTMrg;karEdlGnuBaØat[ RouterenAkñúg internet

pþl;dMNWg[]bkrN_NamYyEdl)anbþÚr .
Prepared By Mr.Hang Vannak 3
Unicast Routing

 enAkñúg Unicast Communication BYkvaTaMgenaHKWmanRbPBmYynig eKaledAmYy .

 TMnak;TMngrvagRbPBnigeKaledAKW One-to-one .
 enAkñúgRbePTTMnak;TMngTaMgBIrenHKWman Source address nig Destination address
enAkñúg IP datagram KWCa Unicast address RtUv)ansßabnaeLIgsMrab; host (or
host port ) .

 enAkñúgrUbxageRkamenH lkçN³ Unicast Packet mkBI RbPB S1ehIyqøgkat; Router

eTAdl; Destination D1 .

Prepared By Mr.Hang Vannak 4

Unicasting

Prepared By Mr.Hang Vannak 5

Unicast Routing

 KYrkt;sMKal;faenAkñúg Unicast routing enAeBl Router TTYl Packet mYy vanwg bnþ
Packet enHeTAmuxqøgkat;tam Port rbs;vaEtmYyKt;Edl)ankMNt;enAkñúg Routing

table .

 Router Gacnwge)aHbg; Packet enHecalebIsinCavark Destination address

enHmineXIjenAkñúg Routing table .

Prepared By Mr.Hang Vannak 6

Metric

 Router TTYl Packet BI Network ehIybBa¢ÚnvacUleTAkñúg Network epSg .

 Router mYyCaTUeTAvaGnuBaØat[ Network mYycMnYnP¢ab;CamYyva)an .

 Metric KWCatMél)ansßabnasMrab;qøgkat; Network .

 Metric srubén Route NamYy esµInigplbUkén Metric rbs; Network EdlmanP¢ab;

Router .

 Router eRCIserIs Route Edlman Metric xøIbMput .

 Metric Edl)ansßabnaeLIgcMeBaH Network nimYy²GaRs½yedayRbePT Protocol:

Prepared By Mr.Hang Vannak 7

Routing Information Protocol (RIP)

 man Protocol xøHdUcCa Routing Information Protocol (RIP) RbRBWtþeTAcMeBaH

Network TaMgGs;EdlmantMélRbEhl .

 tMElénkarqøgkat; Network nimYy² KWdUcKña KWrab; 1 hop count .

 dUecñHebI Packet qøgkat; 10 networks eTIbeTAdl;eKaledA tMélsrubKW 10 hop
counts .

Prepared By Mr.Hang Vannak 8

Open Shortest Path First (OSTF)

 KWCaRbUtUkUlmYyGnuBaØat[ Administrator sßabnasMrab;kMNt;[ Packet

qøgkat; Network manmUldæanenAelIRbePT Service EdlCatMrUvkarcaM)ac; .
 pøÚvsMrab;[ Packet eFVIdMeNIrqøgkat; Network GacmantMélxusKña (Metric)
 OSPF GnuBaØat[ Router nimYy²man Routing table QrenAelImUldæan

tMrUv eTAtamRbePTén Service .

Prepared By Mr.Hang Vannak 9

Border Gateway Protocol (BGP)

 BGP sMrab;kMNt; Metric srubepSg²Kña .

 enAkñúg BGP lkçN³vinic¢½yKWCa Policy EdlGaceRCIserIs)aneday
Administrator .

 Policy )ankMNt;nUvCapøÚvEdl)aneRCIserIs

Prepared By Mr.Hang Vannak 10

Interior and Exterior Routing

 bc©úb,nñenH internet GacmanTMhMFMNas;Edl Routing Protocol mYymin

Gacpþl;kargarénkar Updating dl; routing table én Router TaMgGs;)an
 cMeBaHmUlehtuenH internet )anEckeTACa Autonomous System (AS)
KWCaRkumén Network ehIy Router sßitenAeRkamsiT§énkarRKb;RKgmYy.
 Routing enAxagkñúg Autonomous System KWCa Interior Routing .

 Routing rvag Autonomous System KWCa Exterior Routing .

Prepared By Mr.Hang Vannak 11

Unicast Routing Protocol

Prepared By Mr.Hang Vannak 12

Unicast Routing Protocol

 Interior nig Exterior routing protocol TaMgBIrenHsßitenAkñúgkareRbIR)as;

 eyIgnigBiPakSa Interior routing protocol manBIrKW RIP and OSPF
cMENkÉ Exterior routing protocol manmYyKW BGP .
 RIP and OSPF GaceRbIsMrab; Update Routing tables xagkñúg AS .

 BGP GaceRbIsMrab; Update Routing tables cMeBaH Router EdlP¢ab;Ca

mYy AS .

Prepared By Mr.Hang Vannak 13

Unicast Routing Protocol

 rUbxageRkamenHman Router R1, R2, R3, and R4 eRbIi Interior nig

Exterior routing protocol .

 Router epSgeToteRbI Interior routing protocol Etmüa:gKt; .

 ExSEdlmanlkçN³Cab; bgðajGMBITMnak;TMngrvag Router eRbI Interior

routing protocol.

 ExSEdlmanlkçN³dac; bgðajGMBITMnak;TMngrvag Router eRbI Exterior

routing protocol.

Prepared By Mr.Hang Vannak 14

Unicast Routing Protocol

Prepared By Mr.Hang Vannak 15

Routing Information Protocol (RIP)

 Routing Information Protocol (RIP) KWCa Interior Routing

Protocol eRbIenAkñúg Autonomous System .

 RIP Ca Protocol ya:gsm½BaØmYymanmUldæanenAelI Distance Vector

Routing edayeRbI Bellman-Ford Algorithm sMrab;KNna Routing
Tables .

 enAkñúgEpñkenH CatMbUgeyIgnigsikSaGMBIlkçN³sMxan;rbs; Distance Vector

Routing EdlvaGnuvtþn_tam RIP .

Prepared By Mr.Hang Vannak 16

Distance Vector Routing

 enAkñúg Distance Vector Routing , Router nimYy²enAkñúgxN³eBlEdlva

)anEckcaykaryl;dWgrbs;vaGMBIkarcUlmkén internet CamYynwg
Neighbors rbs;va eKmanKnøWHsMxan;bIya:gedIm,IEsVgyl;GMBIviFIsaRsþEdl

Algorithm enHeFVIkar tamCMha‘ndUcxageRkam ³

1- Sharing acknowledge about the entire autonomous system
Router nimYy²)anEckcaykaryl;dWgrbs;vaGMBI Autonomous System
CamYy Router Citxagrbs;va .

Prepared By Mr.Hang Vannak 17

Distance Vector Routing

2- Sharing Only With Neighbors

 Router nImYy²)anbBa¢Ún (Knowledge) rbs;vaEtm:üagKt;eTA
router Citxagrbs;va

 va)anbBa¢ÚnGIVCakardwglWrbs;vaqøgenARKb; Interface TaMgGs;

3- Sharing at regular interval:
 Router nImYy²)anbBa¢ÚnkardwglWrbs;vaeTA router
enACitxagrbs;vaenAkñúg kMriteBlCak;lak;. ]TahrN_³ ral; 30s
Prepared By Mr.Hang Vannak 18
Routing Table

 RKb; Router nImYy²)anrkSa routing table Edlmankarqøgkat;mYysMrab; eKaledAén

network nImYy²én router Edlva)andwg

 karqøgkat;manpÞúk destination network address ry³cMgayCitbMputEdl

eTAdl;eKaledAtamry³ hop count, ehIy router cMeBaH packet
GacnaMeTAdl;eKaledAcugeRkayrbs;va
 Hop count KWCacMnYnén network Edl packet )anCYbedIm,IeTAdl;eKaledA rbs;va

 kñúgtaragmanpÞúkB’tmanepSg²dUcCa sub network CaedIm

Prepared By Mr.Hang Vannak 19

Routing Table

Prepared By Mr.Hang Vannak 20

RIP Updating Algorithm

 Routing table RtUv)an Update enAelIbBa©Ikt;Rtarbs; Message eqøIytb

rbs; RIP
 enAkñúgrUbxageRkam router TTYl RIP message BI Router C
 Message )ankt; destination network nigkareqøIytb hop counts

 CMhanTI1 karGnuBaØateGay updating algorithm edIm,IbegáIn hop count

eday 1.

Prepared By Mr.Hang Vannak 21

RIP Updating Algorithm

 bnÞab;mkkar Update RIP packet enH old routing table RtUv)aneFIVkar

eRbobeFob .
 CalT§plKW routing table CamYynwgkarekIneLIgén hop count
BImYyéf¶eTAmYyéf¶cMeBaHeKaledAnImYy² .
 cMeBaH N1 eTAkñúgenaHKW KµanB_tmanfµI dUcenH Net1 mankarqøgkat;KWmansl;
dUcBImunmk .

Prepared By Mr.Hang Vannak 22

RIP Updating Algorithm

 cMeBaH N2 B_tmanenAkñúgtarag nig enAkñúgtaragnigenAkñúg Message sMKal;

dUcKñaeTAnig Hop (Router C) .
 eTaHbICatMélrbs; hop count enAkúñgtarag (2) KWmanticCagmYyenAkñúg
Message (5), algorithm eRCIserIsykkarTTYlmYyenAkñúg Message
BIeRBaHtMéledImrbs;vamkBI Router C .
 tMélenH\T,Úv)anTukCaemaX³ BIeRBaHfa Router C )anRbkascUleTAkñúg
tMélfµI .

Prepared By Mr.Hang Vannak 23

RIP Updating Algorithm

 Net 3 )anbEnßm Destination fµI .

 cMeBaH Net 6, RIP Packet manpÞúk Lower hop count ehIyCakarbgðaj
enAelI Routing table fµI .
 rIÉ Net 8 nig Net 9TaMgBIrenH )anTuknUvtMéledImrhUtdl; kareqøIyqøgKañén
hop count enAkñúg Message ElgmankarGPivDÆn_ .

Prepared By Mr.Hang Vannak 24

RIP Updating Algorithm

Prepared By Mr.Hang Vannak 25

Initializing the Pouting Table

 enAeBl Router )anbEnßmcUleTAkúñg Network mYy vak¾cab;epþImbegáIt

Routing table sMrab;xøÜnvaedayeRbIR)as; Configurating file rbs;va .

 Table manpÞúkkarP¢ab;edayCamyy network nig hop count Etmüa:gKt;

edaykarcab;epþImeTArk 1.
 Hop field bnÞab;mkRtUv)ansMKal;eday RouterbnÞab;b:uEnþKñanGVITaMgGs; .

 rUbxageRkamenHbgðajGMBIkarcab;epþIm Routing table enAkñúg AS tUcmYy .

Prepared By Mr.Hang Vannak 26

Initializing the Routing Table

Prepared By Mr.Hang Vannak 27

Updating The Routing Table

 Routing table nimYy²KW)an Update eTAelIbBa¢Ikt;Rtarbs; RIP Message

edayeRbI RIP Updating Algorithm dUc)aneXIjBImunmk .
 rUbxageRkamenHbgðajGMBI Autonomous System BImunmkrhUtdl;
Routing cugeRkay .

Prepared By Mr.Hang Vannak 28

Updating The Routing Table

Prepared By Mr.Hang Vannak 29

Open Shortest Path First (OSPF)

 OSPF Protocol KWCa Interior Routing Protocol mYyepSgeTotEdlpþl;

karcMeNjeBlevlaeRcIn ehIymankarniymeRbIya:geRcIn .
 Router BiessRtUv)aneKehAfa Autonomous System Boundary
Router EdlTTYlbnÞúkedaHRsayB½t’manGMBI Autonomous System
eTACaRbB½n§kMBg;EtmanRbsiT§PaB .
 edIm,Ipþl;Tinñplnigkargarerobryén Routing, OSPF )anEck
Autonomous System eTACa Arae .

Prepared By Mr.Hang Vannak 30

Areas

 Area KWCakarRbmUlpþúMén Network, Host, nig Router TaMGs;EdlmanenA kúñg

Autonomous System .

 Area k¾GacEckeTACa Area xusKñaCaeRcIneTot .

 Network xagkñúgTaMgGs; Area RtUv)anP¢ab;.

 Router xagkñúgman Area CaeRcIneTot ehIy Area man Routing Information

enAkñúgenaH.
 enARtg;RBMEdnrbs; Area man Router BiessmYyehAfa Area Border Router

Prepared By Mr.Hang Vannak 31

Area

 Area Border Router mantYnaTIsrub Information enAkñúg Area ehIybBa¢Únva

eTA Area epSgeTot .
 kñúgcMeNam Area xagkñúg AS KWCa Area BiessRtUv)an eKehAfa Backbone,
AreaTaMgGs;enAkñúg AS RtUvEtP¢ab;eTA Backbone .

 Router xagkñúg Backbone RtUv)aneKehAfa Backbone Routers

 KYrkt;sMKal;fa Router GacCa Area Border .

Prepared By Mr.Hang Vannak 32

Area

 ebImanbBaðaxøH)anekIteLIg kartPa¢b;rvag Backbone nig Area RtUv)anxUc

xat Virtual link rvag Router RtUvEtbegáIteday Administrator edIm,I[
kartPa¢b; Backbone Ca Primary Area .
 Area nimYy²manlkçN³sMKal; Area, lkçN³sMKal; Area rbs;

Backbone KW sUnü (0) .

Prepared By Mr.Hang Vannak 33

AS and it Area

Prepared By Mr.Hang Vannak 34

Metric

 OSPF protocol GnuBaØt[ Administrator sßabnatMélmYyehAfa

Metric cMeBaH Router nimYy² .

 Metric manmUldaænenAelIRbePTén Service

Minimum Delay
Maximum trough-put
So on…

Prepared By Mr.Hang Vannak 35

Link State Routing

 OSPF eRbI Link State Routing edIm,I Update enAelI Routing Table
enAkñúg Area .
 Link State Routing dMeNIrkar)andaysarEt Router nimYy²)anEckcay

kardWgB¤rbs;vaGMBI Neighborhood rbs;vaCamYy Router nimYy² TaMgLay

enAkñúg Area .
 eKmanKnøWHbIya:gsMrab;EsVgyl;GMBIviFIsaRsþenHeFVIkardUcxageRkam ³

Prepared By Mr.Hang Vannak 36

Link State Routing

1- Sharing knowledge about neighborhood:

 Router nimYy²bBa¢ÚnlkçN³rbs; Neighborhood eq<aHeTA Router enAkñúg
Area .
2- Sharing whit every other router:
 Router nimYy²bBa¢ÚnlkçN³rbs; Neighborhood eq<aHeTA Router enAkñúg
Area .
 Process eFVI[ Router bBa¢ÚnB½t’manrbs;vaeTA Neighbors rbs;vaTaMgGs;
(qøgkat; Output port TaMgGs;rbs;va )

Prepared By Mr.Hang Vannak 37

Link State Routing

 Neighbor nimYy²bBa¢Ún Packet eTA Neighbors rbs;vaTaMgGs; nig Cabnþ bnÞab;eTot

 RKb; Router nimYy²EdlTTYl Packet bBa¢Ún Copy eTA Neighbor nimYy²rbs;va .
 edayyfaehtu Router nimYy²)anTTYl Copy énbNþajEtmYy .
3- Sharing When there is a change:

 Router nimYy²EckcaylkçN³én Neighborhood rbs;vaEtmüa:gKt; enAeBlEdlva

ERbRbYl .
 enHCac,ab;EdleFVI[eXIjPaBxusKñaCamYy Distance Vector Routing .

Prepared By Mr.Hang Vannak 38

Link State Routing

 KMnitenABIeRkay Link State Algorithm KW Router nimYy²RtUvEtdwgya:g

R)akd GMBI Topology én Internet enARtg;clnanimYy² .
 BI Topology enH Router GacKNna Shortest Path rvagxøÜnvanig
Network nimYy² .

 Topology manvtþmanenATIenH mann½yfa Graph manpÞúk Node nig adges

Prepared By Mr.Hang Vannak 39

Type of Link

 enAkñúgRbCuMbec©keTs OSPF mankartP¢ab;mYyehAfa Link .

 man Link bYnRbePTRtUv)aneKkMNt;enaHKW ³
Point-to Point, Transient, Stub, Virtual

Prepared By Mr.Hang Vannak 40

Point-to-point Link

 Point-to-point link KWCakartPa¢b;rvag Router cMnYnBIr edayKµan Host b¤ Router

NaepSgenAkñúgenaHeLIy .
 ]TahrN_³ Link RbePTenHKWman Router cMnYnBIr)anP¢ab;eday Telephone line b¤
T-Line

 vaminRtUvkarsßabna Network Address enAelIRbePT Link enaHeT .

 KMnUstag Router enHtMNageday Nodes ehIy Link KWtagedayTisedA Edge
BIrP¢ab;eTA Node, Router nimYy²man Neighbor EtmYyKt;enAelIExS LinkrvagKña .

Prepared By Mr.Hang Vannak 41

Point-to-point Link

Prepared By Mr.Hang Vannak 42

Transient Link

 Transient link KWCa Network mYyman Router mYycMnYn)anP¢ab;CamYyva .

 Data GaceFVIdMeNIrqøgkat;BI Router mYyehIycakecjeTAqøgkat; Router
mYyepSgeTot .
 LAN TaMgGs; nig WAN xøHman Router BIrb¤eRcInCaRbePT Transient link

 enAkñúgkrNIenH Router nimYy²man Neighbors eRcIn .

 ]TahrN_³ BinitüemIl Ethernet enAkñúgrUb a (xageRkam)Router A man
Router B, C, D nig E Ca Neighbors rbs;va.

Prepared By Mr.Hang Vannak 43

Transient Link

Prepared By Mr.Hang Vannak 44

Stub Link

 Stub linkKWCa Network Edl)anP¢ab;eTA Router EtmYyKt; .

 Data packet cUleTA Network enHqøgkat; Router enH ehIycakecjBI

Network vijk¾enAEtqøgkat;tam Router enHd¾Edl .

 eyIgGacbgðajGMBIsßanPaBénkareRbIR)as; Router dUcCa Node nig kareRbI

R)as; Router Edl)ansßabnarYc sMrab; Network .
 eTaHbICaya:genHk¾edayk¾ Link KWmanTisedAEtmYyb:ueNÑaHBI Router eTA
Network .

Prepared By Mr.Hang Vannak 45

Stub Link

Prepared By Mr.Hang Vannak 46

Virtual Link

 enAeBl Link rvag Router BIrRtUv)anxUcGñkRKb;RKg Network GacbegIát

Virtual link rvagBYkvaedayeRbIpøÚvq¶ay muxCaRtUvkarqøgkat;tam Router

mYycMnYneTotCaminxaneLIy .

Prepared By Mr.Hang Vannak 47

Graphical Representation

 eyIgBinitüemIl internet tUcmYyeRbI Link State Routing nigemIlGMBIviFI

EdleyIgtagKMnUstagrbs;va .
 rUbxageRkamtag internet tUcmYyCamYynig Network cMnYnR)aMBIr nig
Router cMnYnR)aMmYy .

 Network cMnYnBIrCa Point-to-Point Network eyIgeRbInimiµtsBaØa N1, N2

sMrab; Transient nig Stub network .

Prepared By Mr.Hang Vannak 48

Example of an internet

Prepared By Mr.Hang Vannak 49

Graphical Representation

 BYkvaminRtUvkarsßabnanimµisBaØacMeBaH Point-to-Point network enaHeT .

 edIm,IbgðajKMnUstag internet eyIgeRbI Node ragkaersMrab; Router nigrag
BgRkeBIsMrab; Network dUcrUbxageRkam .
 KYrkt;sMKal;faeyIgman Subnetwork cMnYnbI .

Prepared By Mr.Hang Vannak 50

Graphical Representation

Prepared By Mr.Hang Vannak 51

Link State Advertisements

 edIm,IEckcayB½t’manrbs; Neighbor TaMgLay karqøgkat;nimYy²)anEck

cay Link state advertisement (LSA) .
 LSA eFVIkarRbkas;lkçN³ énkarqøgkat; Link GaRs½yeTAtamRbePTénkar

qøgkat; eyIgGackMNt; LSA 5ya:gxusKña ³

Prepared By Mr.Hang Vannak 52

Router Link Advertisements

 Router Link Advertisements )ankMNt;kar Link enaHfaCa True

Router .
 True router eRbI Advertisements enHedIm,IRbkasB½t’mansþIBIkar Link
rbs;vaTaMgGs; nigGVI²enARtg;TItaMgepSg²én Link (Neighbors) .

Prepared By Mr.Hang Vannak 53

Router Link Advertisements

Prepared By Mr.Hang Vannak 54

Network Link Advertisements

 Network Link advertisements )ankMNt;kar Link sMrab; Network .

 Router Edl)aneRCIserIsTukCamunKWCatMNagén Transient network

Edl)aneFVIkarEckcayRbePTén LSA packet .

 Packet Rbkasfaman Router TaMgGs;)anP¢ab;eTA Network

dUcrUbxageRkam³

Prepared By Mr.Hang Vannak 55

Network Link Advertisements

Prepared By Mr.Hang Vannak 56

Summary Link to Network

 Routing link nig Network link advertisement man Area CaeRcInP¢ab;Ca

mYyB½t’manGMBI Router link nig Network link enAxagkñúg Area .
 b:uEnþ Router RtUvEtdwgGMBI Network xageRkArbs;vapgEdr ehIy Area
border Gacpþl;B½t’manenH)an .

 Area border router manskmµPaBeRcInCag Area mYy .

 vaTTYl Routing link nig Network link advertisement ehIybegáIt

Routing table sMrab; Area nimYy² .

Prepared By Mr.Hang Vannak 57

Summary Link to Network

Prepared By Mr.Hang Vannak 58

Summary Link to Network

 Router R1 KWCa Area Border Router vaman Routing Table cMnYnBIr Routing
Table mYysMrab; Area 1 nig Routing Table mYyeTotsMrab; Area 0 .

 Router 1 man Area 1 manP¢ab;CamYyB½t’manCaeRcIn CaviFIsaRsþsMrab;eTA [dl;

Network EdlmanTItaMgenAkñúg Area 0 .

 kñúgmeFüa)aydUcKañenH Router 2 man Area 2 manP¢ab;CamYyB½t’manCaeRcIn

CaviFIsaRsþsMrab;eTA [dl; Network EdlmanTItaMgenAkñúg Area 0 .

Prepared By Mr.Hang Vannak 59

Summary Link to AS Boundary Router

 karbgðaj]eXIjfa Advertisements GnuBaØat[RKb; Router saÁl;tMél

edIm,IeTA[dl; Network TaMgGs;enAxagkñúg Autonomous System .
 b:uEnþGMBI Network xageRkA Autonomous System enaHetIvaya:gNaEdr ?
 ebI Router enAxagkñúg Area cg;bBa¢Ún Packet eTAxageRkA AS vaRtUvEtsÁal;
pøÚvbBa¢ÚnCamun edIm,Ieq<aHeTA Autonomous boundary Router, Summary
link to AS boundary router CaGñkpþl;B½t’manenH .

Prepared By Mr.Hang Vannak 60

Summary Link to AS Boundary Router

Prepared By Mr.Hang Vannak 61

External Link

 eTaHbICakarbgaðj[eXIj advertisements EdlGnuBaØat[ Router nimYy²

sÁal;enApøÚveq<aHeTA AS boundary Router k¾eday k¾B½t’manenHenAminTan;
RKb;RKan;enAeLIyEdr .
 Router enAkñúg AS cg;dWg Network TaMgLayEdlGacrk)anenAxageRkA AS,
external link advertisements vanigpþl;B½t’manenH .

 AS boundary router man AS CaeRcInEdlenAkñúgenaHmantMél Network

nimYy²enAxageRkA AS edayeRbI Routing table mbegIáteLIgeday Exterior
Routing Protocol .

Prepared By Mr.Hang Vannak 62

External Link

Prepared By Mr.Hang Vannak 63

Dijkstra Algorithm

 edIm,IKNna Routing table rbs;va Router nimYy²Gnuvtþn_tam DA .

 Dijdkstra Algorithm (DA) KNnaRbEvgpøÚvxøIbMputrvagcMNucBIrenAelI

Network edayeRbI Graph EdlbegIáteLIgeday Node nig Edge .

 Algorithm )anEck Node eTACaBIrQutKW Tentative nig Permanent .

 eKGacpþl;B½t’manedIm,IkMNt; Algorithm edayeRbICMha‘ndUcxageRkam ³

Prepared By Mr.Hang Vannak 64

Dijkstra Algorithm

1- cab;epþImBI Local Node (Router) Ca Root rbs; Tree .

2- sßabnatMélén 0 cab;BI NodeenH ehIybegáItvaCa Permanent rbs;va .

3- BinitüemIl Node nimYy²EdlenAVitxagén Node EdlEdleK)ankMNt;faCa

Permanent Node cugeRkay .

4- sßabnatMélt²KñaeTA Node nimYy²edIm,IbegáIt Tentative (karsakl,g)

rbs;va .

Prepared By Mr.Hang Vannak 65

Dijkstra Algorithm

5- enAkñúgcMeNambBa¢Ién Tentative Node:

1- EsVgrk Node NaEdlmantMélt²tUcbMput ehIybegáItCa Permanent
rbs;va .
2- ebI Node mYyGac)aneTAdl; kñúgenaHmanTisedAeRcInCagmYy.
-RtUveRCIserIsykTiedANaEdlmantMélt²KñaxøIbMput .
6- Gnuvtþn_tamCMha‘nTI 3dl;TI 5 rhUtdl; Node nimYy²køayCa Permanent .

Prepared By Mr.Hang Vannak 66

Dijkstra Algorithm

 rUbxageRkam bgðajBICMha‘nmYycMnYnén Dijkstra Algorithm Gnuvtþn_elI

Node A én]bkrN_rbs;eyIgelI internet .

 kt;sMKal;ebI Network GaceTAdl; tamry³énkarqøg;kat;kñúgTisedABIr

EdlmantMélBIrepSgKañ TisedAmYymantMéltUcCagRtUv)anrkSaTuk rIÉ
TisedAmYymantMéltFMCagRtUv)anlb;ecal .

Prepared By Mr.Hang Vannak 67

Dijkstra Algorithm

Prepared By Mr.Hang Vannak 68

Routing Table

 Router nimYy²eRbI Shortest Path Tree method edIm,Isßana Routing

Table rbs;va .

 Routing Table bgðaltMélsMrab;eTAdl; Network enAkñúg Area .

 edIm,IEsVgrktMélsMrab;eTA[dl; Network xageRkAén Area, Router eRbI

Summary Link to Network, Summary Link to Border Router
dUcRubxageRkam³

Prepared By Mr.Hang Vannak 69

Link state routing table for router A

Network Cost Next Router Other Information

N1 5 C

N2 7 D

N3 10 B

N4 11 D

N5 15 C

Prepared By Mr.Hang Vannak 70

Path vector routing table

Network Next Router Path

N01 R01 AS14, AS23, AS67

AS22, AS67, AS05,

N02 R05
AS89

AS67, AS89, AS09,

N03 R06
AS34

N04 R12 AS62, AS02, AS09

Prepared By Mr.Hang Vannak 71

Path vector messages

Prepared By Mr.Hang Vannak 72