Switching White Papers
Explaining Routing Performance in Disruption Tolerant Networks
Overview Many routing algorithms for both traditional and ad hoc networks require a complete and contemporaneous path of peers from source to destination. Disruption Tolerant Networks (DTNs) attempt to deliver messages despite a frequently disconnected link layer (e.g., due to peer mobility, limited communication range, and power management limitations). While several algorithms have been proposed for routing in DTNs, this has not yet led to an understanding of the fundamental issues underlying routing performance in these networks. This paper explains the performance of routing algorithms for DTNs in terms of their ability to utilize a set of three no-cost drop criteria. The criteria are necessary and sufficient for identifying messages that may be dropped without degrading the overall delivery rate.
| Publisher | University of Massachusetts | File Format | |
|---|---|---|---|
| Date Published | August 2005 | ||
| Format | White Papers | ||
| Topics | |||


