Case study of a gearbox-like routing algorithm selection in runtime

Abstract

Routing protocols for the Future Internet need to adapt for any given status of the network. However the legacy routing algorithms (e.g. Dijkstra) could not seize the congestion determined by any other event except link failure and/or Layer 2 technology changes. Instead of a sophisticated mechanism we select the most competitive path determination solution to be used by a generic link-state based routing protocol, operating similar to a gearbox system. We suppose the Service Providers work with the Modified Dijkstra's algorithm for a single path routing. Whenever a multi-path delivery is needed, the Ford-Fulkerson scheme might be considered. For Infrastructure Providers the mechanism is similar, except the single path approach, involving this time the Floyd-Warshall algorithm. This paper does not cover the routing protocol implementation, being rather a case study. The major achievement of this proposal refers to a more efficient use of resources (i.e. Available Transfer Rate). The feasibility of this idea was demonstrated with per algorithm OMNET++ simulations on eight-node topology. The scalability is limited to an autonomous system and inter-domain routing solution is for further work.