Self-Interested Routing in Online Environments

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., Detour or RON). Such approaches result in Self-interested routing, because routing decisions are no longer based on system-wide criteria but are instead designed to optimize host-based or overlay-based metrics. A series of theoretical results showing that Self-interested 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 Self-interested routing in online 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.













SYSTEM REQUIREMENTS

HARDWARE REQUIREMENTS

Processor : Intel Pentium IV
Clock Speed : 700 MHZ
RAM : 128 MB
Monitor : 14 SVGA Digital Color Monitor
Keyboard : 107 Keys Keyboard
Floppy Drive : 1.44MB
Compact Disk Drive : 700MB
Hard Disk : 20GB
Printer : Canon BJC 2100 SP
Mouse : Logitech Mouse


SOFTWARE REQUIREMENTS

Operating System : Windows 98,2000,xp
Tools : jdk1.5.0