17. Resilient Recursive Routing in Communication Networks

  1. Amiya Nayak B.Math., Ph.D. Adjunct Research Professor Associate Editor Full Professor3 and
  2. Ivan Stojmenović Ph.D. Chair Professor founder editor-in-chief3,4
  1. Costas C. Constantinou1,
  2. Alexander S. Stepanenko2,
  3. Theodoros N. Arvanitis2,
  4. Kevin J. Baughan2 and
  5. Bin Liu2

Published Online: 1 MAR 2007

DOI: 10.1002/9780470175668.ch17

Handbook of Applied Algorithms: Solving Scientific, Engineering and Practical Problems

Handbook of Applied Algorithms: Solving Scientific, Engineering and Practical Problems

How to Cite

Constantinou, C. C., Stepanenko, A. S., Arvanitis, T. N., Baughan, K. J. and Liu, B. (2007) Resilient Recursive Routing in Communication Networks, in Handbook of Applied Algorithms: Solving Scientific, Engineering and Practical Problems (eds A. Nayak and I. Stojmenović), John Wiley & Sons, Inc., Hoboken, NJ, USA. doi: 10.1002/9780470175668.ch17

Editor Information

  1. 3

    SITE, University of Ottawa, 800 King Edward Ave., Ottawa, ON K1N 6N5, Canada

  2. 4

    EECE, University of Birmingham, UK

Author Information

  1. 1

    Electronics, Electrical, and Computer Engineering, University of Birmingham, and Prolego Technologies Ltd., Edgbaston, Birmingham B15 2TT, UK

  2. 2

    Electronics, Electrical, and Computer Engineering, University of Birmingham, Edgbaston, Birmingham B15 2TT, UK

Publication History

  1. Published Online: 1 MAR 2007
  2. Published Print: 14 FEB 2008

ISBN Information

Print ISBN: 9780470044926

Online ISBN: 9780470175668

SEARCH

Keywords:

  • communication networks - resilient recursive routing;
  • logical network abridgement procedure;
  • routing protocol and LNA-based novel class protocol

Summary

After a brief review of conventional approaches to shortest path routing an alternative algorithm that abstracts a network graph into a logical tree is introduced. The algorithm is based on the decomposition of a graph into its minimum cycle basis (a basis of the cycle vector space of a graph having least overall weight or length). A procedure that abstracts the cycles and their adjacencies into logical nodes and links correspondingly is introduced. These logical nodes and links form the next level logical graph. The procedure is repeated recursively, until a loop-free logical graph is derived. This iterative abstraction is called a logical network abstraction procedure and can be used to analyze network graphs for resiliency, as well as become the basis of a new routing methodology. Both these aspects of the logical network abstraction procedure are discussed in some detail.