Using Multi-valued Decision Diagrams to Solve the Expected Hop Count Problem
2009 International Conference on Advanced Information Networking …, 2009•ieeexplore.ieee.org
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 2times100 grid network with 2 99 paths, which is unsolvable using
existing techniques. We show that OMDD-A generates significantly fewer nodes than the …
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 2times100 grid network with 2 99 paths, which is unsolvable using
existing techniques. We show that OMDD-A generates significantly fewer nodes than the …
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 2times100 grid network with 2 99 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.
ieeexplore.ieee.org
Résultat de recherche le plus pertinent Voir tous les résultats