ng dng Tr tu nhn to trong bi ton nh tuyn QoS

PGS.TS H Anh Tu Nguyn Trung Kin Tr tu nhn to (TTNT) l mt lnh vc ca khoa hc v cng ngh m phng cc kh nng ca tr tu v tr thng minh ca con ngi, bit suy ngh v lp lun gii quyt vn , bit giao tip, bit hc v t thch nghi gii cc bi ton phc tp nh: nhn dng nh, cng ngh robot cng nh mt s cc vn trong truyn thng nh bi ton nh tuyn QoS (QoSR). Bi bo ny phn tch hng s dng TTNT vo vic nh tuyn QoS. Gii thiu nh tuyn cht lng dch v l vic tm ng i tho mn nhiu rng buc ng thi cc yu cu v QoS (tr, trt, mt gi.. ). Bi ton ct li ca nh tuyn QoS l bi ton a rng buc ti u MC(O)P c pht biu nh sau: Xt mng G(N, E). Mi link uv E c biu din bi mt vector trng s vi m phn t l cc thng s ca link wi(uv)0 vi mi 1 i m, vn t ra y l tm mt tuyn P t nt ngun s n nt ch d tho mn biu thc

v di l(P) ti thiu: l(P)<l(P) trong s mi tuyn P c th c gia s v d MC(O)P c chng minh thuc dng NP-y , vic gii bi ton ny khng th tin hnh trc tip c m phi thng qua cc phng php khc nhau trong c phng php s dng Tr tu nhn to (TTNT). TTNT c hai trng phi l TTNT truyn thng v Tr tu tnh ton. Trng phi Tr tu nhn to truyn thng bao gm mt s phng php nh: H chuyn gia, lp lun theo tnh hung, mng Bayes Trng phi Tr tu tnh ton nghin cu vic hc hay pht trin lp gm cc phng php nh dng mng n-ron, h m, l thuyt tin ho di truyn, m phng hnh vi.. Cc phng php TTNT c s dng trong nh tuyn Best Effort ni chung v nh tuyn QoS ni ring thng l cc phng php TTNT thuc loi th hai. Cc phng php ny cn c gi l siu th nghim (Meta-Heuristic) v bn cht n s dng cc tri thc, kinh nghim (heuristic) nhng c khi qut ho thnh phng php lun gii bi ton tng qut. 1

ng dng TTNT trong QoSR Mng n-ron Mng n-ron nhn to pht trin t nghin cu v tr tu nhn to c gng m phng b no con ngi trn c s ghp cc n-ron nhn to li theo mt quy tc no . Mt lp trong mng n-ron c s dng trong nh tuyn l mng n-ron Hopfield[0] (HNN) do John Hopfield v Tank sng ch. Cc n-ron Hopfield c mt c tnh l lun hi t v trng thi nng lng ti thiu, li dng tnh cht ny HNN c ng dng trong bi ton nh tuyn. y, mng thc s c nh x sang mt mng n-ron sao cho u ra ca mng n-ron c th gii m thnh nghim bi ton, tip theo s cn xy dng mt hm nng lng E m cc tiu ca n ng vi nghim tt nht, khi cho mng n-ron ny hot ng vi u vo t cu trc mng, mng s hi t v trng thi nng lng ti thiu ng vi ng i ngn nht cn tm trn mng thc Trong vic s dng HNN cho nh tuyn BE, Ali v Kamoun [0] xut gii php c kh nng thch nghi vi s thay i cc iu kin bn ngoi (s nt mng, s tuyn), tuy nhin, xut ny gp phi cc vng lp v hi t chm. Park v Choi [0] sa i [0] ci tin kh nng hi t v nghim ti u hn, tuy nhin gii php ny li qu ph thuc vo kin trc mng. C.W. Ahn [0] ci tin [0] nhm tng tc hi t ng thi ci thin tnh ti u ca ng tm c, ng thi khc phc c nhc im ph thuc vo kin trc mng ca [0]. F.Araujo[0] xut s dng mng HNN hai lp, gii php ny ci thin c kh nng hi t so vi HNN 1 lp trong [0] v s dng s n-ron t hn. S.Hong, S.Kim [0] xy dng hm nng lng E bng cch biu din m hnh mng di dng cc vector gia cc nt mng, mi tuyn kt ni gia hai nt mng c biu din bng mt n-ron. Sau khi tm c biu thc ng ca mi n-ron da vo phng php gim nhanh nht (Steepdest descent direction). i vi bi ton QoSR, Meng Wei, Yu Bin[0] xut xy dng ma trn Cost W kch thc nxn (n l s nt) trn c s cc tham s QoS, mt tham s kt hp wij biu din cost gia nt i v j bt k, hm nng lng E c xy dng trn c s s dng cc k thut tng t nh trong bi ton ngi bn hng (TSP) Gii thut di truyn Gii thut di truyn (GA) l mt k thut my tnh nhm tm kim gii php thch hp cho cc bi ton ti u t hp. GA vn dng cc nguyn l ca tin ha nh di truyn, t bin, chn lc t nhin, v trao i cho m phng qu trnh tin ho ca mt tp hp nhng i din tru tng (gi l nhng nhim sc th) ca cc gii php c th (gi l nhng c th) cho bi ton ti u ha v mong mun cho ra nhng gii php tt hn ging nh s chn lc trong t nhin. Vic p dng GA vo gii cc bi ton nh tuyn c thc hin theo mt s bc: (1) M ho bi ton t bi ton nh tuyn sang bi ton tin ho trong t nhin (la chn cc cp nhim sc th u tin, chn gen), (2) Xy dng hm ph hp (fitness) hay hm pht (penalty) v (3) thc hin hot ng di truyn lp i lp li (lai to, t bin v la chn cc c th ti u lm u vo cho chu trnh tip theo). Theo l thuyt tin ho, hot ng di truyn s cho ra i cc c th con theo chiu hng thch nghi tt hn c ngha l cc tp dn c sau c s lng cc c th tt hn s tng so vi cc th h trc v sau mt s vng i th s t ti s ti u ton cc.

M.Munetomo[0] xut gii php c tn l GLBR, trong xut ny gen c m ho trong nhim sc th ging nh th t ca nt trong mng v v vy nhim sc th c di thay i, tp dn c c kch thc khc nhau v hot ng di truyn ngu nhin. GLBR c hn ch l do hot ng di truyn l ngu nhin nn th h con chu c th khng ph hp theo hng mong mun v kt qu l vic giao tip gia 2 nt ln cn khng tn ti v ko theo l cn c cc hot ng phc tp hn tm ra tuyn giao tip mi. Mt khc, do tp dn c c kch thc khc nhau nn vic lai to cho phc tp L.Barolli[0] xut gii php c tn l ARGA. y mng c biu din theo m hnh cy v cc gen c biu din bng cc mi ni trn cy (Junction). Bng cch m ho ny chiu di ca cc nhim sc th l nh nhau v cc hot ng di truyn c thc hin trn cc mi ni ny v vic tm kim ng lun hp l v khng phi kim tra li nh trong [0]. Vi vic m ho gien nh trn gip cho ARGA trnh c vic nh tuyn lp ng thi s lng gen trong nhim sc th gim xung v vic tm kim ng i tr nn d dng hn Barolli[0] xut gii php nh tuyn QoS dng GA c tn l ARGAQ trn c s nng cp [0]. ARGAQ p dng cho 2 tham s QoS l Delay (DT) v Transmission Success rate (TSR). Hai tham s QoS c gom thnh mt tham s duy nht v dng gii thut GA cho tham s kt hp ny. Hu Shiyu[0] xut s dng GA gii bi ton QoSR dng RSP (rng buc tr v ti thiu ho gi thnh) cc tham s QoS c kt hp thnh mt tham s n bng biu thc tuyn tnh trc khi s dng gii thut GA M phng hnh vi TTNT theo trng phi da trn hnh vi hnh thnh trn s quan st t nhin cc hnh vi ca mt c th hay mt qun th sinh vt no v c gng m phng li cc hnh vi . Mt v d tiu biu ca cc sinh vt sng trong t nhin l loi kin, trong vic tm kim thc n hng ngy kin c th tm ra ng i ngn nht t nh n ch tm thy thc n. Hnh vi ca kin c th m t ngn gn nh sau: Kin c kh nng nhn ra ng i trc ca cc c th khc cng n thng qua mt hp cht gi l cht dn d (pheromone), mi khi kin i qua n li mt cht cht dn d ny v cc con kin khc c th c nhn ra. Xc xut chn ng i ca cc con kin n sau ph thuc t l vo lng cht dn d c li trn ng . Trong trng hp ng i no c nhiu kin i qua lng cht dn d trn cng nhiu v theo nhiu con kin tip theo s chn ng , ti mt mc no phn ln s kin mi s i theo ng c nhiu cht dn d nht th coi nh ng ngn nht. Da trn phn tch hnh vi ca kin ngi ta xy dng gii thut kin s dng trong bi ton tm ng ngn nht, hai bc c bn trong vic s dng h kin trong bi ton tm ng l (1) Cch thc la chn ng i da trn phn b ca mt cht dn d trn cc tuyn v (2) Cch thc phn b (cp nht) cht dn d trn cc tuyn i qua Di Caro v Dorigo[0] xut gii php AntNet da trn hng tip cn Mobile Agent kt hp vi hnh vi ca loi kin cho bi ton nh tuyn BE. Trong gii php ny mng c biu din bi mt ma trn NxL (N l s nh v L l s cnh), gi tr ghi trong ma trn l xc xut Pij v kh nng la chn ng i n ch. Xc sut ny cng cao th kh nng tm n ch qua tuyn tng ng cng ln. Gi tr lu trong ma trn ny c kim tra khi cn tm ng i v cp nht khi tuyn c chn. 3

Firat Tekiner[0] sa i [0] vi vic a ra mt s ci tin nhm ci thin tr trung bnh cho cc gi tin c nh tuyn gm: Loi b cc gi tin tn ti lu trn mng, hn ch nh hng ca tham s r trong [0] v gii hn s lng cc c th kin trong h thng L.Min, J.Yang[0] ci tin tng tc s hi t ca [0] da trn mt s thay i nh: Lng cht dn d trn mi tuyn (i,j) lun nm trong mt khong tmin tmax v t bng tmin hoc tmax khi lng cht dn d vt qu khong ny. Khi khi to, lng cht dn d trn mi tuyn c gi tr tmin. Ti mi vng lp, ch nhng con kin n ch thnh cng mi phn b thm lng cht dn d trn cc tuyn i qua. Z.Subing L.Zemin[0] ng dng gii thut kin cho QoSR, tc gi xut vic cp nht cht dn d lm 2 loi: cp nht cc b (local) v cp nht ton cc (global). Quy tc cp nht cht dn d cc b a vo nhm trnh trng hp kin s tm kim trong mt khng gian hp ln cn ca cc tuyn c chn trc v dn n ti u cc b. Quy tc cp nht cht dn d ton cc nhm l chn ng trn cp ton cc ti u hn sau qu trnh chn ng cc b. Cc tham s QoS c kt hp nhau thnh mt tham s QoS thng qua biu thc kt hp, ng ti u s tnh trn tham s kt hp ny v kt qu s cn kim tra vi iu kin rng buc Liliana Carrillo[0] xut gii php nh tuyn AntNet-QoS ci tin da trn [0]. AntNetQoS khuyn ngh t chc nh tuyn cho cc lp QoS khc nhau. Mi lp ny c phn bit bi cc thng tin trong cc gi tin n (trng ToS ca gi IP hay DSCP ca Diffserv). Mi lp QoS ny coi nh mt mng c lp v s dng thut ton [0] ring cho lp . L thuyt m (Fuzzy) Trong bi ton nh tuyn vic tm ng da vo thng tin v mng ti thi im tnh ton nhng trong thc t cc s liu ny i khi khng phi hon ton chnh xc. S khng chnh xc ca thng tin ny c th do nhiu nguyn nhn khc nhau nh: vic ly mu thng s QoS c sai s, s thay i cc thng s trn mng nhanh hn s cp nht thng tin... y, l thuyt m hng ti l kh nng x l cc thng tin nh tnh nh con ngi (c tnh cm tnh khng chc chn) thay v vic x l vi cc thng tin chnh xc (nh lng) tm ra ng i i ti u. L thuyt m c dng trong nh tuyn QoS thng da trn s kt hp ca mt tham s QoS vi mt yu t khc gin tip tc ng ln tham s QoS ny thnh mt tham s m trc khi x l. V d, trong xut [0] tc gi s dng 2 tham s QoS l tr v s s dng ti nguyn trn cc tuyn (link). Trong mt xut khc [0] tc gi kt hp 2 tham s l tr v ti ca h thng. Nhn chung, l thuyt m thng thch hp hn i vi vic nh tuyn trong cc mng c tnh cht ng cao nht l cc mng mobile Ad-hoc (MANET) v phn ln cc xut lin quan n nh tuyn s dng l thuyt m tp trung mng ny. Nhn xt Phng php TTNT tn dng c cc tri thc ca con ngi qua lch s pht trin lu di v c khi qut ha thnh cc phng php gii y mt bi ton v cho li gii r rng, trong sng. Ngoi ra mi phng php c mt s u im ring khc nh: l thuyt m h tr tm ng i trong iu kin thng tin u vo cha y hoc thiu chnh xc m cc k thut tnh ton chnh xc khng thc hin c, phng php mng n-ron c th thc hin 4

cng ho bng cc mch in t x l nhanh v c th dng trong cc h thng chuyn dng, phng php da trn m phng hnh vi loi kin c th t ti bi ton ti u ton cc c kh nng thch nghi vi s thay i ca mng mt cch linh hot, bn cnh phng php ny cng vi GA c kh nng s dng k thut tnh ton song song tng hiu nng v do vy c th thch nghi vi mng ln. Tuy nhin, cc phng php TTNT cng c mt s hn ch l: V bn cht, TTNT thuc dng Meta-heuristic n c khi qut cao bng mt thuyt tng qut (nh GA chng hn) nn nhiu khi n khng tn dng c u vit ca cc k thut heuristic n l, Cc phng php TTNT thuc dng tnh ton chm do bn cht ca vic tnh ton c tnh lp li cng vi s km hiu qu ca cc ton t nh lai to, bin d (trong GA), phn b cht dn d (h kin).. lm cho s vng lp c th rt ln Vic nh x bi ton thc t sang mt trong cc dng ca TTNT l mt vic rt kh, khng c phng php l thuyt cho cc vn ny v nhiu khi vic ny dn n kt qu khng mong mun: khng hi t, hi t chm, hi t sm, ti u cc b.. Mt vi phng php TTNT c th c tng tc bng tnh ton song song (h kin, GA) hay cng ho (mng n-ron) nhng li gp vn gii hn v kch thc ca mch in t hay cu trc h thng phc tp kh thch nghi vi bi ton ln, thay i nhanh Vic nh x bi ton QoSR sang cc phng php TTNT kh hn nhiu vi trng hp nh tuyn BE, do vy s lng xut dng TTNT cho QoSR tng i t v thng cho mt n hai tham s QoS. Cc tham s QoS ny c chuyn v mt tham s chung vi mt biu thc kt hp no . Ngoi ra, trong cc xut c phn tch trn y cc kt qu tnh ton thc nghim vi bi ton QoSR cng cn rt hn ch v cha c so snh vi cc phng php khc li dng im mnh v hn ch cc mt hn ch ca mi phng php ngi ta cng xut mt s hng kt hp cc phng php li vi nhau nh: Fuzzy v n-ron[0], h kin v mng n-ron, GA v n-ron[0], GA v Fuzzy[0] .. Kt lun TTNT c s dng trong QoSR bao gm l thuyt m, mng n-ron, gii thut di truyn v m phng hnh vi gp phn lm phong ph thm cc phng php nh tuyn. Cc phng php TTNT s dng c nhiu tri thc ca con ngi, c th tm ra li gii ti u cho bi ton nh tuyn ni chung v nh tuyn QoS ni ring nhng chng thuc dng tnh ton chm, vic hng n cc thut ton hiu qu c kh nng trin khai thc t vn cn khong cch cn khc phc. Mt s thuc tnh thuc v bn cht ca TTNT c th gip ci thin tc tm nghim nh vic cng ho bng cc mch in t hay s dng tnh ton song song ang c nghin cu v cc phng php TTNT c th s ng vai tr quan trng hn trong tng lai. Hin ti, vic gii bi ton QoSR ang tp trung theo hng s dng quy hoch ng v cc k thut heuristic n l ci thin cc phn ca bi ton thay v s dng cc Meta-heuristic v t c mt s bc tin quan trng . TI LIU THAM KHO [1]. Julia K. Brande, Computer Network Routing with a Fuzzy Neural Network, November 7, 1997 Blacksburg, Virginia 5

[2]. William M. Spears, Using Neural Networks and Genetic Algorithms as Heuristics for NPComplete Problems, Naval Research Laboratory, Code 5510 Washington, D.C. 203755000,1990, [3]. ALI, M.K.M., and KAMOUN, F. Neural networks for shortest path computation and routing in computer networks, IEEE Trans. Neural Netw., 1993, [4]. Sun-Gi Hong, Sung-Woo Kim, The Minimum Cost Path Finding Algorithm Using a Hopfield Type Neural Network, Korea Advanced Institute of Science and Technology 373-1 Kusongdong, Yusong-gu, Taepn 305-701, Korea,1995, [5]. R. Rojas, The Hopfield Model, Neural Networks, Springer-Verlag, Berlin, 1996 [6]. Gianni Di Caro and Marco Dorigo, A Mobile Agents Approach to Adaptive Routing, IRIDIA University Libre de Bruxelles av F Roosevelt CPBrussels Belgium,1997, [7]. PARK, D.c., and CHOI, SE.A neural network based multidestination routing algorithm for conmumcation network. Proc. Jnt. Conf. Neural Networks, Anchorage, USA, 1998, [8]. M.Munetomo, Y.Takai and Y.Sato, An Adaptive Routing Algorithm with Load Balancing by a Genetic Algorithm, Trans. of IPSJ, 39 (2) (1998) [9]. Filipe Araujo, B.Ribeiro, L.Rodrigues, A Neural Network for Shortest Path Computation, Universidade de Lisboa Campo Grande, 1700 Lisboa Portugal, 2000, [10]. Zhang Subing Liu Zemin, A QoS routing algorithm based on ant algorithm, Beijing University of Posts and Telecom, Beijing 100876,P.R.China, 2000, [11]. L.Barolli, A.Koyama, T.Yamada, and S.Yokoyama, An Intelligent Policing-Routing Mechanism Based on Fuzzy Logic and Genetic Algorithms and Its Performance Evaluation, IPSJ Journal, 41 (11) (2000) [12]. C.W. Ahn, R.S. Ramakrishna, Shortest path routing algorithm using Hopfield neural network, Kwang-Ju Institute of Science and Technology, Oryong-dong 1, Puk-gu, Kwang-Ju 500-712, Korea,2001, [13]. Chiang Kang Tan, The use of Fuzzy metric in QoS based OSPF network,University College London,2001, [14]. Leonard Barolli, A genetic algorithm based routing method using two QoS parameters, Proceedings of the 13th International Workshop on Database and Expert Systems Applications (DEXA02) 1529-4188/02 2002 IEEE, [15]. F.Tekiner, The Antnet Routing Algorithm - A Modified Version, CSNDSP20-22 July 2004 [16]. Hu Shiyu, Combining single metric aproach and Genetic Algorithm for QoS Routing Problem, Juornal of sourthwest Jiaotong University 2004 [17]. Liliana Carrillo, J.L Marzo, Pere Vil, A Quality of Service Routing Scheme for Packet Switched Networks based on Ant Colony Behavior, Universitat de Girona (UdG) Campus Montilivi, Edifici P-IV, 17071 Girona, Spain,2003, [18]. Lianying Min, Jinyong Yang, A Shortest-path Routing Based on Ant Algorithm, Journal of Communication and Computer, ISSN1548-7709, USA Sep. 2005, Vol2, No.9 , 2005, [19]. Shuchita Upadhayay, Performance Evaluation of Fuzzy Routing Algorithms for a New Fuzzy Mixed Metric Approach, IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.4, April 2008 [20]. Meng Wei, Yu Bin, A multiple constrained Qos routing algorithm based on hopfield neural network, School of Information Engineering, Tianjin University of Commerce, 300134, 2009, Bi vit do Cng ty Vin thng Quc t VTI ti tr