This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2009 International Conference on Advanced Information Networking and Applications Workshops
Using Multi-valued Decision Diagrams to Solve the Expected Hop Count Problem
Bradford, United Kingdom
May 26-May 29
ISBN: 978-0-7695-3639-2
The Expected Hop Count (EHC) of a computer communication network has so far been computed for network models that consider only device or link failure, but not both. We introduce an Augmented Ordered Multi-valued Decision Diagram (OMDD-A) to obtain the EHC of a network in which both devices and links may fail. The OMDD-A approach can compute the EHC of a 2´100 grid network with 299 paths, which is unsolvable using existing techniques. We show that OMDD-A generates significantly fewer nodes than the corresponding ordered binary decision diagram, leading to large reductions in processing time.
Index Terms:
expected hop count, imperfect nodes, imperfect links, multi-value decision diagram, network reliability
Citation:
Johannes Ulrich Herrmann, Sieteng Soh, Geoff West, Suresh Rai, "Using Multi-valued Decision Diagrams to Solve the Expected Hop Count Problem," waina, pp.419-424, 2009 International Conference on Advanced Information Networking and Applications Workshops, 2009
Usage of this product signifies your acceptance of the Terms of Use.