Portfolio Selection in Multipath Routing for Traffic Allocation

Authors

  • Dr. M. Karunakar Reddy

Keywords:

Jamming, Multiple path routing, Portfolio selection theory, Routing, Wireless Network, Network utility maximization

Abstract

Multiple-path source routing protocols allow a data source node to distribute the total traffic among available paths. In this article, we consider the problem of jammingaware source routing in which the source node performs traffic allocation based on empirical jamming statistics at individual network nodes. We formulate this traffic allocation as a lossy network flow optimization problem using portfolio selection theory from financial statistics. We 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). We demonstrate the network2019;s ability to estimate the impact of jamming and incorporate these estimates into the traffic allocation problem. Finally, we simulate the achievable throughput using our proposed traffic allocation method in several scenarios.

How to Cite

Dr. M. Karunakar Reddy. (2012). Portfolio Selection in Multipath Routing for Traffic Allocation. Global Journal of Computer Science and Technology, 12(E14), 7–11. Retrieved from https://computerresearch.org/index.php/computer/article/view/292

Portfolio Selection in Multipath Routing for Traffic Allocation

Published

2012-03-15