A multipath QoS routing algorithm based on Ant Net

Μέγεθος: px

Εμφάνιση ξεκινά από τη σελίδα:

Download "A multipath QoS routing algorithm based on Ant Net"

Ερατώ Νικολάκος
5 χρόνια πριν
Προβολές:

1 3 4 Vol CAA I Transactions on Intelligent System s Aug AntNet QoS, (, ) : AntNet,, QoS, AntNet QoS. QoS,, AntNet QoS,, QoS : ; ; QoS; : TP393 : A : (2008) A multipath QoS routing algorithm based on Ant Net ZHU Shang2m ing, GAO D a2qi ( School of Information Science and Engineering, East China University of Science and Technology, Shanghai , China) Abstract: This paper exam ines a mathematical model and data structure for a multipath QoS routing algorithm based on the AntNet algorithm. The p roposed algorithm selects nodes w ith a new rule considering both bandw idth and time2delay QoS constraints. Then it transfers data packets using the imp roved updating rule for nodal information and random ly chooses neighboring nodes to transfer data packets according to p robabilities in the routing table. Per2 form ance analysis and sim ulation results show that the multipath QoS routing algorithm based on AntNet converges faster and is more robust than other algorithm s. It can automatically adap t to dynam ic variations in network status while taking into account QoS constraints and load balancing. Keywords:AntNet; multipath routing; QoS; constraint on service quality ( ant colony, AC) M. Dorigo [ 22 ].,,.,, [ 320 ], G. D i Caro M. Dorigo (AntNet) [ 3 ]. AntNet 2 Agent, : : ( ). :. E2mail: zhusm@ ecust. edu. cn.., AntNet ( OSPF SPF ) [ 4 ]. AntNet,,, QoS, AntNet QoS,. AntNet Agent, 2 : F ant B ant. F ant, ; B ant, F ant

2 G (N, L ), N, L 2., 2, l L QoS, :.,, (pheromone),, P jd k d j, N k k, N k = { neighbors( k) }, j N k P jd =, d [, N ]. () s d p, B 0 s d, D 0, QoS s d, : m in{ bandw idth ( l), l p ( s, d) } B 0, (2) delay ( l) D 0. (3) l p ( s, d). 2 ( ), 2, F ant, B ant. 2,. S s2d ( k),, S s2d ( k) k s t k. F ant k, S s2d ( k) { ( j, t j ), ( j 2, t j2 ),, ( j k, t jk ) }. 2 : R k { Stat ( ), Stat ( 2 ),, Stat(N ) }.,, p i ( i =, 2,, m ), s d., k, Stat( k) =M k k AntNet M k, ( d, 2 d, W d ). d 2 d d, W d, k d, M k,,,, 2 AntNet QoS 2. AntNet.,, (4) : p jd = N k N k + ( N k - ) N k 2, j, d N k, j = d; - N k 2, j, d N k, j d, N k > ; N k ; j N k, d N k. (4) (4) ( ),, ; N k 2. 2 AntNet, ( ), k v, (5) p ( k, v) : d [, N ], N k = { neighbors( k) }. = max j N k P jd. (5) QoS,,,,,

3 4, : AntNet QoS 35, QoS,, k, N k, k N k v l ( k, v) B 0, : N k N k = { v: v N k, bandw idth ( k, v) B 0 }. (6) = { neighbors( k) }., : ) N k d, ; 2) N k, (7) P jd, P jd ; 3) N k,, ( 7) P jd, P jd P jd = l j = - P jd + l j + ( N k - ) q j N k q j j, j N k;, 0 l j. (7) : l j, k j, q j k j,, l j P jd.,,,, l j ;,, k, :, (8), (9). P id P id + r( - P id ), (8) P jd P jd - rp jd, j i, j N k. (9) : i, j, N k, d, r., r (0, ], (0) : r = c t bestd t t- d + c 2 t sup - t bestd ( t sup - t bestd ) + ( t k - d - t bestd ). (0) : c c 2, t k - d k d, t bestd W d d, t sup, () : t sup = d + d - W max. () :, W max, ( 0), 2 t k - d, r, : (2) r., s ( x) = r s ( r) s (). : s ( x),, x (0, ], a R +, + e a x N k (2) a N k N k, a, : k, (3) (4) d d + ( t k - d - d ), (3) 2 d 2 d + ( ( t k - d - d ) 2-2 d ). (4) : d d, 2 d,,, W W 5 ( / ). 2. 4,,, d,

4 352 3 D 0., (5), g ( x) = x,. (5) :, >, g ( x),, ( µ ),, =,.,,. AntNet s d,, k,, k v, ( 6) N k, : bandw idth ( k, v) = bandw idth ( k, v) - B 0. (6) AntNet, 2. 5 AntNet QoS ),, s ( ), d, 2), i j, l ( i, j), i,. 3),,.,,,,. 4) d,,, s, ( ), 5),, 6),, m 7),, 3 3.,, M, M, O (M N k )., M, O (M N k )., m, O (mm N k ). D ijkstra O (L + N logn ), L, N, M N k N, AntNet D ijkstra AntNet QoS, G p (N ), N p, (0, ], m s, 8 Mbp s., N, D ijkstra. 2,,.,

5 4, : AntNet QoS 353. Table Var ious param eters in sim ula tion s Name and simbol Values /bit 92 /bit W 50 AntNet N = 50, p = 0. 2 N = 25, p = 0. 2 Fig. PDF of the hopcount of AntNet algorithm paths for N = 50, p = 0. 2 and N = 25, p = c 0. 7 c a N p B 0 /Mbp s 4 D 0 /m s 2 /m s AntNet N = 25, p = 0. N = 25, p = 0. 2 Fig. 2 PDF of the hopcount of AntNet algorithm paths for N = 25, p = 0. and N = 25, p = 0. 2 /m s 0 / bit AntNet D ijkstra (p robability density function, PDF),, AntNet, p, N, N = 50 p = 0. 2 N = 25 p = ,, AntNet, D ijk2 stra. N = 50 p = 0. 2, D ijkstra AntNet , N = 25 p = 0. 2, D ijkstra AntNet , N, p, N = 25 p = 0. N = 25 p = AntNet = 3 00 Fig. 3 PDF of the hopcount of AntNet algorithm paths for =, 3 and 00.,, ( ), ( ), 2 ( ). N = 25 p = 0., D ijkstra AntNet , N = 25 p = 0. 2, D ijkstra AntNet , N

354 3 p,.,,,, AntNet D ijkstra,. N = 25 p = 0. 2, D ijkstra AntNet = 3 00 3. 53 3. 80 3. 7 3. 59. 4,,,, AntNet QoS, QoS.,,,. : [ ] DOR IGO M. Op tim ization learning and natural algorithm [D ].

IEEE Transactions on System s, M an, and Cybernetics Part B, 996, 26 () : 2924. [ 3 ] CARO G, DOR IGO M. AntNet: distributed stigmergetic control for communications networks[ J ].

6 354 3 p,.,,,, AntNet D ijkstra,. N = 25 p = 0. 2, D ijkstra AntNet = ,,,, AntNet QoS, QoS.,,,. : [ ] DOR IGO M. Op tim ization learning and natural algorithm [D ]. Vatican: Politecnico dim ilano, 992. [ 2 ]DOR IGO M, MAN IEZZO V, COLORN I A. The ant sys2 tem: op tim ization by a colony of cooperating Agents [ J ]. IEEE Transactions on System s, M an, and Cybernetics Part B, 996, 26 () : [ 3 ] CARO G, DOR IGO M. AntNet: distributed stigmergetic control for communications networks[ J ]. cial Intelligence Research, 998 ( 9) : 3 l Journal of A rtifi2 [ 4 ] DH ILLON S S, M IEGHEM P V. Performance analysis of the AntNet algorithm [ J ]. Computer Networks, 2007 ( 5) : [ 5 ]BAR#N B. Imp roved AntNet routing[ J ]. ACM SIGCOMM Computer Communication Review, 200, 3 ( 2) : [ 6 ]BARA N B, SOSA R. A new app roach for AntNet routing [ C ] / / Proceedings of N inth International Conference on Computer Communications and Networks. USA, Las Vegas, NV, [ 7 ],. [ J ]., 2005, 26 () : 620. WANG L i, GUO Q iao. Rationality2based AntNet self2adap2 tive routing [ J ]. Journal on Communications, 2005, 26 () : 620. [ 8 ],,. [ J ]. ( ), 2005, 39 (0) : LΒ Yong, ZHAO Guangzhou, SU Fanjun. Adap tive dynam2 ic routing algorithm based on AntNet algorithm [ J ]. Journal of Zhejiang University ( Engineering Science ), 2005, 39 (0) : [ 9 ],. [ J ]., 2006, 28 (2) : 528. LU Zhengding, L IU Huim ing. Research of rationally adap2 tive routing based on ant colony algorithm s[ J ]. Engineering & Science, 2006, 28 ( 2) : 528. Computer [ 0 ],. AntNet QoS [ J ]., 2006, 27 ( 7 ) : : PAN Daru, YUAN Yanbo. Imp roved QoS routing algorithm based on the AntNet[ J ]. M ini2m icro System s, 2006, 27 (7) : ,, 969,,, 40, 3.,, 957,,,,, 0, 00, SC I E I ISTP 60.

Σχετικά έγγραφα

Application of a novel immune network learn ing algorithm to fault diagnosis

3 5 Vol. 3. 5 2008 10 CAA I Transactions on Intelligent System s Oct. 2008 1, 2, 1, 2 (1., 525000; 2., 030024) :,.,.,.,., 5. : ; ; ; : TP18 : A : 167324785 (2008) 0520449206 Application of a novel immune