A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Forwarding in a content-based network
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Congestion avoidance in a data-centric opportunistic network
Proceedings of the ACM SIGCOMM workshop on Information-centric networking
A social node model for realising information dissemination strategies in delay tolerant networks
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
LCD-Net: lowest cost denominator networking
ACM SIGCOMM Computer Communication Review
Beyond ubiquitous computing: The Malaysian HoneyBee project for Innovative Digital Economy
Computer Standards & Interfaces
| Hi-index | 0.00 |
Delay-tolerant and opportunistic networks relax the traditional assumption of end-to-end connectivity. Such networks are therefore suitable for content dissemination in sparsely connected regions of the world, and for complementing existing infrastructure by operating cost-free, high bandwidth, albeit high latency, content delivery services. In this work we argue, however, that content dissemination in the above contexts requires us to revisit delay-tolerant communication at the architectural level, looking at multiple issues such as naming and addressing, congestion control and application interfaces. We propose a new architecture, called Haggle, that leverages the principles of search, as known from desktop operating systems and the Web, in order to achieve truly data-centric communication. Searching is naturally data-centric and embeds principles, such as ranking, that can be used to bind data to interested receivers and to prioritize the data to send during node encounters. We herein give an overview of the Haggle architecture and its basic design.