Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Resource and performance tradeoffs in delay-tolerant wireless networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Event-driven, role-based mobility in disaster recovery networks
Proceedings of the second ACM workshop on Challenged networks
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
On clustering phenomenon in mobile partitioned networks
Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Backpressure-based routing protocol for DTNs
Proceedings of the ACM SIGCOMM 2010 conference
Locus: a location-based data overlay for disruption-tolerant networks
Proceedings of the 5th ACM workshop on Challenged networks
Back-pressure routing and rate control for ICNs
Proceedings of the sixteenth annual international conference on Mobile computing and networking
Using buffer space advertisements to avoid congestion in mobile opportunistic DTNs
WWIC'11 Proceedings of the 9th IFIP TC 6 international conference on Wired/wireless internet communications
Buffer dimensioning of delay-tolerant network nodes - a large deviations approach
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
A routing protocol for socially selfish delay tolerant networks
Ad Hoc Networks
Timescale decoupled routing and rate control in intermittently connected networks
IEEE/ACM Transactions on Networking (TON)
Delay Tolerant Payload Conditioning protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
The widespread availability of mobile wireless devices offers growing opportunities for the formation of temporary networks with only intermittent connectivity. These intermittently-connected networks (ICNs) typically lack stable end-to-end paths. In order to improve the delivery rates of the networks, new store-carry-and-forward protocols have been proposed which often use message replication as a forwarding mechanism. Message replication is effective at improving delivery, but given the limited resources of ICN nodes, such as buffer space, bandwidth and energy, as well as the highly dynamic nature of these networks, replication can easily overwhelm node resources. In this work we propose a novel node-based replication management algorithm which addresses buffer congestion by dynamically limiting the replication a node performs during each encounter. The insight for our algorithm comes from a stochastic model of message delivery in ICNs with constrained buffer space. We show through simulation that our algorithm is effective, nearly tripling delivery rates in some scenarios, and imposes no or little overhead.