Parameterised Gradient Based Routing (PGBR) for Future Internet

Abstract

Abstract-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.

Neighbor Gradient-based Multicast Routing for Service-Oriented Applications

“…) is a special tree, which is rooted at s and reaches each destination dD  . Different from the gradient definitions proposed in [21] and [22] for unicast routing, we consider the ability of sharing path, residual link capacity and normalized hop count simultaneously when constructing the multicast tree. That is because there are critical factors for the high quality of multicast routing in most of the service-oriented applications.…”

Gradient Based Routing Support for Cooperative Multi-channel MAC in Ad Hoc Wireless Networks

“…Therefore, using the node ability values, the route discovery follos a gradient path to the destination. The gradient function is adopted and modified from our previous solution in [13], and is represented as,…”