Novel topological framework for adaptive routing

Alexander Stepanenko*, Costas Constantinou

*Corresponding author for this work

Research output: Chapter in Book/Published conference outputConference publication


We identify that a major contributing factor to the shortcomings of current routing protocols is their mathematical treatment of graphs used to represent networks. Typically, routing protocols decimate the rich connectivity present in a network into a small number of distinct trees for every source, which are then translated into routing table entries. We propose a new routing paradigm that introduces a novel concept of neighbourhood, embodying path diversity. This framework summarises rather than decimates paths throughout the network, preserving and exploiting all of the network's potentially rich intrinsic path diversity. Central to our abstraction are two intimately connected and complementary path diversity units: simple cycles, and cycle adjacencies. A recursive network abstraction procedure is presented, together with an associated generic recursive routing protocol family that offers many desirable features. A simple instance of such a protocol is compared against existing wired and wireless routing protocols through simulations for a highlystressed network with unstable links, illustrating the potential advantages of the proposed approach.

Original languageEnglish
Title of host publicationGLOBECOM 2009- IEEE Global Telecommunications Conference
ISBN (Print)9781424441488
Publication statusPublished - 1 Dec 2009
Event2009 IEEE Global Telecommunications Conference, GLOBECOM 2009 - Honolulu, HI, United Kingdom
Duration: 30 Nov 20094 Dec 2009


Conference2009 IEEE Global Telecommunications Conference, GLOBECOM 2009
Country/TerritoryUnited Kingdom
CityHonolulu, HI


Dive into the research topics of 'Novel topological framework for adaptive routing'. Together they form a unique fingerprint.

Cite this