Enhanced Interior Gateway Routing Protocol(EIGRP) Tc gi: Trn Vn Thnh

Enhanced Interior Gateway Routing Protocol(EIGRP) Ln u tin c a vo s dng trong phin bn ISO 9.21, Enhanced Interior Gateway Routing protocol (EIGRP) l mt s nng cp ca IGRP. Bn cnh nhng tnh cht vn c IGRP l mt distance-vector protocol, EIGRP cn mang mt s tnh cht ca link state protocol. Tt c cc distance vector protocol nguyn thu u chy thut ton BellmanFord xy dng nn routing table. V nhc im chung ca chng l gp phi vn chng l gp phi vn chng loop v thi gian hi t ca cc distance vector protocol l rt ln, bi v mi router u chy thut ton Bellman- Ford sau khi thng tin nh tuyn t neighbor ri sau mi gi thng tin nh tuyn ti tt c cc neighbor. u im hn so vi distace vector protocol, link state protocol khng phi gii quyt vn chng loop v thi gian hi t rt ln bi v khng ging nh routing-by-rumor approach ca distance vector cc router link state c thng tin trc tip t tt c cc router chy cng routing protocol v mi router linkstate chy cc thut ton nh tuyn tnh tuyn ng ti u c lp vi s tnh ton u tin. Khng quan tm n vic chy cc thut ton nh tuyn xy ra trc hay sau khi xy dng topology database v chng thc hin cc qu trnh trn mt cch ring l. Nhng vi EIGRP th li hon ton khc bng cch s dng diffusing computations s tnh ton cc tuyn ng c thc hin trong s kt hp gia nhiu router_chnh iu t c s hi t rt nhanh trong khi vn loi b c s loop trn mng. 1. c trng ca EIGRP (Diffusing computations) EIGRP gi thng tin update ti tt c cc neighbor trc tip mt cch: nonperiodic, partial, and bounded. Nonperiodic: c ngha l thng tin update c gi mt cch khng nh k m thng tin update ch c gi mi khi mng c s thay i. Partial: c ngha l thng tin update trao i vi neighbor ch bao gm thng thay i ch khng gi ton b routing table. Bounded: c ngha l thng tin update ch gi cho router c cng process domain. Chnh nhng c trng lm EIGRP tn t bandwidth hn distance vector

protocol. Do EIGRP c th chy trn nhng ng truyn c bandwidth thp. Khng nhng vy m trn nhng ng truyn bandwidth thp ta cn iu chnh c s phn trm bandwidth dnh cho nh tuyn. EIGRP cn h tr authentication bng vic s dng cc bn tin m ho MD5. EIGRP l classless routing protocol, c ngha l gi subnet mask trong thng tin nh tuyn. c im cui cng l EIGRP khng ch h tr IP m cn h tr IPX v AppletTalk. 2. Operation of EIGRP Metric trong EIGRP s dng cng dng cng thc tnh metric ca IGRP nhng ln hn 256 ln khin cho vic tnh metric c m bo hn. EIGRP c 4 module chnh:

+ Protocol-Dependent Modules + Reliable Transport Protocol (RTP) + Neighbor Discovery/ Recovery + Diffusing Update Algorithm (DUAL) a/ Protocol-Dependent Modules EIGRP thi hnh module cho IP, IPX v AppleTalk bng cch mi module c giao mt nhim v xc nh ring bit. V d module IPX EIGRP c giao trch nhim trao i thng tin nh tuyn v mng IPX vi IPX EIGRP router v a thng tin vo module DUAL.

EIGRP t ng redistribution vi cc giao thc khc trong cc trng hp sau: + IPX EIGRP t ng redistribution vi IPX RIP v NLSP. + AppleTalk EIGRP t ng redistribution vi AppleTalk RTMP. + IP EIGRP t ng redistribution IGRP nu IGRP process c cng autonomous system. b/ Reliable Transport Protocol Reliable Transport Protocol (RTP) qun l vic phn pht packet EIGRP. Reliable c ngha l s phn pht c m bo v packet c phn pht mt cch trnh t. S phn pht trnh t (Ordered delivery) c m bo bi 2 s sequence trong packet. Mt gn cho router ri v gi tr ny tng ln mt gi tr mi khi router gi gi mt packet mi. V mt s sequence l ca packet cui cng nhn c t router ch. Tuy nhin trong vi trng hp RTP vn s dng unreliable delivery, khng c Ack v khng c s sequence. Cc gi tin trong EIGRP bao gm: Hellos: c s dng khm ph neighbor duy tr neighbor, Hello packet s dng multicast trao i v l unreliable delivery. Acknowledgments ( ACKs): l Hello packet nhng khng c data, ACK lun lun l unicast v l unreliable delivery. Updates: chuyn tr thng tin nh tuyn khng ging nh RIP v IGRP nhng gi ny ch c gi khi cn thit v ch bao gm thng tin cn thit v ch gi ti router yu cu. Khi update c gi bi mt router xc nh th n l unicast. Cn khi yu cu update c gi bi nhiu router khi topo mng thay i th n l multicast. Update packet lun lun l reliable delivery. Queries v Replies: c s dng bi DUAL finite state machine qun l diffusing computation. Query c th l multicast hay unicast v Reply lun lun l unicast. C hai packet ny u l reliable delivery. Bt c packet no l reliably multicast v khng nhn c ACK t neighbor th packet s c gi li bng unicast ti neighbor m khng gi li ACK . Nu khng nhn c ACK sau 16 ln gi li bng unicast th neighbor cng khai dead. Multicast flow timer: thi gian i mt ACK trc khi chuyn t multicast sang unicast.

Retransmission timeout (RTO): thi gian gia 2 unicast lin tip. Smooth round-trip time (SRTT): l khong thi gian trung bnh tri qua tnh t khi truyn packet ti neighbor n khi nhn mt ACK. C hai thng s Multicast flow timer v Retransmission timeout (RTO) u da trn SRTT. c/ Neighbor Discovery/Recovery Bng cch trao i bn tin Hello, EIGRP thit lp v trao i quan h vi neighbor router. Trong hu ht cc mng Hello packet l multicast vi chu k 5 giy tr i random timer ngn chn synchronization. Ch trn cc interface: X.25, Frame Relayv ATM vi tc access link l T1 hoc nh hn th Hello packet l unicast vi chu k 60 giy. Khi router nhn Hello packet t neighbor, trong packet c cha thng s hold timer. Hold timer bo cho router bit thi gian ch ti a cho Hello packet lin sau . Nu ht thi gian hold timer m router khng nhn c Hello packet t neighbor, th neighbor cng khai l unreachable v DUAL thng bo l mt neighbor. Hold timer gp 3 ln Hello timer. d/ The Diffusing Update Algorithm Trc khi tm hiu hot ng ca DUAL ta hy lm quen vi cc khi nim sau: Adjacency: khi khi ng router s dng Hello khm ph ng neighbor. Sau khi thit lp c quan h vi neighbor, router s nhn c update t neighbor. Thng tin update bao gm tt c tuyn ng m neighbor bit c v metric ca tt c cc tuyn . i vi mi tuyn, router s tnh c distance da trn nhng thng s m neighbor qung co. Feasible distance (FD): l metric nh nht ti ch. Feasibility condition(FC): l iu kin m advertised distance ca neighbor phi nh hn FD. Feasible successor: nu neighbor qung b advertised distance ca n theo mn FC th neighbor s tr thnh Feasible successor. Tt c cc Feasible successor c lu trong topology table. Successor: t topology table, n s tm route no c metric nh nht v lu n vo routing table. V neighbor qung b route s l Successor. The DUAL Finite State Machine Khi mt router khng thc hin diffusing computations th mi route s trng thi passive state. Khi router tnh ton li danh sch Feasible successor cho mt route bt c khi no mt input event xy ra. Input event c th l: + S thay i cost ca mt link ni trc tip.

+ S thay i trng thi (up hay down) ca link ni trc tip. + Khi nhn mt update packet. + Khi nhn mt query packet. + Khi nhn mt reply packet. Nu distance ti destination s c tnh ton li vi bc u tin l: local computation. C th xy ra cc trng hp nh sau: Nu FS khc c distance nh nht s tr thnh successor. Nu distance mi nh hn FD th FD s c update. Nu distance mi khc vi distance ang tn ti, update s gi ti tt c cc neighbor. Trong khi ang thc hin local computation th nhng route cn li vn trng thi passive state. Nu mt FS c tm thy update s c gi ti tt c cc neighbor nhng state khng i. Nu khng tm thy FS trong topology table th router thc hin diffusing computations v route s chuyn trng thi sang active state. Cho n khi diffusing computations chy xong v route s quay tr v trng thi passive state. Ch router khng th thc hin c nhng vic sau: Thay i successor ca route. Thay i distance m n qung b cho route . Thay i FD ca route. Ch l khi route chuyn sang active state n s khi to active timer nu ht thi gian ny m route vn khng chuyn c v passtive state th route s c cng b l Suck-in-active(SIA). 3. EIGRP Packet Formats EIGRP packet chnh l IP packet tng ng vi trng protocol number l 88 v kch thc ti a ca EIGRP chnh l kch thc cc i ca IP packet_thng l 1500 octet. Cu trc c th ca EIGRP packet nh sau:

Version: Opcode: xc nh loi EIGRP packet, kt qu c th nh bng sau:

Checksum: n tnh cho ton b EIGRP packet tr IP header. Flags: hin ti ch s dng 2 bit cui cng trong trng flag. Bit th 1 l bit bn phi l 0x00000001 l bit Init, cho bit EIGRP packet gi km theo gi ton b routing table khi thit lp quan h vi neighbor mi. Bit th 2 l 0x00000002 l bit Conditional Receive, c s dng trong thut ton c quyn Reliable Multicasting. Sequence: l trng 32 bit s dng bi RTP.