Download now Free registration required
Multiple-path source routing protocols allow a data source node to distribute the total traffic among available paths. In this paper, the authors consider the problem of jamming-aware source routing in which the source node performs traffic allocation based on empirical jamming statistics at individual network nodes. They formulate this traffic allocation as a lossy network flow optimization problem using portfolio selection theory from financial statistics. They show that in multi-source networks, this centralized optimization problem can be solved using a distributed algorithm based on decomposition in Network Utility Maximization (NUM). They demonstrate the network's ability to estimate the impact of jamming and incorporate these estimates into the traffic allocation problem. Finally, they simulate the achievable throughput using their proposed traffic allocation method in several scenarios.
- Format: PDF
- Size: 318.73 KB