| dc.creator | Abbas, Ash Mohammad | |
| dc.date | 2007-04 | |
| dc.date | 2011-09-01T03:00:00Z | |
| dc.identifier | http://sedici.unlp.edu.ar/handle/10915/9556 | |
| dc.identifier | http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Apr07-TO1.pdf | |
| dc.identifier | issn:1666-6038 | |
| dc.description | In this thesis, we emphasized the need to use multiple node-disjoint paths between a given source and destination. The use of node-disjoint paths not only allows different paths to share the traffic, but also provides fault-tolerance to some extent. However, design of a distributed protocol that relies on partial topology information to identify multiple node-disjoint paths between a given pair of nodes is a challenging task. In this thesis, our main focus is to discuss protocols to discover node-disjoint paths between a given pair of nodes. The contributions of the thesis are as follows. | |
| dc.description | Facultad de Informática | |
| dc.format | application/pdf | |
| dc.format | 191-193 | |
| dc.language | en | |
| dc.relation | Journal of Computer Science & Technology | |
| dc.relation | vol. 7, no. 2 | |
| dc.rights | http://creativecommons.org/licenses/by-nc/3.0/ | |
| dc.rights | Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) | |
| dc.subject | Ciencias Informáticas | |
| dc.title | Disjoint multipath routing for mobile ad hoc networks | |
| dc.type | Articulo | |
| dc.type | Revision | |
