Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
Network reliability and algebraic structures
Network reliability and algebraic structures
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
Path set selection in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A transport layer approach for achieving aggregate bandwidths on multi-homed mobile hosts
Proceedings of the 8th annual international conference on Mobile computing and networking
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Multipath routing mechanisms for traffic engineering and quality of service in the internet
Multipath routing mechanisms for traffic engineering and quality of service in the internet
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
MAR: a commuter router infrastructure for the mobile Internet
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Analysis of multipath Routing-Part I: the effect on the packet delivery ratio
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
IEEE Spectrum
Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?
IEEE Communications Magazine
Improving UDP and TCP performance in mobile ad hoc networks with INSIGNIA
IEEE Communications Magazine
Multipath routing in the presence of frequent topological changes
IEEE Communications Magazine
Unified transport layer support for data striping and host mobility
IEEE Journal on Selected Areas in Communications
A negotiation framework for content distribution in mobile transient networks
Journal of Network and Computer Applications
p-persistent frame replication for resilient services in multi-radio wireless networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Optimized multipath network coding in lossy wireless networks
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Reliable adaptive multipath provisioning with bandwidth and differential delay constraints
INFOCOM'10 Proceedings of the 29th conference on Information communications
Path diversity over packet switched networks: performance analysis and rate allocation
IEEE/ACM Transactions on Networking (TON)
Journal of Network and Computer Applications
| Hi-index | 0.00 |
We study the problem of using path diversification to provide low probability of packet loss (PPL) in wireless networks. Path diversification uses erasure codes and multiple paths in the network to transmit packets. The source uses Forward Error Correction (FEC) to encode each packet into multiple fragments and transmits the fragments to the destination using multiple disjoint paths. The source uses a load balancing algorithm to determine how many fragments should be transmitted on each path. The destination can reconstruct the packet if it receives a number of fragments equal to or higher than the number of fragments in the original packet. We study the load balancing algorithm in two general cases. In the first case, we assume that no knowledge of the performance along the paths is available at the source. In such a case, the source decomposes traffic uniformly among the paths; we call this case blind load balancing. We show that for low PPL, blind load balancing outperforms single-path transmission. In the second case, we assume that a feedback mechanism periodically provides the source with information about the performance along each path. With that information, the source can optimally distribute the fragments. We show how to distribute the fragments for minimized PPL, and maximized efficiency given a bound on PPL. We evaluate the performance of the scheme through numerical simulations.