About this Journal Submit a Manuscript Table of Contents
International Journal of Distributed Sensor Networks
Volume 2012 (2012), Article ID 124245, 15 pages
http://dx.doi.org/10.1155/2012/124245
Research Article

Distributed and Fault-Tolerant Routing for Borel Cayley Graphs

1Department of Electrical & Computer Engineering, Stony Brook University, SUNY, Stony Brook, NY 11794-2350, USA
2AT&T Labs, USA

Received 3 April 2012; Revised 25 July 2012; Accepted 8 August 2012

Academic Editor: Yanmin Zhu

Copyright © 2012 Junghun Ryu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

We explore the use of a pseudorandom graph family, Borel Cayley graph family, as the network topology with thousands of nodes operating in a packet switching environment. BCGs are known to be an efficient topology in interconnection networks because of their small diameters, short average path lengths, and low-degree connections. However, the application of BCGs is hindered by a lack of size flexibility and fault-tolerant routing. We propose a fault-tolerant routing algorithm for BCGs. Our algorithm exploits the vertex-transitivity property of Borel Cayley graphs and relies on extra information to reflect topology change. Our results show that the proposed method supports good reachability and a small End-to-End delay under various link failures scenarios.