Multi-party distributed audio service with TCP fairness
Proceedings of the tenth ACM international conference on Multimedia
Pastiche: making backup cheap and easy
ACM SIGOPS Operating Systems Review - OSDI '02: Proceedings of the 5th symposium on Operating systems design and implementation
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Total recall: system support for automated availability management
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Wireless opportunistic podcasting: implementation and design tradeoffs
Proceedings of the second ACM workshop on Challenged networks
A socio-aware overlay for publish/subscribe communication in delay tolerant networks
Proceedings of the 10th ACM Symposium on Modeling, analysis, and simulation of wireless and mobile systems
Diversity of forwarding paths in pocket switched networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Storage routing for DTN congestion control: Research Articles
Wireless Communications & Mobile Computing - Wireless Ad Hoc and Sensor Networks
How small labels create big improvements
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
The resource pooling principle
ACM SIGCOMM Computer Communication Review
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs
IEEE Transactions on Mobile Computing
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Encounter: based routing in DTNs
ACM SIGMOBILE Mobile Computing and Communications Review
N-Drop: congestion control strategy under epidemic routing in DTN
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Beyond friendship graphs: a study of user interactions in Flickr
Proceedings of the 2nd ACM workshop on Online social networks
Equilibria in Dynamic Selfish Routing
SAGT '09 Proceedings of the 2nd International Symposium on Algorithmic Game Theory
Data Dissemination in Delay and Disruption Tolerant Networks Based on Content Classification
MSN '09 Proceedings of the 2009 Fifth International Conference on Mobile Ad-hoc and Sensor Networks
Proceedings of the 8th international conference on Mobile systems, applications, and services
Retiring replicants: congestion control for intermittently-connected networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Decongesting opportunistic social-based forwarding
WONS'10 Proceedings of the 7th international conference on Wireless on-demand network systems and services
Replica Placement in P2P Storage: Complexity and Game Theoretic Analyses
ICDCS '10 Proceedings of the 2010 IEEE 30th International Conference on Distributed Computing Systems
Congestion aware data dissemination in social opportunistic networks
ACM SIGMOBILE Mobile Computing and Communications Review
Wardrop Equilibrium Formulation of Resource-Constrained DTN Routing in Public Safety Networks
MASS '11 Proceedings of the 2011 IEEE Eighth International Conference on Mobile Ad-Hoc and Sensor Systems
Building a reference combinatorial model for MANETs
IEEE Network: The Magazine of Global Internetworking
Fair content dissemination in participatory DTNs
Ad Hoc Networks
Adaptive user anonymity for mobile opportunistic networks
Proceedings of the seventh ACM international workshop on Challenged networks
Hi-index | 0.00 |
Detecting and dealing with congestion in delay-tolerant networks (DTNs) is an important and challenging problem. Current DTN forwarding algorithms typically direct traffic towards more central nodes in order to maximise delivery ratios and minimise delays, but as traffic demands increase these nodes may become saturated and unusable. We propose CafRep, an adaptive congestion aware protocol that detects and reacts to congested nodes and congested parts of the network by using implicit hybrid contact and resources congestion heuristics. CafRep exploits localised relative utility based approach to offload the traffic from more to less congested parts of the network, and to replicate at adaptively lower rate in different parts of the network with non-uniform congestion levels. We extensively evaluate our work against benchmark and competitive protocols across a range of metrics over three real connectivity and GPS traces such as Sassy [44], San Francisco Cabs [45] and Infocom 2006 [33]. We show that CafRep performs well, independent of network connectivity and mobility patterns, and consistently outperforms the state-of-the-art DTN forwarding algorithms in the face of increasing rates of congestion. CafRep maintains higher availability and success ratios while keeping low delays, packet loss rates and delivery cost. We test CafRep in the presence of two application scenarios, with fixed rate traffic and with real world Facebook application traffic demands, showing that regardless of the type of traffic CafRep aims to deliver, it reduces congestion and improves forwarding performance.