Skip to Main Content
The current Internet infrastructure is facing a number of limitations that is not suitable to meet the growing number of services and users. In particular, one aspect that requires enhancement is routing, where original routing concepts were designed for static traffic patterns with minimal variations and supporting mainly low throughput traffic (e.g. Data). As the number of users as well as services supporting the user grows, the current routing mechanisms will not be feasible. In this paper we present a gradient based distributed routing technique that is based on discovering routes through a gradient field created in the topology. The gradient calculation is based on weighted sum of a number of components, which modifies the gradient field as the network load changes. Simulation results have also been presented to validate the proposed routing algorithm.
Date of Conference: 26-29 May 2009