Using multi-valued decision diagram to solve the expected hop count problem
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 link...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
IEEE Computer society
2009
|
| Subjects: | |
| Online Access: | http://www.inf.brad.ac.uk/~iawan/aina/home.php http://hdl.handle.net/20.500.11937/20073 |
| _version_ | 1848750207233163264 |
|---|---|
| author | Herrmann, Johannes u Soh, Sieteng West, Geoffrey Rai, S. |
| author2 | Irfan Awan |
| author_facet | Irfan Awan Herrmann, Johannes u Soh, Sieteng West, Geoffrey Rai, S. |
| author_sort | Herrmann, Johannes u |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T07:33:10Z |
| format | Conference Paper |
| id | curtin-20.500.11937-20073 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T07:33:10Z |
| publishDate | 2009 |
| publisher | IEEE Computer society |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-200732022-12-09T06:09:40Z Using multi-valued decision diagram to solve the expected hop count problem Herrmann, Johannes u Soh, Sieteng West, Geoffrey Rai, S. Irfan Awan Muhammad Younas Takahiro Hara Arjan Durresi network reliability imperfect nodes multi-value decision diagram expected hop count imperfect - links 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. 2009 Conference Paper http://hdl.handle.net/20.500.11937/20073 http://www.inf.brad.ac.uk/~iawan/aina/home.php IEEE Computer society fulltext |
| spellingShingle | network reliability imperfect nodes multi-value decision diagram expected hop count imperfect - links Herrmann, Johannes u Soh, Sieteng West, Geoffrey Rai, S. Using multi-valued decision diagram to solve the expected hop count problem |
| title | Using multi-valued decision diagram to solve the expected hop count problem |
| title_full | Using multi-valued decision diagram to solve the expected hop count problem |
| title_fullStr | Using multi-valued decision diagram to solve the expected hop count problem |
| title_full_unstemmed | Using multi-valued decision diagram to solve the expected hop count problem |
| title_short | Using multi-valued decision diagram to solve the expected hop count problem |
| title_sort | using multi-valued decision diagram to solve the expected hop count problem |
| topic | network reliability imperfect nodes multi-value decision diagram expected hop count imperfect - links |
| url | http://www.inf.brad.ac.uk/~iawan/aina/home.php http://hdl.handle.net/20.500.11937/20073 |