8/16/2019 Fyp Pres

1/26

05/31/16 School of Computer 1

Welcome

  Final ear !ro"ect #ral !re$entation

  Title% Analysis of Fuzzy-Neuro

Network Communications  Stu&ent% 'hang (inhua

  )uration% *anuar+ 003 - *une 003

  Super.i$or% /! !eter 2oh

  Eaminer% /! 4ue io Chai

8/16/2019 Fyp Pres

2/26

05/31/16 School of Computer

!ro"ect #7"ecti.e

8n.e$tigate the u$e of fu99+ logic in routing &eci$ion$ on

un$ta7le or unrelia7le communication net:or$

Unif+ the fu99+ $+$tem for .ariou$ net:or topologie$,e$peciall+ the rule 7a$e an& mem7er$hip function$

8mplement the ne: fu99+ routing $+$tem on F!;

!ro.i&e a 7a$i$ for &e.elopment of ne:, intelligent an&

high

8/16/2019 Fyp Pres

3/26

05/31/16 School of Computer 3

Ta$$ Fini$he&

  Eplore fu99+ neural net:or applie& in net:or communication$

  )e$ign of fault

8/16/2019 Fyp Pres

4/26

05/31/16 School of Computer >

Ta$$ Fini$he& ?1@

  Eplore fu99+ neural net:or applie& in net:or communication$

  )e$ign of fault

8/16/2019 Fyp Pres

5/26

05/31/16 School of Computer 5

Fu99+ Neural Net:or 

  Strength$ A  Fu99+ characteri$tic pro.i&e$ interpreta7le human

8/16/2019 Fyp Pres

6/26

05/31/16 School of Computer 6

rchitecture of ;enSoFNN

8/16/2019 Fyp Pres

7/2605/31/16 School of Computer B

 ppl+ing FNN to outing, Darrier$

  Eponentiall+ gro:ing num7er of rule$

am&ani

  TS 

8/16/2019 Fyp Pres

8/2605/31/16 School of Computer

 ppl+ing FNN to outing, Darrier$

)ifficult+ in &i$cu$$ion of non

8/16/2019 Fyp Pres

9/2605/31/16 School of Computer G

Ta$$ Fini$he& ?@

  Eplore fu99+ neural net:or applie& in net:or communication$

  )e$ign of fault

8/16/2019 Fyp Pres

10/2605/31/16 School of Computer 10

Dacgroun& of ;au$$ian Cu7e ?GC @

  !ropo$e& 7+ )r W * $u

  erit$

 A  the interconnection &en$it+ an& algorithmic efficienc+

are line& 7+ a common parameter, the .ariation of:hich can $cale routing performance accor&ing to

traffic loa&$ :ithout changing the routing algorithm

 A  $uch communication primiti.e$ a$ unica$ting,

multica$ting, 7roa&ca$ting/gathering can al$o 7e &one

rather efficientl+

 8$$ue% no ei$ting fault

8/16/2019 Fyp Pres

11/26

05/31/16 School of Computer 11

FT outing algorithm for ;au$$ian Cu7e

Chief a&.antage$ ?for GC ?n, α@@

?1@ 8ncur$ me$$age o.erhea& of onl+ O?n@

?@ The computation compleit+ for interme&iateno&e$ i$ O?α?n@ ;uarantee$ a me$$age path length not ecee&ing F  longer than the optimal path foun& in a fault<free $etting, pro.i&e& the &i$tri7ution of fault$ inthe net:or $ati$fie$ $ome con$traint$

?5@ ;enerate$ &ea&loc

8/16/2019 Fyp Pres

12/26

05/31/16 School of Computer 1

Chief Techni=ue$ &opte& ?1@

 ;au$$ian Tree ?GT α for GC ?n, α@@

Significance%  man+

8/16/2019 Fyp Pres

13/26

05/31/16 School of Computer 13

  Chief Techni=ue$ &opte& ?@

 Fault categori9ation A , D, C < Categor+ ?partition@

 A Significance% o.ercome the pro7lem of lo: no&ea.aila7ilit+, :ith refine& anal+$i$ of fault$H location

8/16/2019 Fyp Pres

14/26

05/31/16 School of Computer 1>

Ta$$ Fini$he& ?3@

  Eplore fu99+ neural net:or applie& in net:or communication$

  )e$ign of fault

8/16/2019 Fyp Pres

15/26

05/31/16 School of Computer 15

Dacgroun& of Fi7onacci Cu7e

  !ropo$e& 7+ )r W * $u

  erit$

 A  u$e fe:er lin$ than the compara7le h+percu7e$, :ith

the $cale increa$ing far le$$ fa$t than h+percu7e,allo:ing more choice$ of net:or $i9e

 A  allo: efficient emulation of other topologie$ $uch a$

 7inar+ tree ?inclu&ing it$ .ariant$@ an& h+percu7e 

  8$$ue% no ei$ting fault

8/16/2019 Fyp Pres

16/26

05/31/16 School of Computer 16

outing algorithm for Fi7onacci Cu7e ? FC @

Significance% maing FC  a more fault

8/16/2019 Fyp Pres

17/26

05/31/16 School of Computer 1B

Ta$$ Fini$he& ?>@

  Eplore fu99+ neural net:or applie& in net:or communication$

  )e$ign of fault

8/16/2019 Fyp Pres

18/26

05/31/16 School of Computer 1

Echange& +percu7e ? EH @  !ropertie$ an& merit$

?1@  e&uce the num7er of lin to 1/n of 7inar+ h+percu7e :ith

the $ame num7er of no&e

?@ amiltonian propert+, uniform no&e &egree, lo: &iameter,

an& .ariou$ po$$i7ilitie$ of &ecompo$ition

?3@ ;oo& emulation of ;au$$ian Cu7e, 7inar+ h+percu7e, ring,

me$h

?>@ Extended Binomial Tree i$ foun& a$ $panning tree, helping

to $ol.e 7roa&ca$ting an& loa& 7alancing?5@ )ea&loc/li.eloc free fault tolerant routing algorithm

&e$igne& an& the num7er of hop$ i$ tightl+ 7oun&e&

8/16/2019 Fyp Pres

19/26

05/31/16 School of Computer 1G

Ta$$ Fini$he& ?5@

  Eplore fu99+ neural net:or applie& in net:or communication$

  )e$ign of fault

8/16/2019 Fyp Pres

20/26

05/31/16 School of Computer 0

Simulator rchitecture

8/16/2019 Fyp Pres

21/26

05/31/16 School of Computer 1

Simulation re$ult$

  Fi7onacci Cu7e

Log2(Throughput) - Dimension

0

5

10

15

20

25

30

5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

Dimension

   L  o  g   2   (   T   h  r  o  u  g   h  p  u   t   )

Regular 

Enhanced

Extended

Binary

throughput

?logarithm@ offault+

8/16/2019 Fyp Pres

22/26

05/31/16 School of Computer

Simulation re$ult$

  Fi7onacci Cu7e

2atenc+ ofFault

8/16/2019 Fyp Pres

23/26

05/31/16 School of Computer 3

Simulation re$ult$

Throughputan& 2atenc+

?logarithm@ of

(FC13?1>@

:ith re$pect

to num7er of

fault$

  Fi7onacci Cu7e

8/16/2019 Fyp Pres

24/26

05/31/16 School of Computer >

Ta$$ Fini$he& ?6@

  Eplore fu99+ neural net:or applie& in net:or communication$

  )e$ign of fault

8/16/2019 Fyp Pres

25/26

05/31/16 School of Computer 5

!ropo$al for future re$earch

;i.e theoretical proof for the fault

8/16/2019 Fyp Pres

26/26

05/31/16 School of Computer 6

4ue$tion$

are

:elcome&

4ue$tion an& n$:er Se$$ion