Novel topological framework for adaptive routing

Alexander Stepanenko*, Costas Constantinou

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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
PublisherIEEE
ISBN (Print)9781424441488
DOIs
Publication statusPublished - 1 Dec 2009
Event2009 IEEE Global Telecommunications Conference, GLOBECOM 2009 - Honolulu, HI, United Kingdom
Duration: 30 Nov 20094 Dec 2009

Conference

Conference2009 IEEE Global Telecommunications Conference, GLOBECOM 2009
CountryUnited Kingdom
CityHonolulu, HI
Period30/11/094/12/09

Fingerprint

Routing protocols
Network protocols

Cite this

Stepanenko, A., & Constantinou, C. (2009). Novel topological framework for adaptive routing. In GLOBECOM 2009- IEEE Global Telecommunications Conference [5425313] IEEE. https://doi.org/10.1109/GLOCOM.2009.5425313
Stepanenko, Alexander ; Constantinou, Costas. / Novel topological framework for adaptive routing. GLOBECOM 2009- IEEE Global Telecommunications Conference. IEEE, 2009.
@inproceedings{d8af642ef58044aabef1d6dea73ff407,
title = "Novel topological framework for adaptive routing",
abstract = "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.",
author = "Alexander Stepanenko and Costas Constantinou",
year = "2009",
month = "12",
day = "1",
doi = "10.1109/GLOCOM.2009.5425313",
language = "English",
isbn = "9781424441488",
booktitle = "GLOBECOM 2009- IEEE Global Telecommunications Conference",
publisher = "IEEE",
address = "United States",

}

Stepanenko, A & Constantinou, C 2009, Novel topological framework for adaptive routing. in GLOBECOM 2009- IEEE Global Telecommunications Conference., 5425313, IEEE, 2009 IEEE Global Telecommunications Conference, GLOBECOM 2009, Honolulu, HI, United Kingdom, 30/11/09. https://doi.org/10.1109/GLOCOM.2009.5425313

Novel topological framework for adaptive routing. / Stepanenko, Alexander; Constantinou, Costas.

GLOBECOM 2009- IEEE Global Telecommunications Conference. IEEE, 2009. 5425313.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Novel topological framework for adaptive routing

AU - Stepanenko, Alexander

AU - Constantinou, Costas

PY - 2009/12/1

Y1 - 2009/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=77951557218&partnerID=8YFLogxK

UR - https://ieeexplore.ieee.org/document/5425313/

U2 - 10.1109/GLOCOM.2009.5425313

DO - 10.1109/GLOCOM.2009.5425313

M3 - Conference contribution

AN - SCOPUS:77951557218

SN - 9781424441488

BT - GLOBECOM 2009- IEEE Global Telecommunications Conference

PB - IEEE

ER -

Stepanenko A, Constantinou C. Novel topological framework for adaptive routing. In GLOBECOM 2009- IEEE Global Telecommunications Conference. IEEE. 2009. 5425313 https://doi.org/10.1109/GLOCOM.2009.5425313