Jornadas mais Rápidas e Compromissos em DTNs

Alfredo GoldmanCássia G. FerreiraCésar G. MachadoPaulo H. Floriano

This article describes two algorithms to compute Fastest Journeys inDelay and Disruption Tolerant Networks in which all connections can be predicted.The first one corresponds to an algorithm already proposed, but neverbefore implemented. The second one uses a new idea, which can be extended tocompute other types of optimal journeys. Based on this new algorithm, we studiedthe relationship between the arrival time, the hopcount and the transit timeof a journey, searching for optimal intermediate journeys that minimize two ormore parameters at the same time. We present in the paper several experimentsthat show the importance of the proposed approach.

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato:
     Mantida por: