Upload
vuongminh
View
221
Download
1
Embed Size (px)
Citation preview
������� ������ �����THE INSTITUTE OF ELECTRONICS,
INFORMATION AND COMMUNICATION ENGINEERS
������TECHNICAL REPORT OF IEICE.
� � � � � � � � � ��� ! " # $ % & ' ( � ) * + , - .
/10 2† 354 657 ††
† 8:9<;:=?>A@CBEDAFCGAHI=JBAKL466-8555 MENPOJ8Q9J;IRCSUTWVYXAZ\[
E-mail: †[email protected], ††[email protected]
]_^a`Ab cedgf�hjilknmpoPDA q fsretvulwyx{zg|}h~in�p�g�p���P���?�n�yu��Y�p���e���s�n�_�Y�suy�_���v|e�����<�|A�����v�Y���s�Y�g�� |Y�yue¡P¢n��~£l���y�l��¤:¥§¦�¨�©aªA¨?«¬�®_©yu~�Y�y�e¤¯¥°¦�¨�©aªA¨?«�¬a®_©e�g�< �|��~±~²
«§³v´eµp�e¶l·~¸?��¹�º�u~»nfj¼n½Y±~|sªE¨E«�¬�®v©p²s¾Y�{£l¿~�EÀ�j£gÁnÂeÃpÄ<|�Å~Æ<ÇaÈ{ÉIÊs�< n��¸?�}ËpÌ~ug»�Í{Î|}ÏY®�Ð_ÑpÒlÓ�Ç�Ô¯ �Õ~���}Ö\Ê��{�s��Õ�ulf�×~ØlÙ{ÚY±j²eÛyÜ_|}Å{ÆvÇaÝ�Þp¸J�}ËlÌ~��ßlàá���~£l�v�y��Ê��UÊfn�e�PÀ��ËlÌg»�ÅYÆvÇ�âlã�¸U��älåg��æj�?���\ §�YçY�Y�nèeÂ���énêjëYuY»n¤:¥ì¦�¨}©aªA¨?«¬�®_©l²�¾p�{£}×~ØY±{|nËlÌvÇa¿~��fsíîEï Å~Æ�Ç�âlãp¸?�{Õj�ð��ujÁj��Ï~®{Ð�Ñ{ÒlÓe¤sÏAñ_ò�óYô���ß�à\��õ�öJÇaÔW ��÷lø�ù}øûú �j±e¹�ºgfY¤¯¥§¦U¨y©aªP¨A«¬}®v©�fpüe·~â�ã
An Adaptive Ant-based Routing Algorithm used routing history in
Dynamic Networks
Akira SAITO†
and Hiroshi MATSUO††
† Department of Electrical and computer Engineering, Nagoya Institute of Technology ý Gokiso ýShowa-ku, Nagoya ý 466-8555 ý Japan
E-mail: †[email protected], ††[email protected]
Abstract In recent year, we can use the mobile communication in our life according to development of high perfor-
mance cellular phone, personal data assistant (PDA) and so on. In such a scene, Ad-hoc network has been spotlighted.
However conventional routing algorithm that effort to keep optimal paths is difficult to apply to dynamic topology
network such as ad-hoc network. Therefore the techniques that select good routing paths with probability rule are
proposed. But those convergence speed and routing result are still unsatisfied. In this paper, we propose new routing
algorithm that uses routing history, and obtain good routing path with probability rule. Fairly good convergence
speed and good routing path is achieved.
Key words dynamic networksf
ad-hoc networkf
reinforcement learning
— 1 —
1.� ��� ����� � ��� �
��� ý����AD����������������! �ý?D�"$#&%('*)Web +�,.-�/10?ý325456�7�8$�:9(;=<:>&?A@CB�DFE&%G /�HJIJKLI1K�M1N=OP Q<�;$DJRTS=U�V�WYX�Z�[Jý]\^ X�_L`Qa:b=c�%�d�eFfFg(h�U�i=6Aj= F<<ýk+mlonLp,.qrp�sut.%�,��&vxwzyQ{}|�<&;~D�Rz+�lon�pz,:q�ps�tz%�,��k�=�����P�T<����(�*�����&K�DFq$p�s�tz%,1[*����ýQ;&�*[~H{ý����k[�H��J�(�z2=45�5� ( ���Uý� %�lzj��(� ) �5[�GUH�U��&� �¢¡=£�yz¤¥Wk�LjJy1¦§ jTK¨D�R©�ª~« [&¬=®j� .<=;�D�+¥l�n�p�,JqPp¨s¯tJ%�,U�°�±²y1�L���J³�K�R´
1 µ \ ^ X � %¥l3U:¶�·�)(¸�¹&X$�sý�q�p�s�tz%,®s»º�¼&½=U�4~��X�¾�O$���LD´
2 µ ¿5À�Á5'�ÂLn}pkÃ&758²��V��u758²yk¤�W´3 µ qxpAs¯t:%�,*yz{¨Z1Ä�Å*K}Dk�*���&¿�;´4 µ Æ � %Çl»��È�0$U:É § y.Ê}Ë�ýÌ�uÍ$���JÎÏ�Ð 7=8~¦ § X�qÌpÌs¯tJ%�,�yk���=K¨D©�ª~« [*�Uý}��U~V}W�X�g�h$U�Z([ 1 ¬ 1 U&758
y.¤�WYÑEý(Ò�Ó����1Ô*ÕCG?H}y:Ö�×® lý(Ø! ^ Ô*ÕykÙ*Ú*K²Dz'�%*Û�Ü�f�Ý(+�'ÌÞ�ß�à*á�yk>�â*K¨D�R
2. ã ä å æ2. 1 IETF ç5è�é�ê+�lQn}p�,=qPp¨skt=%Ì,~�*9Ìë�D�'}%�Û�Ü�f~Ý+�'¥Þxß1àrá�� The Internet Engeneering Task
Force (IETF) U Mobile Ad-hoc Network (MANET)
Working Group [1] �LV$�]M&ì=>5âP@¯B�<5;$DJRT>=â@TB~<�;�DJí�î$�&ï$��ð�U 2 ñ�ò}�v@5ó$[�ô�D .
1 �$�5õ=ö���X�÷$c²pAsø���²�~V��YqPpÌsYt�%�,sùº�¼&½Ly�Û�%�ú�'}�Jû�üý lý=7(8����(S*U<GAH��þ�ÿ <��(Ø~Xk'*%=Û*Ü�f(Ý5y�¤�W Ï î�[*��DJRCÔ=ÕUGH~U���Ê}�1�*�$X��?X�÷�c²pÌsùU&7=8����=M�eý sº~¼(½=U&¾=Or��5�LK²DL��j.���® F; ^ |vý � % lU12�4� ��$�����eý5÷�c}pÌs»UJ�������5M*;����r���£�Ò�X&í�î�[���D�RH}W 1 �~�Uý5758������ ^ Ñ������~p��rÜ*f=Ý
y���;�<&Ô*ÕEGEH�y:Ö*×*K²D Ï îL[��LD�R�7=8$���@���U�¿! �X�÷~crpÌsù������K¨D�jz;®W#"�$����LD^ |_ý&%�' jz��(~� � %�loU:2=4! ��L�� )�eýQ÷�c�psùU������L��*�X&;����r�=��£�Ò�X�í�î�[��LD�R2. 2 +�,�-�.�/=é=êIETF U�í&îAjF��0�X�D1+&Ã�¼F%�Â=[J4���X:g&h��¬(�LK²D1í�îxj� F<Aý Q-routing [2] ) DRQ-routing
[3] 0�UUý�1(OCB!2�yk'�%=Û$Ü�f(Ý=�.���x ^ í=îL�
X Y
S D
sendtime required
S update
normalize
.
.
.
Z
Z1
i
X
Z
Z1
2
31 Ants routing
�sâ�ã
>(âÌ@YB*<&;~D1R¯S=U�Z�[�Hpý54*Ó��*�76�8~XkÔ=Õ$yÙ�Ú*K¨D Ants routing [4] ) Accelerated Ants rout-
ing [5] �79:�&Ø~X:Ô5Õ$y�;��=<=Êx 1V�WJjuK�Dzí(î��>!? 9A@oº$¼�½5U�¾5O��J¬5K²D�Ø=��B��DCLBL<(;�D1RAnts routing ��9(Æ ��E lGF!95÷~c}p@ U�H�IKJLNM ðOJ�PRQ�S ?UT�V EXW ( Y�Z!9 Next hop [D\^] )_a`cb Sed7fcgih�j�ki4cl _�m E!npo�qir�n�E�s mJt<�u�Sed7vw�xOy 9 backward exploration [a\cz7{|d�}!~����� v��t{ y����e� @�FRPiQ���{�� T f^��� _�� J��� ���OJ������ w�x Sed��7h!����d�v�� 1 J w�xh�� _�� S�v V E�W x �|� V E�W y J�� �=� E�� FP�Q��&{Uf|[ T 9 y h n�E�s m Fi i¡��={ed^vR i¡�¢{pd&£�l�¤ _ Py [:Spd�[�9tY�Z�hc¥ �§¦ wRx�¨ �Py
y �¡���{©d7v∆p = k/f(c) (1)
Py(s, x) =Py(s, x) + ∆p
1 + ∆p(2)
Py(s, z) =Py(s, z)
1 + ∆pz ∈ neighbor of y, z |= x (3)
�����i9 sy � �ª� Ec� h�P�Q�« V E¬W 9 k
y�wixl�9 f()
y^^®�¯�°!±�²�³ 9 cy � ��� E�� F^´iµ¶�
{��i�K�Dh���·�¸!¹�����d�v s_ H!I[ M f �c��� @
h Next hop J x_ j�k�S)dt£�l _ i¡ M 9�º�h7»
h V E¬W zi h7j�ki£cl _�¼!½i¾ Sed�vAccelerated Ants routing
yAnts routing J ¿ No
return rule À)[ ¿ N step backward exploration À�h2 ��h�Á� _�Ã!Ä S)d���[�J�¥KÅ w�x�Æ l _^Ç gif��h��c��d7v
No return rule [ y 9 Next hop_�`�b S|d�È!9!º
h ���O� @ _�É V E�WËÊ PRQ M f V E�W y Next hop
h�j�k!Ì�Í��)�DÎ^Ï�Sed��7h!�c�cd7v�Ð!f!9 N step
backward explorationy 9��©Ñ M f N ÒUh V E¬W hÓ�Ô _ � �=� EU� ���©� @5J�Õ�Ö M ¦ F|�ªPiQ�S|d
��[a�!9iPRQc« V E�W#×�Ø � ¦pÙ 9UÚtÛ M f V E�W_ H�I�[ M f w�x �RÜ�¸cJ �Ý� ��h�����d7v— 2 —
3.�������������
¾ w!x�� }�~ch��|��� T ¦������ y 9 w�x����F�� Ù 9 ��!Uh w�x J ¯ ;UJ�" Ù h ���©� @�F$#&%����d��c[=�c��d('$)�J�9 V EXW h ³ F$"��$*,+�-�9V EÝW h/.,0�F�1 M �2*3+UJ y�w^x F�4i�7����5!976M f^����J�8:9 M ¦ �©�c[^�R��;if!vÐifR9 Ants routing - AntNet <�9�£�l � m E!n�oq�r )&=�h ��� J routing-lock F���d [6] v routing-
lock [ y 9 wix F �c� ��[�J�¥�Å m E�n�o�qir £�lF 1Ã�> J/839 M 9 �i��F�? b�¾ �ª{�� M Ð �A@�B �
��d�v���h @3B Jc¥UÅ59�Cch 2 ��h ��� FEDGF�Sed�v1 � y 9 routing-lock FEDGF M f2Hc9A@JILK � h2M¾ F2NK�cÅPO�º!h��i��FRQ&S�� T ¦UÙD¦ ;�f�* +UJD¡f ¦ ��� _ DLTiS©d^Ð!��J ¯�U J2" Ù h!¸�¹�F�#&%[ ¦ d �E� �c��d�v��D{ _ s K ��V q�r ��� [=\R]�v� � 1 � y O�ÜXW Ù routing-lock FED:F M fEH:OZY
I�K � h$M ¾ F N)��Å7O^¡Of�J Æ l�h:[��R����F Fµ¶�&{�f$*�+U����O�º�h7��� _ D�TiSed���[aF�� T5�O \&]�h7��� _ j�k M �:^ Ø � M Ð � [=� �_�E����cd7v��D{ _�`ba E Ydc � Y �2� [t\�]cvº)�7� e�fLg�� y Ants routing [ AntNet [7]
_h E�i [ M �,O�� �=� EU� ���e� Y J Ó!Ô&j�k _�lm Spd!��[=��¥�Å wRx F � Ù On6 o,pch Ç � m E�n�oq�r3q msrXt_uGv�_�w:x Sed�v
4. y z � �
4. 1 {}|�~}�Ants routing [DÜR�GO�� VR� W y � �5� � � �����Y _ P�Q�Sed�È�O n � s mK_���� M O�º�h�£�lR¤©J\�;�� Next hop
_D`�b SKd�vª£�l�¤ y C�h ¼�½�¾��� _/��� M �i�pd�v∑
n∈neighbor of k
Pk(d, n) = 1, d ∈ [1,N ] (4)
����� O Pk(d, n)y HiI VR� W d hK[ T O VR� W k �V�� W
n_
Next hop [ M �7j�k�S|d&£�l����cd�v4. 2 �������� V/� W y O!� �ª� � � �c�O� Y _ Ú=Û�SKd�ÈcJ�OÉ V/� W h ID [�O���P3� ��-U� �¢� � ���3� <chE�
%�¸�¹�h�+G� _ Ó�Ô [ M ��� �=� � � ���K� Y5J�ÕÖ M O Next hop J�P�Q�S©d ( � 2) v�� ��� � ��� J� Ø d ÓiÔ _ Õ�Ö!S©d V�� � h3� � u y�� b ���©Å�O �K��h��|�¢¡©J�£�Îe�&{©d�vp�={ y$¤ J��©Ñ M fV�� W ����{Uz���d3¥§¦(O�º�h7�����$M ¾ M �i��d¨ Â,©ª� Ç Ù�¦ d�f�g^�c��d�v��&{�J�¥�Å�O�¡ M Ù O
s
x
y
z
dNode ID trip time
queue
s t
x t
s
x
s ts
s t
x t
y t
s
x
y
z t
x t
y ty
x
z
.
.
....
.
.
....
«2 ¬®R¯R°2±¢²R³
Q:´�©�h Ç � j�k h3µ _R¶ S)��[(��� T d7v� �:� � � ���O� Y _/· Q M f V�� W y backward
exploration J�¥�Å w!x _ �Ý� v w�xUy O�� �§� � ��c�e� Y J�Õ�Ö��§{��i��dR¸U��h�ÚaÛ V�� W _ H�I[ M f m � npo�q�r�n � s m J L�M � �Ý� v V�� Wy ��H�I d h ���O� Y h Next hop J V/� W n
_ jikS©dD£cl _ Py(d, n) [¢S|d�[®O V�� W x �)� VE� Wy J!� �=� � � ��P�Q��&{Uf�Èch w�xOy C ¨ �$¹��{Kd7v
∆p = γh ·k
f(td′)γ ∈ (0, 1), k > 0 (5)
Py(d′, x) =
Py(d′, x) + ∆p
1 + ∆p(6)
Py(d′, z) =
Py(d′, z)
1 + ∆pz ∈ neighbor of y , z |= x
(7)
�i��� O ky7w�x l�O f()
yR�®�¯R°�±U²�³ O d′y Ú
Û V�� W O td′
yd′ �|� x Ði��h��:%�¸�¹3O γ
yEºX»l:O h
yy �e� d′ Ð���h�¼ �/½7³ ���cd�v¨
(5) h ∆py £�l�¤�hEM ¾:¾�_ ¹�S�v��§{�J�¥UÅ7O¨
(6) J � ����PRQ¶��{�� T f V�� W _ Next hop Jj�k�SKd�£�l _ �¡ M O ¨ (7) J � �!��º!h�»�h VR�W h ¼�½�¾|_ �¬� v�£�l�¤Kh M ¾�¾ ∆p
y3� b ¤ k
J���%�¸c¹ td′ h � ³ � ¥E¿ ºÀ» l γ_EÁ Ø dc��[
J�¥ ;i�3OK¥pÅ > Ù O7QG´�©Oh Ç ������J�� T �,M¾G¾�_ º Å/ÂR�Od�vp�D{ y ¾ w�x J � Ø d k�à h��Ä©JXÅ q Y _�Æ f��7h!���|ÅPOK�D{pJ�¥pÅPO�6�Ǧ M ¾�¾O_�ÈXÉ O Æ l � ¦ w�x _ �X� �c[ _ ¨ Â�[S©d7v
4. 3 Ê&Ë Ì:ͧÎ�Ï&Ð:��Ñ�U�iÐc�KJ ÒªÓpf wLx }c~ y O Ants routing -
AntNet [�ÜÀW Ù O 3 Ôc��Ò:Ócf routing-lock � ���[ ¦ d7v�º���� ¿ £�l�¤eJ � b h3ÕLÖ _/× Ø O�º�{Y�Õ�h w!x _ VGØ q � m S|d�À m � me_ 4 Ä S|d�vÙ�Ú � J y O ¨ (6) ��£�l�¤ _ � Û M fEÜ3Ý&O§£�lh Õ�Ö�¤ limit
_�ÞZÉ dc��[/�,ß�à��&{Uf$*:+LO^£— 3 —
relay packet
generate packet
queue
Node
receive packet
Next hop
«3����������
l^¤ph$M ¾�¾ ∆p_ C�h ¨ J� T � É d7v∆p =
limit − p
1 − limit(8)
�t{KJ�¥KÅPO w�x H�h�£�li¤§��Õ�Ö�¤ limit J ¦ d¥ � J�����Sed7ve���� y �D{�Y���OK��h m � mK_ 4 Ä M �!� ¦ ��7h _ ¿ w:x }�~�À�O�4 Ä M fp��h _ ¿ Õ�Ö�¤ à Tw�x }�~�À[D\i]©��[�J�Sed�v
5. ��� �����w:x }!~&O��L¿�ÕLÖ�¤ à T w:x }�~�h2©� _ �"!SKd�f�g!J `�# �%$ � `§a q &(' _ � ;Rfiv &"' y OOSPF O AntNet O Ants routing O Accelerated Ants
routing( YcZ�O Acc.Ant [�)�S ) [ah+*�, _ � ;if�v5. 1 -+.0/21�354*�,76 B [ªS|d�º�{98�{�h�}�~ y ºR{:8^{7; ¦ d<(= � ��!e_ � ;R�!��d7f�g$O &"' <"= ��>�?A@ y
; ¦ d�v�º���� &(' <"=e_ B � S©d7fcgC@�YcZ�hU¥�§¦ VE� W2D"E m � &�' [ �"!|_ ��� vÐ�5�O V�� W _ �F @ D"E m!¾HG O 1
�I ¸�¹ ( YZ,O `�# �J$ � `ba q�iin ��½ Ðif y iin ��½ [D\] ) @ � � ��[R�i� T d ��� _�b�K S©d�v V�� W y 1iRn ��½ @2C�h�0�´ _ �Ý� vL
1 M N�OQP �SR �|�®O�Ð�f y K � c m ��D�F Gf ���e� YGh ·(TL
2 M U�V VG� � @���d ���e� Y�h�W TL3 M .:0 (
t q"X h�OCYLO Ç[Z )\%]_^J`�^3 @ �9a v�NbOcP �0R �¶� ·7TdGfe O
�7g�� y Éih � F�µ Gje ( k�K � cmlU�)�onCp Gje )���K� Yrq OE¸c�mU_V V�� � @�s É �it�g�u7º G �,OV2� ��vfw+x @R�"g ����� Y ��O ·+T O=��gt��q Next
hopÊzy W T �{t|g�u e × G O AntNet - OSPF qm}~ y G �i R¡7�[���sY ` � w � @fW T7a g�u5�9���
q$O,)_@bZ����b�9��Öz��O[�|��� �%� �:�A� Y v F� q�U�V V&� �9v �:���sY vm� �_@5�����{� 5 � v��� ���:� G��b� w q:�C�+�C��@ �� _�¡t�g7¢ v ya g+u5. 2 £7¤C¥|¦"§%¨ ©(.|ª�«%¬b�®�¯U|Vb°+±³² v �C���(² ��v�� �%´��b�_�µ� �o¶�· v
¸4 NSFNET ¹ º�»³¼¾½j¿jÀjÁ�ÂÄà (ms)
Pj² R2Å�Æ(Ç �C� �C�C�¾�(² � ` � � a g�È�É � lC²ÊJË �(Ì v } ~ ´"�(���{� � � ��Í t�g5�_���C² ��7�J��Î v�Ï q"Ð5Ñ�ÒcÓbÔ Õ9Ö�u:Ó³×�Ó � AntNet
vÈ(É � �|�³�C² � �[���QÎ y qfØ�´ � ÇbÙ[Ú ´�Û5Ü�7�J��Î (forward ant) Ýj�"Þ�ß�Ö�à� � á:â+ã ~Qäå�æ ·�ç"è Ó Õ9é êJë�Õ�� Õ5�(ì9íAîQÎ Ï%Å(ï Ô�ÕÖ�ð_ñjê%ò�ó�ô ä Ó · �|î³�C² � ì[í�îQÎ â � � �� Å"õ ÔfÕ7ö5à_ñ äCä�÷_øoùCú Ý7¢màQ�oß7ðû ñ�� � AntNet
âbü7�forward ant
Å�ý5þ Í ê[àÿ�� ò ÆCÇ���� �Jî³�C² � ì[íAî�Î â � � Ý���CßÖCñ ä ´�ßAÖmð_ñÄê|´�_� � � �HÍ ê�Ö5�_î��C² �ì�í|î�Î â � Ï ò á[â+ã�� ´ å�æ · ��� ß�Ö"¢ â(â��forward ant
â Ï ÝÄÉ[���Cê:ë ç5è ß�Öjì9í[î�Î â Ïò�Ð"Ñ ÷ Ï ä Õz� ��� ² Ê_Ë �(Ì â���� Ý��"Ò|´��� ß�Ö7ñ ä Å ���7Ö ä��! Ömð
5. 3 NSFNET ¬#"�$"¦�%'&( ��)_ �´ �#* 4 ´,+Cß NSFNET [7] [6] ´�-�� ·.�/ ݳÞ�öfà"ðjà�0�Ó �21�3�465 �� ò �'7 �(� �¡¶·1 8 Ê î:9"� ý5þ ���9Ö7¢ â ä Ójà�ðñ â .;/ ��ò ��< î_Î>=IJ@?+ò'A Ç�Ú � � 10000 8Ê î:9 ( �7òCB��;? â D#E�F#G�H ò�I�ñ:� Õ5�|¢ âä ßAÖ�ð 10000 8 Ê îJ9 . Þ � �K ²ML 2
ä K ²NL 7
Ý:OQP�Bf�'?CÝ G@H Ó � ¢SR 10000 8 Ê î:9 . Þ7ßÖ�ð_ñ â ä � â ��TU�V�8 Ê î:9 Ï �'W�X � â �'TUV�8 Ê î:9 Ï ��< îQÎ2=f²!?�Y+ì[í�îQÎ Ï Ý�Z#[Ó � å�\^] � � ÝÄÞ�ö(à"ðñ5ñ:_ � ��T;U#V8 Ê î`9 Ï ä ò �{¶�·"â�a îcb5²d ì[í�îQÎ â(� � �HÍ ê · ×Q� ��efK ²gL ´ UV"ß
Ö ( _:´5×�×�ö(à8 Ê î:9 Ï â �'T�h@_�ifj �;W#X� â ��T#U#V�8 Ê îk9 Ï ä ò � 5000 8 Ê î,9 . Þ �×��2Z�[�Ó�à���T�U�V8 Ê îl9 Ï _�i�Ö�ð ( à �m< îÎn=�²o?;Y+ì:íAî�Î Ï ä ò � � �HÍ ê · ×�� ( 0 �eSK ²gL ´ U�V�Ó ·�p Õ p ì:íAîQÎ â�� Ï _�i9Ömð.#/ ´"��ßAÖ ìA� a ²oq7Ý�r 1 ´�+7ß7ð�s ã�� ´-%é�Ö6YutCì�� a ²oq(ò �'v�w .'/ Ý Þ p�� s ã#�
— 4 —
�1 NSFNET ����� ���
��� ��14������� � ��� » (10000+10000) ����� �"! 100 #%$'&�(�*) �,+%-�.�/"0 5 1
OSPF 243,5 +%6�7 Â8��9':�;'<>=?�@2BA8&AntNet 200 C���� �ED(F forward ant A8&>GHJI /K0
0.002Ant routing L�M 0 6.0
Acc.Ant L�M 0 6.0 G 2-step backwardN�O>P�Q L�M 0 6.0 G�R�S � 64 G�T�U 0 0.9VJWEX�Y N�OKP'Q Z V G V"W%[ 0.9
0
2
4
6
8
10
12
0 2000 4000 6000 8000 10000
aver
age
step
s
simulation steps
OSPFAntNet
Ants routingAcc.Antproposal
limited proposal
¸5 \�]8^8_KC��@��� � (NSFNET)
2
2.5
3
3.5
4
5000 5500 6000 6500 7000 7500 8000 8500 9000 9500 10000
aver
age
step
s
simulation steps
OSPFAntNet
Ants routingAcc.Antproposal
limited proposal
¸6 L%ME`8�a\�]�^�_'Ca�J�b� � (NSFNET)
´Jc ÓÄà�hAÝ"dfe�ÓÄàCð5. 3. 1 Îhgji d�k@lnm(,o�p
10000 8 Ê î�9 ( _ â p �6T�U�V�8 Ê î�9 Ïä5000 8 Ê îm9 W'X Ó�à � â �6T'UV�8 Ê îm9 Ï âå#\ Ý * 5
p *6 ´ +�ß7ð9Ì���q"ò 100 r â�s Þ â
��T�h!_�ifj p�tvu òfw�x�±jy�²zw|{��u8 Ê î�9#_i7Ö+ð(�o@p *
5 ´(} p�· p Ants routingÅ ¢�ö ä ¢'~� Å 4 Ô (6000 8 Ê î:9��v� )
p@�j� �S�>�n� ã� p�?� ã;� p Acc.Ant
â3ã;� Å Ð�Ñ ÷ � (2000 8 Ê î
0
2
4
6
8
10
12
10000 12000 14000 16000 18000 20000
aver
age
step
s
simulation steps
OSPFAntNet
Ants routingAcc.Antproposal
limited proposal
¸7 º�»³¼ �K��`���\�]8^J_>C����a� �
9,�f� ) ´ Æ�Ç h�´"~ � Ó ·'p Ömð ( à p AntNet ò)| 5×|� Æ7Ç hA´"~ � Ó ·'p Ö� Rj´�� Ö Å p ñê9ò 1 8 Ê î�9��j´ ¶ K ² L Å forward ant Ý ý�þ ßÖ�à9 p K ²NL Ï 14
ä p R�� Í p6< î�Î2= ² ?�_�ò��� Õ W�X Ý5ò ø C´ Þ Rfñ ä Å _��bà�à9 ä`� �iêAÖ+ð_ñ â SR�Õ�� Í Ô p�� �C�u8 âf�'p'< îzÎ= ²o?�´�- pC· ò W�X@��� ´>� Åv� ´%Ô p Å p Ants
routingâ6W#X@��� Å 4�p ä p Rfñ ä Å�� Ömð� ´ p * 6 ´�} pJ· p OSPF
Å@� ¢�� pn�z� Ýdne Ó · - j p Acc.Ant
pAnts routing
p �v� � pAntNet
p���� �o�J�@� ã;�:âK� _ �f� d�e â,�f Å¡ Ô�ÕCö ·�p Ô ä p R¾ó"ô ä Õ7öbàCð|ñjê%ò p�¢ Ú � ² Ê|Ë �(Ì(ò �n� d�e â@£ ´9�C����� � Ý'¤¦¥à� p � c|Õ �n� ÝKd�eHÓ E éCÖ�ñ ä Å,§ Ó p à: _iCÖ�ð AntNet
ä �n� �o�J��� ã�� ò ¢ h Å 1 ´��¨!��´JÔ p à: p !j�©o�"Õ�8 Ê î�9 Ï ´>~ � Ó·;p Ö�ª « 1 ¬ ð
5. 3. 2 Îhgzi d�k@l#�10000 8 Ê îm9�_CB �;? (2,7) Ý G�H Ó�à � â �6TUV�8 Ê î�9 Ï Ý * 7 ´�+7ß7ð AntNet
pAnts rout-
ingp �@� ã'�9â 3 } Å ©o�[Ô%�®HÓ ·'p Ö7ñ ä Å@¯
×[Ö+ð|ñjê%ò 10000 8 Ê î,9 â ��� Õ W�X Ý Í �Jà� â Bf�'? G H ´� j�°ji9î�°��"Ì?±>² Å ´³�ÓÄàà9 ;_ i9Ö+ðJñ â ó�ôJ×µ� p ñ â 3
ã#� ò Acc.AntF �´� }o�K��� ã'� ä åCæ p °¶i�î�°9�(Ì�±,²�´ å\9Ú�· p ä p R�ñ ä Å�� ÖmðÍ ��´"¸n¹ Ó à�ó�ô p 100 r â,s Þ â R'º p Ants
routingä �f� ã�� ò�»|´ 20 r p AntNet ò 82 rf°
i�î °9�bÌ�±"² Å ³ ø ·;p ÖCñ ä Å�¯ ×"ö+à�ð ( à p¼¾½
1 ¿ÁÀ AntNet ÂÁÃ%Ä�Å�ÆE OSPF Ç'ÈÊÉÊËhÌ�Í*Î�Ï8ÐÒÑ�ÓbÔÕ�ÖØ× Ù�ÚbÛ Â AntNet×EÜ'ÝbÞ"ßÊà*á�â Íhã�ä'Ðæå�ç è�éEÆhêë Ðbå�çØÔ Õ�Ö è à Æ Ü�Ö*ì*í è�î�ïñð ò�óõô*öæ÷�øØù�úbûa÷Eü�ôïBý�þ�ÿ Ù����������%Ù����� É���������Í Öhì
— 5 —
¸8����� ����� ��|
Acc.Antä �´� }!�K�f� ã�� ò@°¶i:î�°��Ì?±,² Ŷ Ô��³�Ó³Õ p p � Ó�Ôjò'�³QÓ ·�p"· ���� ´����
Ó ¢�� _��bÕ p Ð��k_i+ö�à(ð à'0�Ó p Ants routingä �f� ã#� ò 20 r�� 17 r Å�� ¶������ Ê_Ë (Ì Å�! Ó�" p à â!� �cÓ p AntNet ò �$# � �! Ó à âò 82 r%� 7 r;_ p& j â 75 rCò Ï%' 8 Ê îl9 � �)(â+*-,.� ~ � Ó/" p ö5à"ð|ñ â ñ ä ×�� p Acc.Ant
p�´� � �K�f� ã#� ò routing-lock
� �HÓ�"10!2!_�ij p AntNet ò4365´i d â k�l � �5ß�Ö � � ����7 Öä p R�ñ ä�8 � Ö+ð5. 4 9-:$;�<.=%>�?$@BADC"-E$Fu%�&� � p *
8� +"ß oRHG 16 I 16
â JLKNM:â q1O �� L Y%P p 56 Q â K)� L 8�R �SLT ��ULVLW�X�Y�Z�+[�p "N\$]^P�_a`�b!c5. 4. 1 \d] YdZe�o@pNfhg �ji P R NS%T �+k%lnm/o$p%�aqsr�tivuLw�x
3 y�z �L{�X g �|i~}1� P ���!�a�%z �L{XL�1�s�!m " r ��q P)��� WsX cg)� i6�)U�V�� �L�1��tH�+��� �L� x)�%��m�o R �S$T-� �L������b 1 Q � g � i 8��- �¡L¢ ��£N¤ �¥+¦
1 § ��¨%©�U$V�W^X c�ª � «N¬%o �1�$��� ¥�¯®��°1b g�� i±�sr���q1��²�³ �H� o �1�����$z$�/´%`b g�� i±�sr/�1q µ �%�^��� X c�¶ � g/� i±��U�V%µ���LWsX ����· Mobilization Occurrence rate(MO)�¸��¹LW�X c g � iºµ�»%¼ �N½ i¾� ®-¦ ° X ¶ ���¿aÀ oNÁ%Â�Ã^�NÄ � �!��x-{�X cÅ \L] x%�+Æ%Ç �!� �1È ��É�·�ÊLË W�X ¶ � ·�ÌÍ �%m�Î�£aX b�Ï o�Ð�thÑ�Ò � qÓÁ%Â�µ 2 ÔLy � �Õ�Ö �¸� X!×�Ø ¿ g � i¯��Ù$Ú%kLlÜÛÞÝ%ß�� _.à ¿£a�1�s�WáX c�Ô ehâ oNÁ�Î%� gÓ� iã�N£N¤ � ¥ �ÆLÇ�x ���s·)_ Ø ¶ ��µ!x�ä1o�å�æsthÑ ·/ç�è WsX¶ �)µ!x�ä ¿ £ g�� iã�Ó����m ¿ £ c
MOµNé�£�Y!Z.x-��o ½�� �a¼%��ê���«L¬.µ�Ðët
ÑìÒ � q���íLî � ï ä Àð!ñ m�Îsm e Ø b-Ï o�ò�ó
ô2 õ�ö�÷�ø�ù)ú ûhüýøþ�ÿ ��� �
��� ü�� 56� ��� � ����50000 ��������� 100 ������ �"! �$#&%�')(+* 5 ,-�.0/21�3)43( 5 ��687 ��ü 3)4 )
MO 0.0 9 0.0001OSPF :<;0= #&>�?0@ ø2ACB2D�E0FG�H:JIC�AntNet 200 �2�����LK�M forward ant I��09NPO (0*
0.002Ant routing Q)R * 64
Acc.Ant Q)R * 64 9 2-step backwardS)T�U)V Q)R * 6.0 9LWCXC� 64 9LY Z * 0.9[P\L]�^ S)T�U)V _ [ 9 [+\&` 0.9
� y ��acb · fedHf ��g £-Î�}+�������á�%m¸o�h]a·�_^`�b!ci
1 j g � i¯�+ÙLÚ%kLli2 j g�� iì�NÝ�ß
(�.�.�!�ht)��o ��� ���lkg�� i oNÝ!ßHm kPnpo )i
3 j q t�r �ts å�æátëѺ� ��� (�������ët��)o
�Guem k g � i oGvHw )
¶�� �Gacb · 1rëtëÑ � m b �1� · 100
åyx ���zH{ m�o ª��}|�� � d�f x8hH~ ·�_^`�bLc h�~ ��0� m k å�� q � x ·P� 2 ��� me�G���á}���o f�df � g © kNz�� å�� q � x$�No�� ��h�~ ·P� £$o fd�f �+� m��$� ·)�!� m)�c����thc~ �8� m/o g+� i��aµ NSFNET ����� Î�G� mC� ¶ � �P� £Lo Ants routing � Acc.Ant
���� � �0� · �8� �&�lk� a�µ�{H¡G�c� ¶/� ��o ¶ �2dHf µ�å�æsthѺ� è��}¢ ¥h �1Æc£p¤e¥ ·$¢^� �� ��¦�§�¨ ·+© �Gm k � Ï x�{ k � ¶/�a�0ª m¸oG«¬ d�f
(���® ä�« ¬ d�f
)� è���¢ ¥� �+Æ�£}¤c¥
� ð%ñ � ¤�o�¯LuLw���° �²± �$ª m k � � ·0³e´ Í�P� ØL� Ï o�� � �^·1ªN�pµ�¶ ¦�§ �L� ¿^À �1�+·Õ�¿ � � ¨ ·+¸¹k!¶ ��µLx�ä k � ¶ � ¶ � ¥h oG«¬ dHf � z � åº� q � x ��g £-Î0»c¼.x�{ k ��£ ض �)µ�½¿¾ k �
5. 4. 2 MO=0.0 ��g © k h�~À ¤.�MO=0.0
o Ô Àëâ Ù�ÚcÁ!l ¥� ° �²± � Ýß-µ� ¶ ¿ £ Ã�Ä�x$� hG~-x-{ k � NSFNET� �
� Îp° �²± �.µ 4 Åá� ¿ ¡�Î g â o�ƹ° �²±�Ç ���r��$qP�.��Ès� ï ä ÀÓ¿ k � Ï o ½�� �a¼!�$êN�cÉÊ � ¿ k �hH~���«L¬�o8Ë%��mC�1îHÌ�x%��Ð�thÑHÒ � q z åæ�tsÑÍ� ¥á10 Å-y � å-æ�t�ÑÎ��µ ��� m��+î�Ì�µ
3000�N�át��0Ï�£c� Ð�Ñ�o ½�� ��¼L��ê�µPÒ�Ó m)�
�+�s�!m�oNÆ%Ç�µ+Ò}Ó � ¤ ��Ô m À Æ!Ç ·PÕe¸ x�ä
— 6 —
ô3��� ø&Y�� (MO=0.0)U)V
66 ��� ����� � � ( , )OSPF 35 � (53.0 , )AntNet 37 � (56.1 , )
Ant routing 54 � (81.8 , )Acc.Ant 62 � (93.9 , )SCT�U�V
62 � (93.9 , )[P\&]G^ S�T0U)V59 � (89.4 , )
�$ó � ·�� 3 �+� me�1Á dHf ���$� m/Î0Ò}Ó m�Î�£k 34
ó-��å�x � ���t° � ± ��Ù%Ú�Á�l ¥ � Ñ ½Ðët1q�µ�{�¡8�a�+�Lx�o Ê�Ë � ª�� ¥� � ® m�o��â �
66ó!�nØ���o����nmC� Ö Ñ ·���� m��H�� � Í ¿ Ð tëÑHÒ � q � � � à ¤Lo OSPF
���� � µa�G¡a�N��é�£N«L¬ � ¿ ¡��H� OSPF
�$ƹ° �± µ���� ·�� �� �� spanning tree ·"! u# �$&%�'( � Ѿ�1Æ!Ç ·Ó�$� m k d�f x�{ k µ)$�ÆLÇ��0� ´(° � ±
)��*�+-,-.��"/�0 ��´%� Î g ¤-$$��1 Í
��2)3�465 � ½-� x���h67 ��8�9 ��k � ª ��� Ï $ò�ó%�6:�; ½ §< )�8h�~HÃ�Ä�x-�&$�%�'>=@?��!��ÆÇ � �t° � ± � g £%Î 2-3 µN�BAC��Ð�ÑC$ OSPF
�¶���· ó�Dem k-¶ �)µLx�ä ¿ £�� ¶��a� × â ��� �µ�é C�.���s��E à���k �À ��$GF���H$§�� � Í dGf x1£ À Ô ¥ ÒHÓ� Î1£ kµ�$ ¶� ��Æ�Ç-�0� � µ�I�J�� � ÐK?.Ñ¯Ò �ML z � åæN?�Ñ<��µ � ï )� ¶ �/µPOCQ�x%{ k �SR � AntNet��Fa� d�f � ��T �Î8� �-U�V µ&,-£ë� ½¿¾ k �
100óXWP$+Á�Î$� d�f�Y ���B )�
27óL�&Z6[�� ·\ ° C�-$)Z)[�]�^�����?)��� � � �-_ �&Z)[�]`^�N��?���� ·�a 9
$10 ��� me��� ��_ �&Z)[�]�^���b?����^�
20000���c?���h � _ ¥s�d-e C�a�+�Y�f k �
a 9 �ÓÔ £LÎ&$L« ¬ dGf µ���¡����)� � µ�g À $ ��® äP« ¬ d�f $Acc.Ant
$Ant routing
$AntNet
�h � �%�G� ¦ ������µ&, ÀÓ¿ ¡�Î�£ k � OSPF
� df µ�i ¿ k � Ï �`�n��£ ØGj�k.� ¿�À $Mlnm"o>pSqlKr�s�tPu�¤ ¥áwv�x � Y�f k � À ��$ a 10 y+Ô £Î�$�� ��_>z « ¬ dHf µK{ ¡}|6{~% �}y ¯%£�Æ!Ç ·� � �Î g â $ Acc.Ant
$OSPF
$ �c0® ä�« ¬ dGf $Ant routing
$AntNet � h y ��� m k Æ%Ç � È���µ� À ¿ ¡�Î�£ k �� x Í ¿ Ð�?ëÑHÒ�q L y { � à ¤�$&%�'!Æ%Ç ·��� m k OSPFµ�« ¬ d�f � Acc.Ant
× â { � £«�¬�| ¿ ¡�Î�£ k&� z $��)� �&� â $ OSPF
z 2)3óPD ·+��à ¿6� � Ï YMf k �+« ¬ d�f � Acc.Antz
°�q ± � *-+�,-. · /-0� )� ½ q-�^¼�s$ê ·+� ØL�Ï $ OSPF
| �e� È�� ��� � Æ!Ç ·+Õc¸ Y ä k � À
0
20
40
60
80
100
120
140
160
0 5000 10000 15000 20000 25000 30000 35000 40000 45000 50000
aver
age
step
s
simulation steps
OSPFAntNet
Ants routingAcc.Antproposal
limited proposal
�9 ��������������� � (MO=0.0)
6
8
10
12
14
16
20000 25000 30000 35000 40000 45000 50000
aver
age
step
s
simulation steps
OSPFAntNet
Ants routingAcc.Antproposal
limited proposal
�10 Q&R��/ø����w�������+�Î� � (MO=0.0)
��$AntNet � Ants routing
z $50000 � �b?��-�� $�� y % � ¿ ÆLÇ y ¯�� � Î �hÀ { � |SE à��ºkµ6$�« ¬ d�f | �H� Î��n�S� y � � µ�, � |&½p¾ k �� �® ä�« ¬ d�f z ��� |�¡+�M$0� �Cz�UM� { ��� $¢-Í ¿ Ã�Ä Y z % � ¿ Æ!Ç y ¯`��ä y À�� ¶ |/µ�£¤B¥ � �H�
5. 4. 3 MO=0.0001 y�gK¦�k hH~§ y $ MO=0.0001 � ÃGÄ Y hG~>¨ ��© ���)���B|¡C�M$�ª d8f y���� S«+ÒeÓB �� 45 ¬)��H� z °�q± ��®-¯ Á`° �²±´³>µ&¶)� ¦�§>�·� ±¹¸`º ? L�»¼ A�½K{ � YCfb¾ $&¿)À ��ª-� ��� z"Á`Â`Ã�Ä ¾ �55 ¬��ÆÅ~Ç $�È�É�Ê·ËM| y�Ì�ÍBÎ « �>Ï ¬�Ð |�Ñ �Ò q�Ó@s���q ¶�Ô routing-lock
»�ÕCÖ)× Ì)Í�Î�Ø � ©½ ¬�Ð ¨�Ù 4 y�Ú Â`ÃOSPF
zPÛ � É�Ê �-Ü6Ý �MÞ Î � Ì`Í-ß`à�Ô { zábâ ��ã-ä × z&å)æXç × z Ø ��Ã6è�é�ê-ëMç É)Ê ×ì Ô 55 ¬-í�-îXíÆÅ�Ç 18 ¬�í�-î × routing-lock»
ï ¼ Î ½ » Ô �Mð�ñ}ò�ó�ô É-Ê ì Ñ í�Å�Ç 1 ¬·Î �õ�ö Î «)÷�� à�Ô ª�ø í�Ì`Í�ù·ú�ûcú�ü�ý à â í âþ�ÿ�� Ô�� ð�ñ}ò�ó�ô É-Ê ì Û í É�Ê þ���� «��
— 7 —
�4 �������� (MO=0.0001)�
55 �� ������������ ( � )OSPF 26 � (47.3 � )AntNet 39 � (70.9 � ) � routing-lock:11 �
Ants routing 47 � (85.5 � ) � routing-lock:8 �Acc.Ant 52 � (94.5 � ) � routing-lock:3 ���� ��
48 � (87.3 � ) � routing-lock:7 ������ � ��� �54 � (98.2 � ) � routing-lock:1 �
Ø�¸ q"!$#"%'& »)()*N×,+ Ï þ ý<Å â þ�» -/. Ï�0Acc.Ant ú routing-lock 132 Ï õMö » 3 ¬ þ �"4ç ü)ý � )5}¨ Ú�Î « ý Ï » Ô â76 ì No return rule
1�2 Ï ú�í þ78:9 6 Ï�à Acc.Antì<;>= í@? qBA ¨C>D>E"F>ÿ ��G Á�ÂbÏ » Ô Û í@? qBA ¨ C>D ·Ï�H
ù I »<J,K 1�LNM�ý)O'PQ1 ì No return rule¨SR'T
Î~ÔVUXWY? qZA í3[ ÿ � \ %)]X^ 1 Next hop¨ CD ÂbÏ�à â6 ì�_ L"`CíVab`/1dcK© « Î�e�© ½ O>P
1�Ô Ò:fhg ± ¨�ibj e ×<k<lK× ò Ønm�Ø Ï â þ ¨Vop ½Xq ×X+ ÏPÃ Ñ í ½Xq Ô routing-lock» ï ¼ Î ½)r
ú \ %<]"^ 1SaX`nsdtXu ÂbÏ ( * 5 » üvm�Ø ¾ Ô wx ç 1<yKµ gSz %)&){S| s�¬~}#Î��-ý Ï ú"í þ��/.� 6 Ï�Ã100 ¬:[PÔ��3�-í É-Ê × Ì�ÍBÎ ½ 20 ¬�í��î>í �� IvsS���}Î ½ ú"í »X� 11 Ô � 12
×:+ Ï�0�Q� ìMO=0.0 í þ ò þ��:9 � à�Ô ó-ô É)Ê » û
ú���m�û>�n1S�Mý aX`/1�Ì�ÍBÎ��-ý Ï�Ã6. � ��� �Y���ó)ô É&Ê ì��'� É�Ê þ � � Ô ê6ë �<� » �vm�Ô û<�1���ý~a'`3s�'� × ò Ï â þ s H<� Î ½ à e ½ Ô�� ðñKò�ó�ô É-Ê ì û'�@Ø�aX`$s��X� ÂbÏ â þ ìS� ÎSýú�í)í6Ô ê6ë �>� ì ó-ô É)Ê þ��S��×X+}¾ Ô routing-
lock 1d Î� � Ø�¸ qb!/#b%'& »)()*C×,+ Ï â þú �d¡ 1 Hb� Î ½ Ã� ð�ñ@ò�ó�ô É)Ê ìV¢X£ I × C>D H ù/sS¤)¥ ·Ïâ þ s�¦ q �bÎ�eÆÅ ½,q Ô�¸ q"!�#X%'& 1 R>§ Ø�a` »~¨ e 6 �bÎ�eÆÅ â þ�» }h© � 6 Ø6ý à ¢>ª Ô óô É-Ê ì H ù IQs 1 e × ¤V¥ ÂnÏ â þ�»)× ò Ï ½�q Ô
û)�n1��`ýVa>`$s C>D Î�Wn© Ï â þ�»)( *M×X+ Ï » Ôrouting-lock
» ï ¼)ÂbÏ ()* 5 » ü-ý Ã� ð<«@ò�ó�ô É�Ê ì routing-lock 1~ Î�� + Ϭ
�)<® ×"+ Ï » Ô°¯<± ç Ø�²>³@1 ì~´>µ �&ý�Ø�ý ÷¶¸ ì Ô$2n¹ routing-lock 1~ Î�� � Ø�º q"!$#"%&V» ºv¼@½�¾ ^ íS¿'À þ Ô3M � 1�ÁbÂCØ å>à s�î�ý-Ô5 * í~Ä>Åhs�î ÅÇÆ £ ×,+ Ï�ÃÈ É[1] IETF MANET Working Group
http://www.ietf.org/html.charters/manet-charter.html
0
20
40
60
80
100
120
140
160
180
200
0 5000 10000 15000 20000 25000 30000 35000 40000 45000 50000
aver
age
step
s
simulation steps
AntNet
Ants routing
Acc.Ant
proposal
limited proposal
Ê11 Ë�ÌÍ�ÎdÏ�ÐbÑÇÒ�� (MO=0.0001)
5
10
15
20
25
30
20000 25000 30000 35000 40000 45000 50000
aver
age
step
s
simulation steps
AntNet
Ants routing
Acc.Ant
proposal
limited proposal
Ê12 Ó°Ô�Õ�·Ë·Ì�ÍÖÎÏ�Ð�Ñ×ÒØ� (MO=0.0001)
[2] M.Littman,J.Boyan: A Distributed ReinforcementLearning Scheme for Network RoutingProceedings of the 1993 International Workshopon Applications of Neural Networks to Telecom-munications (1993)
[3] S.Kumar,R.Miikkulainen: Dual Reinforcement Q-routing: An On-line Adaptive Routing AlgorithmProceedings of the Articial Neural Networks in En-gineering Conference (1997)
[4] D.Subramanian,P.Druschel,J.Chen: Ants and Re-inforcement Learning: A Case Study in Routingin Dynamic NetworksProceedings of IJCAI-97 (1997)
[5] Hiroshi Matsuo,Kouichi Mori: Accelerated AntsRouting in Dynamic Networks2nd International Conf. on Software Engineer-ing, Artificial Intelligence, Networking & Paral-lel/Distributed Computing accepted (2001)
[6] Ù>ÚØÛ�Ü , Ý�Þ�ß : àdÑ�á�â'ãåä AntNet æ�çd��è�éê�ë ��ì�íî�ïðñ�òÖó ÓÖôõ�ö7÷ B Vol. J82-B No.7 (1999)[7] Gianni Di Caro,Marco Dorigo: AntNet: Dis-
tributed Stigmergetic Control for CommunicationsNetworksJournal of Artificial Intelligence Research 9 (1998)
— 8 —