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...

Full description

Bibliographic Details
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
id doaj-ea96e245648b4e649ebfd98e2653d6fa
record_format Article
spelling doaj-ea96e245648b4e649ebfd98e2653d6fa2020-11-25T02:55:15ZengSAGE PublishingInternational Journal of Distributed Sensor Networks1550-14772017-11-011310.1177/1550147717741264CASPaR: Congestion avoidance shortest path routing for delay tolerant networksMichael Stewart0Rajgopal Kannan1Amit Dvir2Bhaskar Krishnamachari3Department of Computer Science, Louisiana State University, Baton Rouge, LA, USAUS Army Research Laboratory, Los Angeles, CA, USACyber Technology Innovation Center, Department of Computer Science, Ariel University, Ariel, IsraelUS Army Research Laboratory, Los Angeles, CA, USAUnlike 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 rise, so does the need for a robust and low-latency routing protocol. A one-copy, shortest path delay/disruption tolerant network routing protocol that addresses congestion avoidance and maximizes total network bandwidth utility is crucial to efficient packet delivery in high-load networks and is the motivation behind the development of the congestion avoidance shortest path routing. Congestion avoidance shortest path routing is designed to either route undeliverable packets “closer” to their destinations or hold onto them when advantageous to do so. Congestion avoidance and bottleneck minimization are integrated into its design. Moreover, congestion avoidance shortest path routing negotiates node queue differentials between neighbors similar to backpressure algorithms and maps shortest paths without any direct knowledge of node connectivity outside of its own neighborhood. Simulation results show that congestion avoidance shortest path routing outperforms well-known protocols in terms of packet delivery probability and latency and is still quite efficient in terms of overhead requirements. Finally, we explore the effectiveness of modeling a variant of congestion avoidance shortest path routing based on the resistance to current flow of electrical circuits in an attempt to further reduce network congestion. Preliminary results indicate a noticeable performance increase when this method is used.https://doi.org/10.1177/1550147717741264
collection DOAJ
language English
format Article
sources DOAJ
author Michael Stewart
Rajgopal Kannan
Amit Dvir
Bhaskar Krishnamachari
spellingShingle Michael Stewart
Rajgopal Kannan
Amit Dvir
Bhaskar Krishnamachari
CASPaR: Congestion avoidance shortest path routing for delay tolerant networks
International Journal of Distributed Sensor Networks
author_facet Michael Stewart
Rajgopal Kannan
Amit Dvir
Bhaskar Krishnamachari
author_sort Michael Stewart
title CASPaR: Congestion avoidance shortest path routing for delay tolerant networks
title_short CASPaR: Congestion avoidance shortest path routing for delay tolerant networks
title_full CASPaR: Congestion avoidance shortest path routing for delay tolerant networks
title_fullStr CASPaR: Congestion avoidance shortest path routing for delay tolerant networks
title_full_unstemmed CASPaR: Congestion avoidance shortest path routing for delay tolerant networks
title_sort caspar: congestion avoidance shortest path routing for delay tolerant networks
publisher SAGE Publishing
series International Journal of Distributed Sensor Networks
issn 1550-1477
publishDate 2017-11-01
description 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 rise, so does the need for a robust and low-latency routing protocol. A one-copy, shortest path delay/disruption tolerant network routing protocol that addresses congestion avoidance and maximizes total network bandwidth utility is crucial to efficient packet delivery in high-load networks and is the motivation behind the development of the congestion avoidance shortest path routing. Congestion avoidance shortest path routing is designed to either route undeliverable packets “closer” to their destinations or hold onto them when advantageous to do so. Congestion avoidance and bottleneck minimization are integrated into its design. Moreover, congestion avoidance shortest path routing negotiates node queue differentials between neighbors similar to backpressure algorithms and maps shortest paths without any direct knowledge of node connectivity outside of its own neighborhood. Simulation results show that congestion avoidance shortest path routing outperforms well-known protocols in terms of packet delivery probability and latency and is still quite efficient in terms of overhead requirements. Finally, we explore the effectiveness of modeling a variant of congestion avoidance shortest path routing based on the resistance to current flow of electrical circuits in an attempt to further reduce network congestion. Preliminary results indicate a noticeable performance increase when this method is used.
url https://doi.org/10.1177/1550147717741264
work_keys_str_mv AT michaelstewart casparcongestionavoidanceshortestpathroutingfordelaytolerantnetworks
AT rajgopalkannan casparcongestionavoidanceshortestpathroutingfordelaytolerantnetworks
AT amitdvir casparcongestionavoidanceshortestpathroutingfordelaytolerantnetworks
AT bhaskarkrishnamachari casparcongestionavoidanceshortestpathroutingfordelaytolerantnetworks
_version_ 1724717243596537856