Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Multicasting in delay tolerant networks: semantic models and routing algorithms
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
DTLSR: delay tolerant routing for developing regions
Proceedings of the 2007 workshop on Networked systems for developing regions
TierStore: a distributed filesystem for challenged networks in developing regions
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
Research challenges towards the Future Internet
Computer Communications
On the provision of advanced telecommunication services in rural areas
Telecommunication Economics
Universal scheme improving probabilistic routing in delay-tolerant networks
Computer Communications
CARPOOL: extending free internet access over DTN in urban environment
Proceedings of the 2013 ACM MobiCom workshop on Lowest cost denominator networking for universal access
Hi-index | 0.24 |
The DTN architecture is based around sender-initiated unicast communication that is insufficient or inconvenient to meet the needs of many applications. To address these limitations, we define a DTN session layer and associated extensions to the DTN bundle protocol that more naturally support receiver-driven applications and multicast communication. Within a session, we provide mechanisms allowing applications to convey ordering relationships between successive transmissions that can be used by the network to help ensure a distributed application's delivery ordering expectations are met. We also extend the bundle protocol's expiration procedures to support more efficient network utilization by allowing in-network deletion of obsolete messages. We present the design rationale and describe our implementation of these mechanisms and discuss their advantages in meeting the needs of several popular types of applications.