Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
On hop-by-hop rate-based congestion control
IEEE/ACM Transactions on Networking (TON)
Improving TCP performance over mobile networks
ACM Computing Surveys (CSUR)
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Link-level measurements from an 802.11b mesh network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Analyzing the impact of mobility in ad hoc networks
REALMAN '06 Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality
End-to-end vs. hop-by-hop transport
ACM SIGMETRICS Performance Evaluation Review
Adaptive routing in mobile opportunistic networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Comparative study of two CPU router time management algorithms in cellular IP networks
International Journal of Network Management
Maximizing the Flow Reliability in Cellular IP Network Using PSO
International Journal of Interdisciplinary Telecommunications and Networking
| Hi-index | 0.00 |
This paper revisits the fundamental trade-off between end-to-end and hop-by-hop transport control. The end-to-end principle has been one of the building blocks of the Internet; but in real-world wireless scenarios, end-to-end connectivity is often intermittent, limiting the performance of end-to-end transport protocols. We use a stochastic model that captures both the availability ratio of links and the duration of link disruptions to represent intermittent connectivity. We compare the performance of end-to-end and hop-by-hop transport over an intermittently-connected path. End-to-end, perhaps surprisingly, may perform better than hop-by-hop transport under long disruption periods. We propose the spaced hop-by-hop policy which is found to dominate (in terms of delivery ratio) the end-to-end policy over the whole parameter range and the basic hop-by-hop policy over most of the relevant range.