Selfish Routing for Internet
Journal: Excel International Journal of Technology, Engineering and Management (Vol.1, No. 1)Publication Date: 2014-03-31
Authors : M. Ramya Devi; C. Mani;
Page : 104-107
Keywords : Game Theory; Optimization; Overlay; Relaxation; Selfish Routing; Traffic Engineering; Traffic Equilibrium.;
Abstract
A recent trend in routing research is to avoid inefficiencies in network-level routing by allowing hosts to either choose routes themselves (e.g., source routing) or use overlay routing networks (e.g., RON). Such approaches result in selfish routing, because routing decisions are no longer based on system-wide criteria but are instead designed to optimize hostbased or overlay-based metrics. A series of theoretical results showing that selfish routing can result in suboptimal system behavior have cast doubts on this approach. In this paper, we use a game-theoretic approach to investigate the performance of selfish routing in Internet-like environments based on realistic topologies and traffic demands in our simulations. We show that in contrast to theoretical worst cases, selfish routing achieves close to optimal average latency in such environments. However, such performance benefits come at the expense of significantly increased congestion on certain links. Moreover, the adaptive nature of selfish overlays can significantly reduce the effectiveness of traffic engineering by making network traffic less predictable
Other Latest Articles
- A Block Free Approach on Parallel Computing: An Algorithmic Study
- An Enhanced Adaptive Channel Allocation for Wireless Network Using TDMA and CONET Protocol
- Asynchronous FPGA Cell?s Design with Autonomous Power Gating and LEDR Encoding
- Treatment of the Heart Attack by Replacing Bypass Surgery with the Nanorobots
- Dimensional Reduction Using Fisher Linear Discriminant Based on Markov Sampling
Last modified: 2015-01-12 21:09:09