Professional Documents
Culture Documents
Marsrutizaciis Algoritmebi Kompiuterul Qselebsi: O. Qartvelisvili, M. Qartvelisvili
Marsrutizaciis Algoritmebi Kompiuterul Qselebsi: O. Qartvelisvili, M. Qartvelisvili
qarTveliSvili
#teqnikuri universiteti@
saq
qarTveloss teqnikur
ri universsiteti
o. qar
rTveliS
Svili, m.. qarTvel
liSvili
i!
!
!
marSru
utizac
ciis algori
iTmebi
i komppiuter
rul
q
qseleb
bSi
damtkic
cebulia stu
u-s saredaqcio
o-sagamomceml
lo
sabWos mier
Tbilis si
2006
uak 681&3
D1=0.
(2) aris belmanis gantoleba, romlis amoxsna iZleva umokles gzebs.
mocemuli algoriTmSi jer ganixilaven i-ur kvanZs da gadaadgildebian uku
mimarTulebiT, sanam ar miaRweven 1 kvanZs. amis gamo am algoriTms agreTve
uwodeben uku Zebnis algoriTms (Backward Search Algorithm).
arsebobs mocemuli algoriTmis ganawilebuli realizacia, romelic
farTodaa gamoyenebuli TCP/IP qselebSi. mas Cven Semdgom ganvixilavT.
dikstras algoriTmi
floid-uorSelis algoriTmi
ganvixiloT algoriTmis blok-sqema:
zvavuri algoriTmi
Sesabamisad
∂D(x)/∂xp=Σ D'ij.
(i,j)∈p
aqedan Cans, rom ∂D(x)/∂xp iqneba mTeli gzis sigrZe, Tu D'ij pirveli
rigis warmoebuls miviRebT yoveli (i,j) xazis sigrZed. amitom ∂D(x)/∂xp
sidides uwodeben p gzis pirvelwarmoebul sigrZes.
Tu SevajamebT (3), (4) da (5) gamosaxulebebs, miviRebT
Σ Σ (∂D(x*)/∂xp)(xp-xp*)≥0, xp≥0,
w∈W p∈Pw
D(x)=(1/2)(x12+x22+0,1x32)+0,55x3.
vipovoT amonaxsni jer analizuri meTodiT: mtkicdeba, rom
* * * * * *
x ={x1 ,x2 ,x3 } optimaluri amonaxsnisaTvis x1 =x2 , amitom SesaZloa
Semdegi ori SemTxveva: a) x3*=0 da x1*=x2*=1/2; b) x3*=β da x1*=x2*=(1-β)/2.
es ukanaskneli SemTxveva SeuZlebelia, radgan Tu x3*>0, es niSnavs, rom
∂D(x*)/∂x3 ≤ ∂D(x*)/∂x1, anu 0,1β+0,55 ≤ (1-β)/2, rac aSkarad
SeuZlebelia. amitom optimaluri amonaxsnia x*=(1/2,1/2,0).
axla ganvixiloT am amocanis amoxsnis procesi frenk-volfis meTodiT.
TiToeuli xazis pirvelwarmoebuli sigrZe iqneba:
∂D(x)/∂x1=x1, ∂D(x)/∂x2=x2, ∂D(x)/∂x3=0,1x3+0,55.
cxadia, rom umoklesi gza iqneba an x1 an x2, e.i. imisda mixedviT x1≤x2,
Tu x1>x2, Sesabamisi nakadi umoklesi gziT iqneba x =(1,0,0) an x =(0,1,0).
amitom yovel iteracias eqneba Semdegi saxe:
#include <stdio.h>
#include <iostream.h>
int main ()
{
cout<<"Network Metric Table"<<endl<<endl;
for (int i=0; i<NODE_NUM;i++)
{
for (int j=0; j<NODE_NUM;j++)
{
short SP;
SP = Bellman_Ford(i,j);
cout<<SP<<" ";
}
cout<<endl;
}
return 0;
}
#include <stdio.h>
#include <iostream.h>
int main ()
{
cout<<"Network Metric Table"<<endl<<endl;
for (int i=0; i<NODE_NUM;i++)
{
for (int j=0; j<NODE_NUM;j++)
{
short SP;
SP = Dijkstra(i,j);
cout<<SP<<" ";
}
cout<<endl;
}
return 0;
}
orive programisaTvis miRebulia Sedegi, romelic warmoadgens zemoT moyvanili
qselis umoklesi gzebis tabulas:
Network Metric Table
0 2 5 3 5 6 6
2 0 3 1 3 4 4
5 3 0 2 2 1 1
3 1 2 0 2 3 3
5 3 2 2 0 1 3
6 4 1 1 3 0 2
6 4 1 3 3 2 0
5. dinamiuri marSrutizaciis protokolebi
5.1. RIP
5.2. OSPF
5.3. EGP
EGP miekuTvneba gaare marSr
E rutizaciiis protokolebis ojaxs, romlebic
r
axden
nen marSrrutebis mi imocvlas xva avtonomiur sistemebs Soris.
s sxvadasx S es
prottkoli Sei iqmna im dros,
d roc
ca internneti jer ganviTareebis proc
cesSi iyo
da amitom
a xaasiaTdeba simartiviT. EGP protkol li moqmeddebs avto
onomiuri
sisteemebis saasazRvro marSrut tizatorebbze. EGP-s
s ar gaaaCnia marS
Srutebis
gamoT
Tvlis daamoukideb beli alggoriTmi. is mxol lod mimoc cvlis moonacemebs
sasaz
zRvro mar rSrutizatorebs Soris.
S EGPP qsels Semdegi
S st
truqturaa gaaCnia:
i
imis miuxxedavad, rom EGGP warmoaadgens dinamiuri
d marSrutizaciis
prot tkols, misi
m muS
Saobis sqema
s met
tad mar rtivia. mas
m ar SeuZlia
intelleqtualu uri gadawyvetileb bebis miR
Reba marS
Srutizaciis Sesax xeb. misi
Setyo obinebebi Seicaven informac
cias mxollod qsellebis miRw
wevadobis
s Sesaxeb,
e.i. miTiTebas
m s, rom garkveul qselebSi i sainformacio paketebi
p SeiZleba
moxvddnen garkveuli mar rSrutizaatorebis gavliT.
EGP asrul
E lebs sam ZiriTad funqcias::
• EGGP marSrutizatoorebi mu
uSaobisas
s qmnian mezobeelTa si
imravles,
roomlebTan erTad koleqttiurad xmarobenn informacias qselebis
mi
iRwevadobis Sesaxeb.
• EGGP marSruutizatorrebi perio
odulad arkveven mezobelT Ta funqciionirebis
saakiTxs.
• EGGP marSrrutizatoorebi agz zavnian koreqtire
k ebis Settyobinebeb
bs Tavis
avtonomiurr sistemis
s farglebSi qseleebis miRwevadobis Sesaxeb.
5.4. BGP
1. B. Kagan. Computers, computer systems and networks. Mir Publishers Moscow, 1988
2. Dimitri Bertsekas, Robert Gallager. Data networks. Prentice Hall International Inc, 1987
3. В. Золотов. Протоколы Internet. BHV - Санкт-Петербург, 1998
4. Stan Schatt. Linking LANs. McGraw Hill, 1995
5. Bassam Halabi. Internet routing architectures. Cisco Press, 1997
6. Chris Lewis. Cisco TCP/IP Routing Professional Reference. McGraw Hill, 1997
7. Spohn, Darren L. Data network design. McGraw Hill, 1997
Sinaarsi
Sesavali ..................................................................................................... 3
1. marSrutizaciis algoriTmebis klasifikacia da maTi parametrebi 5
2. marSrutizaciis algoriTmebi ....................................... 8
3. marSrutizaciis algoriTmebis SedarebiTi analizi 29
4. mocemuli algoriTmebis programuli realizaciis magaliTebi 37
5. dinamiuri marSrutizaciis protokolebi ......... 41
6. marSrutizaciis protokolebis SedarebiTi analizi 62
daskvna ........................................................................................................ 65
literatura .......................................................................................... 66