![]() |
Volumn 10, Issue 10, 2006, Pages 734-736
|
Proof of a modified Dijkstra's algorithm for computing shortest bundle delay in networks with deterministically time-varying links
|
Author keywords
Delay tolerant networks; Routing; Shortest path
|
Indexed keywords
ALGORITHMS;
DATA COMMUNICATION SYSTEMS;
FAULT TOLERANT COMPUTER SYSTEMS;
TIME VARYING SYSTEMS;
DELAY-TOLERANT NETWORKS;
ROUTING;
SHORTEST-DELAY PATH;
TIME-VARYING LINKS;
COMPUTER NETWORKS;
|
EID: 33750040520
PISSN: 10897798
EISSN: None
Source Type: Journal
DOI: 10.1109/LCOMM.2006.051982 Document Type: Article |
Times cited : (24)
|
References (7)
|