A Fault-Contained Spanning Tree Protocol for Arbitrary Networks
Texte intégral
(2) "!#%$&!#' ( *)+,!--!. /!#,!0213 546,!7(8 9 < : , ; ? = > 5 @ # A B A 5 @ A D C < : > 5 @ # A B A 5 @ A Ld,V#=l@5WYXZm\E?J\Jn@5[]FHG]A#WYJo^`GI_b@5E?A#a5@J5c'^]K<^Ide[]LJp@5MO[]A#WfGNQJpgqeP5@5@5R
(3) h#G]SG]i#T Wfj#rZV
(4) WfV#_ J Ld,V#=l@5WYXZm\E?J\Jp@5[]FHG]A#WYJo^`GI_b@5E?A#a5@J5c'^]KB^Ide[]LJn@5MO[]A#WfGkNUJpgqeP5@5@5R
(5) h#G]SG]i#T Wfj#rZV
(6) WfV#_ J PZsZPZPZstde@5[]WfGuvJ\A#Jxwzy|{KB}B[I@5V#m\J PZsZPZPZstde@5[]WfGuvJ\A#Jxw6y|{KB}B[I@5V#m\J ~o+x\
(7) | ¥ ,5 x/ªYx¬Ã I ¤§ ª +¬ 'e|x/, £ £¯ x?£ ¥ (¤¦\§ ¨ex]©|` 5¡+ª «¯ | x¬e x]\ b xª °\ x®
(8) (x¡¢¤ \ x|x¤ ê"£ é £]\#£ ]x]#xé©]\]x ],¬§Éë'|À|É+x# £ ¯ì D | +(©|x £ £ ¥¤"¤²n±³| ´Yµ ¶+ · ¸oYx x ]§n º¥( * xx ª ( ¹,x +| o\©5 £ ¼ £ \( kàá+x³| ·âB· ã] µ á+· Q´âf¸x]© ©¯ \ n ªpÖ íI îØl¡|tB¬ Z©| xx £ »x ¥¤» x² U £ (¥|¤kt xª¼ (+ x»ªx' ("+ \ x£ BH,Ö ÛØ< oe+âf´eä(åk áæ áçZâf´è+ å£ ]x §Ã¦ªÀ -x £+Ô¢ ¯ ¯ © ¬ ¼Y x© ]§# ½£ (]¼D(©x ©5+¬]¡\¬ x x ]+ª z n ' xxB ( | x\¥¤e x ` ¯ IÈD zÅ«Ç|©5 £ l¬| ©|]¡+Yx| f?«¬Ç| £ l |©|]¡]/¤| ¯ ] § xx¿x ¾ xª¤Hv¬ÀZ§Â` ÁÃo¼nx¥ x £ Ä©x(n¬Hk©5 ¨eÖ ï¥¡]ð|©|¡+ ñ]Øl§ \Áà B£ \x x£ x\¼
(9) àá+³|] · â'µ ã+¼\éâá+<´¼éZä(?åéâ'x©©#\+ Éo «5 ª] (+®p]k¬p b¼k] ©5£]¼`k »©¼¯ £ ¤£ H £ Ūfx§ ©|§Æ £ ]x ¤| < ò ¼x' \ Yxx ] ¡+ ¡É¤xe £o (£ x ¥¥ 5]# ¯x©¤|ª] ò] ]+Ç| ]²| ¯ ¯ ]x t £ xI?È`¡
(10) x¥ £ £ +© » © xD + ¬© ] ¢5\" x£ +¬?£ Ç»x Ç|©] ]|Bo+] ¯¤H +` ª]§6¨e ©| ¤ \ ] e xx© É£ § © ]?ª +¬ ©+exB( ¼+ x©x£ ]| ¼ ªvók ©5\ xYx\ ©\ x ( ®»\»Ã ] £ x ] ` ©x | Z x+? ]\D Y¯ x k \ £ , ªk -Ö ïIØl(¡¥ +] ¬£ | «x ' ]xx¤t n©¬xÀ¿ Ö kñØl¡xv£ ©x` xfp©x©|x|/ ox Ê Ë\ÌDÍ|ÎÏТѢÒ5ÍÓÏDÌ £ £ x ] ` ¬ p À Ö I ð l Ø § ½ H ¼ © x 5 © ] D ¡ ¬ n x t ¤ £ £ £ Á'à ] £ xZx" ©5x x\ ]¼]x "|x ]x t ] (\ ä(åéân¥¤&©]\ ÙxÂx H + õ¬Ãxª£ teàá+©³|x· âvµ ã+éxâfá+´é ô ¤¥]¤Hx Ô¢§ÕÀ|½l ¬Ã²eÖ ×+Øl«§Ù º¥ \ £ b £ »n x¬ lÀ¥t+¬©"x©|x©5¼ xÀZ§÷ önex ©] O¼ª ¤B¡"©¬x ¢£ ª¤òÃxò]x `Ù ¯£ Ã5 ¤¥ £ ]© ©£ ]ªD' ¼¯ xo5 ¯x& Ç|¤© xZ©£ Ö Ú ¡, (Û]Ü|<¡?xÝIØl£ § ¯ â xYx ¬\À| x< ¥¤k £ ¦ª ÀZ¡|ë' x| x, x£( ø Ö ùI§#ØZº\ x£ Á¯Ã,© x ©' ,xo<¤| Ux » ]+ ¼£ Ã]( £ x xx\ o' +| nvª -+(x¥¬¤ x* ©xx¤k +¡?¥xx £ +, ú( ¼¯x]] ª Þ xx Ù¤x¼x n x¥¤H 5 ¼xx''Y x+o x§6¼Áà »p«| x£ ]xÙx £ £ £ ók\ ¤¤ox£ ¡\¼k,e «xª?¥ (+ 5 o<x É]©"§#ÁÃ(¢+©5]( «5x ¥ x 5 ,xÃx / x 5x©x¯ \D|Yx¼Ã ¬`x' ¯] D¤§#xÁÃfe§BÁü\D+]?'¼ ¯ ¤|¡(¤ ß (©xx ¥£ £ ª + x#px¼ ' £ ]¯ v ¯ t §£ ÁÃ]x+ÀH,¼¤¥o¡É ]¼\\]¤» x'£ x£ \ £ " ], ©x ]x x]5 ¯ £ ¥£ ]¼kx (x x »¯ + ]D£ ¯ b ¼xxx©©\¬ ]BÀ|§&/àÁÃá+³|· â ª ÁÃ+¬v v]©e+xBÃxv©x©5e ¼¢ \¼x+ £ ? xª©É+§ ¬?§'º¥]` · ã]µ á+¯ · ¡#âf´ä(å(váæá"çZâfp´è+å]`àvá+³|· â¢|µ «ã+éâá+ +´éä(tåéxâà ¯ ¤|,Y × \ù x ¯ D ¯ ¬?' £ ] ©|£ kx¢x
(11) e©| + xÉ5§t©º¥x]` k. f. O(1). O(f ).
(12) D£ ]x< £ x Ù x£¦£ ]ªÀZ¡x ë'©|| xZx B£'ø xª§#º¥ (]`+ vÚ? \ | (Y\x x \ x,£ £ x ( xÀ|x x £ ©5 §'©5º¥]]`` ¯ ]"§ ï QÏ Ð © ]ê" k\ £¼¥+¤£ e, ¯ x¼k"© x£ <£ x ? ¡¬¤¬§²Áà Àpxnã ©|x¬]]/À* ¼ /*x¥ £x]
(13) ] £ ©5©]]£\©n ]©\|< ©]*|¡/]xt £ xÀ|"¡x§ £ £ D £ Ùx £ ] ©+| ?]] (xxÀee+, x£ ¼\£ BéZ(ã+ ép££ ³|\]é`´ à 㤤H `¡Éäv§<( Áà ' ¤ox¼ +x
(14) ¥§ ©| D5 x©D¬| *ÀZ]§©| ]¡ ¡É¼'À¥o+¬vpx |x( ©¯ x|¼]x ] ?§px¦°D x xx ¯ £ xx¼¥x¤n kx5 ' ¥n5" p¡
(15) ©||]x" ¬x»"5 \] £ ¥ ¤¤ ¥x¤ ¤¯ §'x ÁÃ?¼x¥ ] ¡
(16) ¥k¡5x© £ |¬]n¢xk £\ ¬(]` À? ¤n+¥¬¤ ] |£x ¼¯+x¼x ¬¢ ]x § Ù] £©||x x+,# H ¥+5¤b] Ãx » t© +| ]¤¼oì©5 /+¼v]xe§ú£ oÁÃx ]£ t\¬ | x x + xk +à ¬ ¯ ]<']' ©| x] D ªn ß ¼ Ã+x'Bx5ª©| 'ê" x e(+x?]x ?© |+]§ © x z+ ª5 ¥¼¡ ]xtx,©" «£ ¼ +p k¯ x' ¯ x £ k£ |¬ +x ¯ x¡ \¼x ]x'ex¼ ¼xv§* £xÁÃH n
(17) ¢ |µâf´Yx ã+ 鲯\¼xv¼xÇ|+] ]| x '£ £ «(]¤t ¢¥5| x¡¯xx ]£¼©5x ]£ +x £ \ ¯ ¼x +x]à £ § ¡ n¬¼ n,¬I¤ BÌ¢Ì¢Ó Ì zÍ|Î &ÒZÏDÌ Í|ÎÑ¢Ò5ÍÓÏDÌ b¤¥¦xª ÀZ¡ë'| ɪɡp¬x À'£Ù x©ø |© |Æb]Ö ùIbØ© ©
(18) x©5+\B £ ² t x Ƽ +x £\ «o ?x|,£ x x ¤¬§e¼Áà £ ©\|¼]xf§? ½|ª ¯ (x ¤¼\ x ]§#(Áà » Þ x£ ¿t5`£ p],² 5¼ +£o £ k¥¬¤,ª? +À»¬? £ ¥§ Dx¬ £¯ vª¤²¼ îx £ G = (V, E). V. E. v ∈V E. (u, v) ∈. u. v. n. i. £ ¤\§ £ ¤(¯ ¬ \¯ Éx ¯ ¤¡ZB'x
(19) e £ x #x £ ¼e+¬ ] £ ?¥¤+¬¼`x £ ]| § ¦¿ ¤ ¤¼£?§ e¼?x ]+¬¯ ]]¯ ¡<(] ¡< '£Õ¢n¬x(x © £ ©x]\`'+ ¬\|]'x\5¥ ]x¢ £ ]¼| x¯ ex ¢x\à ]¬»x¢Ã ÀZx§# ÁÃ]¼É e] Ãx¥¼xB x©£ ¯ '\ "]]¬ Àb¤n À¥§ +?¬zv ££ pxB] |tª (]+x ]t© t©+ \+]\,x²#] "£ x x£ ¬£ , ©5 ]+k x'§DÁ/o(] £ ]x ¯¼¼ £x £ xe¬ ] ]¼ + "x !É¡\x¦ ªp(À £ £ v*£ ©«£| £ ]]`,¥ ¤²x k |¼x£ 5 |] ,¥xÃxB ' £ '§ « (x¦ \ ªxÛo (ªx £ ]t¯ x ]¼©|x £ ]*x 'x +t¡ x £ fx§" ¹£ D¼ Ù+¬ £t£ 5<D`D¬ Dª +¬ ?© £ ¼+]D®. id. et al.. i. rooti pari. i. i. i. label : P recon −→ Action. P recon. i Action. i. P recon label. Root(i) Child(i, j). ≡ ≡. T ree(i) Lmax(i) Sat(i). ≡ ≡ ≡. disi. rooti = i ∧ disi = 0 rooti = rootj > i ∧ pari = j ∈ N eighi ∧ disi = disj + 1 root(i) ∨ ∃j : Child(i, j) ∀j ∈ N eighi : rootp ≥ rootj T ree(i) ∧ Lmax(i). #<xtön¼x© ¯H?x] p\ tx £ ]'\ (]kxn \x x £ £k ¬¯ xt\¼,x xÕ\]?* ]¼]+\ x]£ ] § ¬¼ª ¬Ãx \£]' ¤£ ]©¡#x|,£ ]]\ ]¡ ] ¡ £ ¼+¼],¼(¬," ¥5 ¥Ãk5(]¬\ª¼] ª¼ t] + ¬xx\¼* ¾£ ©§2® £ ¦¢¼t+ª] *£ ]² 5pbo¼+] \£ ]¯ xk¼ªx¬Ã ]x¡£ reqi. i. f romi toi. i. i. diri. Idle(i) Asks(i, j). ≡ ≡. F orw(i, j). ≡. reqi = f romi = toi = diri = ⊥ ((root(i) ∧ reqi = i) ∨ Child(i, j))∧ toi = j ∧ diri = ask reqi = reqj ∧ f romi = j ∧ toj = i∧ toi = pari F orw(i, j) ∧ diri = grant. £ «/Á ¿ £ ` ¥¤ ɯ ¡tx É x §ß£ ]]?¦¹+ O£ ex v+¼¬»ª ¤©x £ Yx¼ + < ¥¥5¤ ©| ,¼/n©5¬]ªk x ¢¼ £ t v]¥¤o ¯D5x] ¢© x§# ]¡ §% $5] £ x ]/ & ) ¥xÈ`e¡?ÅYx `£ «( 'x ¤pÈ`¡\Õ (¬À|< ªÉÕ x\©5 v ¼p©5p ÅY¼` xÅY `£2 1 + È* È`§© Áà k\B (x ] \]ª#ª¬Ã`x £ ke-Å , ]/¡ . x¡ ¼0 ≡. Grant(i, j). ∀i : Sat(i). i. j. Sat(i). rootj. i. j. i. i. j. i. i. i. i. i. i.
(20) r.
(21) . r. i. . ¬T ree(i) rooti = pari = i; disti = 0; reqi = f romi = toi = diri = ⊥;. (r,1). i
(22) ( i
(23) ). i
(24) * i
(25) +. i
(26) . ∧ ¬Lmax(i) "! #$% j ∈ N eighi reqi = i; f romi = i; toi = j; diri = ask;. &. rootj ;. Sat(i) ∧ ¬∃j : F orw(i, j) ∧ ¬Idle(i) reqi = f romi = toi = diri = ⊥; Sat(i) ∧ Idle(i) ∧ Asks(j, i) reqi = reqj ; f romi = j; toi = pari ; diri = ask; Sat(i) ∧ Root(i) ∧ F orw(i, j) ∧ diri = ask diri = grant;. Û®¢¦ªÀZ¡/ë'|tx £nø & '©x kx x £ x' ¤kÇ|]| £ ¥¤v £ ¬ § ©5(¥? ?+Y¬x'¯ x]¡¦\ ªx\ÀZ¡|Y ë'x|\ ]?§Dª½]+xY£v`]ø Yx£ & ¢kxx ]£ ¯] z`¤( ª£ D x x x ©¤,|'+¬, ,]``«££©¥Dx¤ùÅY\ È`§¢xÁÃÉ©5¡+¬ + £BÉ § ]Dx++¬?¬"£ É £ £ ] x +<]] 'n+¬¿? £© vx£ x]\Ã< x
(27) +]¬,n 5 x] ©£ k£ §BÁÃ+?x e¥£ xDx§exÁà £ £ ?, ¯ |£ Û fYx`¡+]¤£ ©+ x¢¡ '(¼?à +§ xÉà '£ +v¬ Yx '«+¢Ã £ ù Ū5¼È`§½¡Z¼ 5ÁÃ]o ]]v oo¥ x£ x§¢ ¦5£ (¬exÀ £ ( Õx £HÇ|]]|v\]]¥¢x ` ¬ & 'B©¡5x § ¼( ©+` , ¡ ]. \¡]x I+£©1 ¤k§( ¦¢] eªxe¼ ú¥¤¥x]Ç|¡É],|Ç| ¥|¤(]Ç|'¼]n| ( 2x` 5* È`¡#§Dxön <, £x¯ ] £]¡\ 0t 5,ª¬¤| ¹?Õ ( I(e¤"Ūf § v§Bx + § +]D5ª¢'¤| ° ]D Àv]` ª¤z½6¦ªÀZ¡ªë'| +¬É ¡&x ]£6`ø É¡ ¬& »bx +¬U +¬QÆ&| x£ Sat(i) ∧ Grants(pari , i) ∧ diri = ask diri = grant;. i. Sat(i). %,. %-. i. pari. k. ¬tree(i). i. i. j. p. p. .. p. r. p. r. i. i. r. i. (r,2). i. (r,3). (r,2) k. (r,3). i. (r,3). (r,3). ù|®<¦OYx ?x |x ¤\ x £ » Yx ª §k ߺ\ vx\ x ?£ ª x ¹ " \xÛDfYYx x äp²| +©xnÅYn H +vt]x] x` ( ]+x`?ÀIÈ` ¡x+¥¤§ ¤|xp Y+x¢ ¤²x£]p£ ,o]x ¯ k¤' ,¥5 B Ñ Í +ÒZÏDÌDÍ BÓÌ /Ð B̢̢ÓÌ zÍ|Î x¬¢¬ < ¢x ¥x5 Æ D»]¬\ v ] /£ ¼£ + DxÃex¢, ù,£ ª?© ß|] + À|]§</ÁÃH?¥¤* +¥¤ ¡ ],"+' ]¥ 5o £ | x¡
(28) ¯tx¼£x£ ] ¡<px¼o ¯ p]] ££ ]Dv, |x ¯ & x¼x ]x# ¥5 & ¥5 § | »ÁÃxx (?£ ]n¼xx ¤v¡Y %x £ ¼¥]<\+x xD¬] £]©oxx ¤£ ( x£ À?],` ¯ ]`+¢xv , | x¯#x#¡ ¼?|] x£¼/ k«¤ (¼I+¤5 ¤ §©|£ ½l D( £ (£ Yx « , £+ x ¡É* v]` ' |xD +kx©©©¼+ ¤§ ?¬¼¡ ¼¤" (I¤"5 £ ("Yx +v Yx ]¥§ 5 ¡Éo( £ ¬Ãx eª n]`' xx £ ê"D++¬t £ ©5](x¼]#¼/ £ x]¢Ãx§ #É £ ¥5\ ' 5]x? à «§½ tD \k¬¯]xÀ x#+¼ (ex© x\©5 x]¡5¬ ¬£x©¥¤ x ¯ x¼x £ ]\e ® ¤xD( £ Û§Áà ¯ x¼x] £k¼+ o£ £ \'¤²x,,"`¥x® x, k '¬ ¼£ p' £ 5 \§ ¼¢]\x ½l?¼?x¼Ã \ £ ¼Ã x ',ª x ú £ ( ?¥x]§ (a). T ree(i) ∧ ¬Lmax(i) ∧ Grant(toi , i) rooti = rootj ; pari = j; disti = distj + 1; reqi = f romi = toi = diri = ⊥;. i. (r,1) j. (r,2) k. disti = distk + 1. (r,1). (r,2). i
(29) Tree(i) '. (r,1) j. /. 0. (b). $1. i. i. i. j. i. j. 2-. INf. IN N eighi. i. i. i. 3 rooti 3 disti. i INf 4. rooti. i [1 . . . |INf |] 4.
(30) ¼¢ '¼?© x£ '\ '£ x\ ¤ oxD(v§ ¥§5½l,¢¼xe ]\¬x#¼ ù|§Áà ¯ x ¼]x x]?]® ¼+ £ © ( x £ 5¼\\¤' ¡]\]]\kx Z ?£ \DÕ ¤" x? B¼<£ ('¤¥¬+v¼ ¼ Õ *xx'§k½l¼,]\x#p ( £ ª %¬?¼¢ ¼ ¼+e£©k £ ] £ \\] ¢¯¤nx o xBxox +v ¡B©|¥e5 Õ p(¬&§½le¼¢]\x
(31) £ ¬ ]¼ ¼»x v§¼ £ ½l6\¤¥ ¼Æp¤*]xo\¢©xt ©¥¾x5\+ x ]£\ß] ¬\¡x¼( £ \ ¤t,¼¡B * ª¤' ¬+ ªB¼¤t]¼,#+]k\Õ] t#£ 5H x\ £ §"§½l¼]\xDt ¯ x Á/+ ¬£ ]© 5 £ (¼+]® `¡#¬ \ £ (ª 3 pari. i. i N eighi ∪ {i}. request. grant 3 reqi i. i. i. INf ∪ {⊥} 4. 3 f romi. i. reqi. i. i. N eighi ∪ {i} ∪ {⊥} 4. 3 toi. i. F orwA(i, j) ≡ j ∈ N eighi ∪ {i} ∧ toi = j ∧ pari = j ∧ diri = grant ∧ Sat(i) ∧ f romi 6= i ∧ reqi 6= i ∧ reqi 6= ⊥ ∧ reqi = reqf romi ∧ ∀k ∈ Child(i) : (rootk = rooti ⇒ distk = disti + 1) Rgcorrect(i) ≡ Idle(i) ∨ ∃j : F orwN a(i, j) ∨ (∃j : F orwA(i, j) ∧ dirf romi = ask). £ ª¡¬p ¬ ¯ ]¯ x\+ £\ 'xYo x 5£ ]§£ ]ɯ k ©|x, H xo ¢ (x+ n(x +x xxeDkp¤|¤| ¾ î¼5, £ « (£ +(ª ++¬?¡É §Ùx¦ £ x¤p? + + ¥¼5 ¥ £ x] £ , x©¼\]¡. Grants(i, j) ≡ f romi = j ∧ diri = grant. -. i. Coherent(i) ≡ T ree(i) ∧ ∀k ∈ Child(i) : distk = disti + 1 ∧ ∀k ∈ N eighi : rootk = rooti. ½l+<<¼eB] £ ¤ x £ +¬»¼B+D £
(32) ,¼ Ã¥x xBx5 \#ÃYx D¡+|( x Ã' +#éx¼B\]B x £ £ x¥\xx ¯ x¥¤¼x' ] ¯ x à ] ¯'x 5 £¡ £¯ x¼ ¼xx ] §¯ x?¼x ¬¯ x¼ ¡Ã, £ x £]]( £ k ? ] \n] ]<xÉ' |xZ ¬ ¢(¥¤k ] \À¥ ¯ x ©v £xD¼+ ©£ ¼x£ x \(¼¬¢¯ (xb ]¼x+B ¯ xxn (¡ x¥¤ ©¥5 ] ex §?xex,¬n©5\B+e]¡ § ? ,]¥ ¬À| e¼5¡/xx#B ¤o ,© ]¯ ¥x5 k ¢x ¼ ¯ ]¼,©5 kx\ x £ §#v x ¥ x£ ] ¡¯ x £ ©5»¡Ã\¬ ¯ + (n£ ¼ ¼£ \x] +]¯ v¡ex Hx©§# x½l/\x¥ x£D£ Z £]+\¼ªx ² p(¥x5]\£Dxx Á/£ '£ ]' ª5n +¬o v]©\ ]£ ¼ I+]©' ¤»® ] x¼ ¡¬p \x ¡|x £ e£ ] o']© xÀ|+Ã\¬ ]\ x¤o ( I¤p§H£ ¼5½» x£ ¼ ((¯ xn , ¡<]\ £ x Y »x¼ ¯ £x¼ x » ¯ vx¼¥xx ¯ ¡x+¼x¬Ãx k£ ,v x»©x\v]`]¡ ¯xk x © £ ¼ +£ ¢Éª§< ¦&+¬?ª§ (xÉx ££ x ££ ] ©| x¼ N eighi ∪ {i} ∪ {⊥} 4. 3 diri. ask. reqi. i. grant. i. {ask, grant, ⊥}. Child(i) ≡ {j ∈ N eighi : parj = i}. T ree(i) ≡ (rooti = i ∧ disti = 0 ∧ pari = i) ∨ (pari 6= i ∧ rooti = rootpari > i ∧ disti = distpari + 1). Ownrmax(i) ≡ if (∀k ∈ N eighi : rooti ≥ rootk ) then i else j = {M ink∈N eighi : rootj ≥ rootk }. 0. i. Onelocalf ault(i, d, j) d i j d−1 i. i distj (d, j). d. (d, j). i r. i. i. r. Sat(i) ≡ T ree(i) ∧ Ownrmax(i) = i. .. r. 0. id. r. i. Idle(i) ≡ reqi = ⊥ ∧ f romi = ⊥ ∧ toi = ⊥ ∧ diri = ⊥ Asks(i, j) ≡ j ∈ N eighi ∧ reqi = i ∧ f romi = i ∧ toi = j ∧ diri = ask ∧ Sat(j) ∧ rooti = i < rootj ∧ pari = j ∧ ∀k ∈ N eighi : (rootk = rootj ⇒ distk = distj + 2). F orwN a(i, j) ≡ j ∈ N eighi ∪ {i} ∧ toi = j ∧ pari = j ∧ diri = ask ∧ Sat(i) ∧ f romi 6= i ∧ reqi 6= i ∧ reqi 6= ⊥ ∧ reqi = reqf romi ∧ ∀k ∈ Child(i) : (rootk = rooti ⇒ distk = disti + 1). Incoherent(i) ≡ ¬Coherent(i). ù|Û §§. ÅÅ+IeYx\â+ ¥x5È ¥ £ xÈ. Onelocalf ault(i, d, j) ≡ j ∈ N eighi ∧ ∃r > i : Incoherent(i) ∀k ∈ N eighi :. i. • rootk = r ∧ k ≤ r ∧ (k = r ⇒ distr = 0 ∧ parr = r).
(33) ק 5 xÈ. ï|§,YÅxI ¢ + ?+ H £ xx?È Yx¼ £ ]` £ to¼\. Å+(x¼\k |. • k 6= r ⇒ park 6= k ∧ distk > 0. ∃k : N eighi = {k} ⇒. (rootpari = r ∧ distpari = distparpari + 1 ∧ Idle(pari )) ⇒. • ∀k 0 ∈ N eighk \ {i} : rootk0 = r ∧ k 0 ≤ r ∧ (k 0 = r ⇒ distr = 0 ∧ parr = r) • (k 6= r ∧ park 6= i) ⇒ distk = distpark + 1 • ∀k 0 6= i ∈ Child(k) : distk0 = distk + 1. Ú§ ÅI ¯ \xÉ]` k¬ , ©x xÈ ï|§,YÅ xI ¢ + ?+( H £ xx?È Yx¼ £ ]` £ to¼\. • |Child(pari )| > 1 ∨ • Child(pari ) = {i} ∧ ∃k 0 6= pari ∈ Child(i) ∧ (∀k 0 6= pari ∈ Child(i) : distk0 = disti + 1 ∨ parpari = i). ð§,ÅI + x#\©x\ xÈ. ∀k ∈ Child(i) : distk = d + 1 ∧ distj = d − 1 j. rooti = r ∧ disti = distpari + 1 ∧ Idle(i) ⇒. • |Child(i)| > 1 ∨ • ∃k : Child(i) = {k} ∧ ∃k 0 6= i ∈ Child(k) ∧ (∀k 0 6= i ∈ Child(k) : distk0 = distk + 1 ∨ pari = k). ð§,YÅxI ¢ + Ã+,H©xx?\Yxx¼È £ ]` £ to¼\. (rooti = r ∧ ∀k ∈ Child(i) : distk = disti + 1 ∧ Idle(i) ∧ parpari 6= i) ⇒ (distpari = distparpari +1∧∀k 0 6= i ∈ Child(pari ) : distk0 = distpari + 1). ¥ñ §,ÅI + xB\©x\ xÈ ½( £ '# ,x \ ¯YxYx ¢ D|\ x £ +e\]¡ ( £ ' ¡+¬,¬ £ ' x¢/] n ¤| £ úx x £ (©]e ' ] ¯ +¢¢ ¢'¼',¥Yx¤(5 ¤ ¢¥x]§/Áü/x +¬?
(34) É£ ,£ ¬«¼ o] o¬t © ££ ¼x+ ££ , (x/I¤v ]¤| À
(35) § B©x\<] (+],5Yx ¤ Ûù|§§ Å IeYx ¢+ xÈ Å+\à ¥5¥ £ xÈ. (rooti = r ∧ Idle(i) ∧ parpari = i ∧ pari 6= i) ⇒ ∀ k ∈ Child(pari ) \ {i} : distk = distpari + 1 i. i. Onelocalparf ault(i, d, j). Onelocalparf ault(i, d, j) ≡ pari 6= i ∧ j ∈ N eighpari ∧ ∃r > pari : Incoherent(pari ). pari. ∀k ∈ V oisinspari :. • rootk = r ∧ k ≤ r ∧ (k = r ⇒ distr = 0 ∧ parr = r) • k 6= r ⇒ park 6= k ∧ distk > 0. ק 5 xÈ. V oisinspari = {i} ⇒. Å+x'"¼\ |. • ∀k 0 ∈ N eighi \{pari } : rootk0 = r ∧ k 0 ≤ r ∧ (k 0 = r ⇒ distr = 0 ∧ parr = r) • ∀k 0 6= pari ∈ Child(i) : distk0 = disti + 1. Ú§ ÅI ¯ \xÉ]` k¬ , ©x x È. ∀k ∈ Child(pari ) : distk = d + 1 ∧ distj = d − 1 j. (rootpari = r ∧ Idle(pari ) ∧ parpari = i ∧ pari 6= i) ⇒ ∀k ∈ Child(i) \ {pari } : distk = disti + 1. ?Ç¥]¡ ¬ \ £ ¬©°£ ¼+- ©xxx\zx¿ £ ¼Ã'Yx ¤k £ x £ ,¥xx/' . Onelocalparf ault(i, d, j) i. Onerootparf ault(i) ≡ pari 6= i ∧ ∀k ∈ N eighpari : (k < pari ) ∧ (rootk = pari ) ∧ ∀k ∈ N eighi \ {pari } : k < pari ∧ rootk = pari ∧. ÁÃeª ,+ ¬n e©ex B£ ¼+Yxé¤k ¯©x\ #\e £ ª  ] ¯ +¦ ª×\ (§? vx¦Â ª £ ]+¬? £§¿©| ¦x² x£pke£]np|x ©| x UB¼x(,"¯ xYx²£ ]£ ¡ ' o£ ' |l¥'xv¬ £ÀZ¡¥]? Ç| (]+|]]5 o + \ ¤t Yx ¤ ¡ 5'©§¢" ` v]¡5©x<¡|¢\ +]£ § $ ]©| (+]]& ¢ x ¯ ¼ ¼k£xp »¥¤k5\ `< © xk\D¼¥<¼x ¢ÅYx`e5 ¤] Yx' Èäv*B" £ £¢¥¥ x(]( x& ?¢£ ]]¬ (+ÀZ] §tÁÃ+¼ \]` ¯ x?¼xx £ ]§ÆÁï ¿x ¢ £ ( x ¡¬<Ùk»x¥¤ \(¯ x xx< £ e À¥£ xt¥#5 k ª¡Z+ ¥Õ5 ©|² ¢©5¬ Õ¼" ,(ÆÅY`]¥ ¤ 5¥)]x È`¯ §Ox ½ ,£+ ? £¼?Ç|o]¬| o ¤Yx¼k'x¤` É£ ¡5 n£ ¯ x ( ¬e xÀZ,¡5x, £ x¯ ¬v]` £ x¼\ Dx ,¯ ©5x §B¼ tx ÅY¤¡|` (£ * È`Õ§ e ©| Áà £\¥p¤" (nHx £]\ ]¬` I © ¤Ù-Å , ¡ ]. x¼§¡ 0¦ßxx ££ £ x1 »Èà ] Ç|x v ∀k ∈ Child(pari ) : distk = 1. i pari 6= i. Oneparf ault(i) ≡ Onerootparf ault(i) ∨ ∃(d, j) : Onelocalparf ault(i, d, j). i. i (j). . j. j. i. T ree(i). i. i. root. root. j. i. i. j. root. j. i. j. i. .. i. i. Sat(i). i (j). i. i. i.
(36) $ & #$ "
(37) "% i(j)
(38) ∃d : Onelocalf ault(i, d, j) ∧ ∀k : ¬Asks(i, k) rooti = i; pari = j; reqi = i; f romi = i; toi = j; diri = ask;. i
(39) . . ∀(k, d) : ¬Onelocalf ault(i, d, k) ∧ ¬T ree(i)∧ ∀k : ¬Asks(i, k) ∧ ¬Oneparf ault(i) rooti = pari = i; disti = 0; reqi = f romi = toi = diri = ⊥;. " i
(40) '. . i
(41) ∃j : Asks(i, j) ∧ Grants(j, i) ∧ distj + 1 ∈ INf rooti = rootj ; pari = j; disti = distj + 1; reqi = f romi = toi = diri = ⊥;. . . ∀(k, d) : ¬Onelocalf ault(i, d, j) ∧ Sat(i)∧ ¬Rgcorrect(i) reqi = f romi = toi = diri = ⊥;. &%. '. (. -. .-0/. =<. .-. * #$ i
(42). Sat(i) ∧ i = root i ∧ F orwN a(i, i) diri = grant;. '×®<ÁÃeYx \ x £ x . :9;1. 8/O1. K/. ML. -. P+. 21 ?/. .-0/ QSRT=<U6. WV. X<. ?<UZ. Y/. 21. 8V. ). diri = grant;. 8/. ?/. ?DFE GIHJC. >A. [6. i
(43) Sat(i) ∧ ∃j : (F orwN a(i, j) ∧ Grants(j, i)) . 76. >6 8/. @) BA=C. reqi = reqj ; f romi = j; toi = pari ; diri = ask;. *) ,+. 21 43 215) /. N 21,). ) #$ i (j)
(44) Sat(i) ∧ Idle(i) ∧ (Asks(j, i) ∨ F orwN a(j, i)) . +. #"$". i. T ree(i) ∧ Ownrmax(i) 6= i ∧ Sat(Ownrmax(i))∧ ∀k ∈ Child(i) : (rootk = rootOwnrmax(i) ⇒ distk = distOwnrmax(i) + 2) reqi = i; f romi = i; toi = Ownrmax(i); diri = ask; rooti = i; pari = Ownrmax(i). ( #$ ! $ . i
(45) . Ñ #Î x¤¥½* z¼vª©xÃv©5]¡# ¬£¬(ÀZ§Ùv¯ kÁéx©p]\\]£k'ox 'x¼k xx¬ À»x ¼¤ ¯ +/¤e ( xZ ]\` x¥5¢ ¥ <£ Yxx Bx £ < ] §\Áà ¤,D©\©5 x\ £ £ x x £ & ]` ¤#] £ £ ? |x ¯ 'x¼x ]#©|x
(46) B+< ¢¥5 £ + ¥5 ¼k§?©5ÁÃ\ pÇ¥'» xÇ¥ x£ <¢]]]x &¥¤b¼?»© ©¯ & e+ ¯ ]D¼? ££ xÉ ©| ɧ ÉÎ /Ì¢Ò Ö ÛØ øµ å §/å æ+¦´éªÀ"xãàk£ â ºZå §/+Ԣ⠯ § áåÉ· |5x¸+<ä?ç ã x`´³| äU ]ã+§ é `é å. ã `ã+¸ ô ãà <ã+ä?çZ³|âf´é á+éZæ 5¸ `âåä `¡
(47) Û]ÝÝ¥ñ¥§ Ö ùIØ øók§,¦ ª\'ÀZ¡kºZ §, ë'x| É ¡(kx© £ xö*|§¼ø êe§ön x ɤ\ ¬â À|`é§ âå `éZ`éá+âf´Yã+éZá+·
(48) ã ¶ ãç ´ `â ` ´ ã]³|µ å âå å æ+æ ´é
(49) ¢· \ ã `´â ¥ä 5¡ Ú\íð® ÛIï ùxí¡Û]ÝÝܧ Ö ×+Ø ?x §/£êƼ§Ô¢ Õ|À| £ §º¥\ f§ x< ã+ äv ävp³|é¤|´Yµ á+âf (´Yã+é'» »ãàt©â å
(50) n¡ÉÛ+ñ|ÅÛÛIÈ`® ðxÚ\× |ðxÚÚ¡Û]Ý¥ñIÚ§ Ö ÚxغZ§Ô¢ ¯ §
(51) å· à ô 5âá ´· ´ ]á+âf´Yã+é§Dön½Á ì ]¡ùxÜÜܧ Ö ïIغZ§\¨e x \ ¿\x» £ ®Ù¦§ ¨e ©|x §Â ]+¦?b&Ç| ] £ ¼nnb ]`Yx É § `é]à ã `ä(á+âf´Yã+é ã]µ å `´é /åâfå `¡+ïxÝ® ùxíÛ ùxíí¡+Û]ÝÝð§ Ö ð+ئ%ºZ§Y¨ex \É¡o\ ¦x§¨e¿©| ¡ox x£ ºZ§ #¿§ xì (x +ªÕÉ § àã © `xä(á+âf´Yã+»é¡Zù|® ]×\ù§ ù ||××ã+³í `¡éZÛ]á+Ý·'Ýðã§à <ã+ä?çZ³|âf´é bá+éZæ `éô Ö ñ]غZ§+\¨e x\ É¡In¦§+¨e¬©| Ào¡+©x x£ |ºZ§ #¼§ § ì `é ( xã] µ +å Õå Éæ+§x´é x ãà â<ã+å ä?çZ³|â âf´é x
(52) ¢¡ÉéÛ]éݳݥá+ñ¥· §
(53) 5¸+ä?çã `´³|ä ã+é
(54) DççZ· ´Yå æ Ö í+Ø ºZ§#ë' £ | §»`éx £ ã]Ôµ å § å ì æ+´é ?§nãà â xå l |â x
(55) ¢ é£ é¼³á+·
(56) | £ çZ5³|¸+ä?âf´éçxã ¡É`´Û]³|Ýä Ý\ï|§ ã+é `´éZµ´ çZ· å Hãà ´ `â `´ ³|âå µ æ <ã+ävô Ö Ý+Øö*`³|§Ã´ä º| <ã+ä? çZ£ ³|]âf´§Æé º¥5 ³ `è+ åx¸ ` ¡ ù]ï|+® Ú¥ ï É|𥧠ñ¥¡5
(57) Û]ÝÝק 5¸+ä?çã+ô Ö Û]Ü+بvx§ Á/f§ £ ` éâ ?ã]æ+³ ¯µâf´Y ã+é¿ ¤ âã ì ´]`â `¡ú´ ³|â]å æ
Documents relatifs
The receiving order can be expected if those parameters are set correctly – however, in real implementations, there might exist mis-configured routers, or even compromised routers
The computation of minimum spanning tree (MST) on the gradient of an image is one of the main ingredients for the characterization of structures in different image processing
Le protocole spanning tree utilise les BPDU pour élire le commutateur root et le port root pour le réseau commuté, aussi bien que le port root et le port désigné pour chaque
• For each reachable neighbor j, node i maintains a neighbor verifier N V i,j. When a sensor is deployed, the administrator pre-loads it with its local chain for one hop
Keywords Home Network · WiFi · HomePlug AV · Agent · QoS · Knowledge Plane · Ontology · Through- put
Key words: continuum percolation, hyperbolic space, stochastic geometry, random geometric tree, Radial Spanning Tree, Poisson point processes.. AMS 2010 Subject Classification:
Moreover, when used for xed classes G of graphs having optimum (APSPs) compact routing schemes, the construction of an MDST of G ∈ G may be performed by using interval, linear
Therefore, having a spanning tree with minimum diameter of arbitrary networks makes it possible to design a wide variety of time- efficient distributed algorithms.. In order