Subir material

Suba sus trabajos a SEDICI, para mejorar notoriamente su visibilidad e impacto

 

Mostrar el registro sencillo del ítem

dc.date.accessioned 2011-09-01T12:21:54Z
dc.date.available 2011-09-01T03:00:00Z
dc.date.issued 2007-04
dc.identifier.uri http://sedici.unlp.edu.ar/handle/10915/9556
dc.description.abstract 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. en
dc.format.extent 191-193 es
dc.language en es
dc.subject Network Protocols es
dc.subject multiple node-disjoint en
dc.title Disjoint multipath routing for mobile ad hoc networks en
dc.type Articulo es
sedici.identifier.uri http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Apr07-TO1.pdf es
sedici.identifier.issn 1666-6038 es
sedici.creator.person Abbas, Ash Mohammad es
sedici.subject.materias Ciencias Informáticas es
sedici.description.fulltext true es
mods.originInfo.place Facultad de Informática es
sedici.subtype Revision es
sedici.rights.license Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)
sedici.rights.uri http://creativecommons.org/licenses/by-nc/3.0/
sedici.description.peerReview non-peer-review es
sedici2003.identifier ARG-UNLP-REV-0000000446 es
sedici.relation.journalTitle Journal of Computer Science & Technology es
sedici.relation.journalVolumeAndIssue vol. 7, no. 2 es


Descargar archivos

Thumbnail
Documento completo
Descargar archivo (44.87Kb) - PDF
Icon
Enlace externo

Este ítem aparece en la(s) siguiente(s) colección(ones)

Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0) Excepto donde se diga explícitamente, este item se publica bajo la siguiente licencia Creative Commons Attribution-NonCommercial 3.0 Unported (CC BY-NC 3.0)