CASPaR: Congestion avoidance shortest path routing for delay tolerant networks
Unlike traditional transmission control protocol/Internet protocol–based networks, delay/disruption tolerant networks may experience connectivity disruptions and guarantee no end-to-end connectivity between source and destination. As the popularity of delay/disruption tolerant networks continues to...
Saved in:
| Main Authors: | Michael Stewart, Rajgopal Kannan, Amit Dvir, Bhaskar Krishnamachari |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-11-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147717741264 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Intra-Domain Routing Protection Scheme Based on the Minimum Cross-Degree Between the Shortest Path and Backup Path
by: Haijun Geng, et al.
Published: (2025-07-01) -
The Shortest Path Problem for a Multiple Graph
by: Alexander V. Smirnov
Published: (2017-12-01) -
Algorithms for Searching the Shortest Path and Its Modification
by: N. I. Listopad, et al.
Published: (2016-06-01) -
Algorithms for Searching the Shortest Path and Its Modification
by: N. I. Listopad, et al.
Published: (2016-06-01) -
Smart forest monitoring: A novel Internet of Things framework with shortest path routing for sustainable environmental management
by: Alireza Etaati, et al.
Published: (2024-09-01)