2013 27th International Conference on Advanced Information Networking and Applications Workshops (2009)

Bradford, United Kingdom

May 26, 2009 to May 29, 2009

ISBN: 978-0-7695-3639-2

pp: 419-424

ABSTRACT

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

Geoff West,
Sieteng Soh,
Johannes Ulrich Herrmann,
Suresh Rai,
"Using Multi-valued Decision Diagrams to Solve the Expected Hop Count Problem",

*2013 27th International Conference on Advanced Information Networking and Applications Workshops*, vol. 00, no. , pp. 419-424, 2009, doi:10.1109/WAINA.2009.124SEARCH