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 multisource 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.
- Format: PDF
- Size: 905.3 KB