View Item 

Using multi-valued decision diagram to solve the expected hop count problem

Access Status
Open access
Authors
Date
2009
Type
Conference Paper

Metadata
Show full item record
Citation
Herrmann, Johannes u and Soh, Sieteng and West, Geoffrey and Rai, S. 2009. Using multi-valued decision diagram to solve the expected hop count problem, in Awan, I. and Younas,M. and Hara,T. and Durresi, A. (ed), AINA 2009, May 26 2009, pp. 419-424.Bradford,United Kingdom: IEEE Computer society.
Source Title
The IEEE 23rd international conference on advanced information networking and applications workshops/symposia
Source Conference
AINA 2009
Additional URLs
ISBN
Faculty
School of Science and Computing
Department of Computing
Faculty of Science and Engineering
Remarks

Copyright © 2009 IEEE This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

URI
Collection
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 2100 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.