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...
Main Authors: | Michael Stewart, Rajgopal Kannan, Amit Dvir, Bhaskar Krishnamachari |
---|---|
Format: | Article |
Language: | English |
Published: |
SAGE Publishing
2017-11-01
|
Series: | International Journal of Distributed Sensor Networks |
Online Access: | https://doi.org/10.1177/1550147717741264 |
Similar Items
-
CASPaR: Congestion Avoidance Shortest Path Routing for Delay Tolerant Networks
by: Stewart, Michael F.
Published: (2015) -
A Study of Shortest-Path Fault Tolerant Routing in 2D Meshes
by: Dao-Tong Chang, et al.
Published: (1999) -
Dynamic Routing with Congestion Control in Delay-Tolerant Networks
by: Chuan-Lung Lu, et al.
Published: (2011) -
Shortest Routing and Deadlock Avoidance for Automated Guided Vehicles
by: Chun-chiyeh Chiyu, et al.
Published: (2010) -
Shortest Path Routing Modelling, Infeasibility and Polyhedra
by: Call, Mikael
Published: (2012)