Fault-tolerant routing on Borel Cayley graph | IEEE Conference Publication | IEEE Xplore

Fault-tolerant routing on Borel Cayley graph


Abstract:

In this paper, we explore the use of a pseudo-random graph family, Borel Cayley graph family, as the network topology in an NGN (Next Generation Network) with thousands o...Show More

Abstract:

In this paper, we explore the use of a pseudo-random graph family, Borel Cayley graph family, as the network topology in an NGN (Next Generation Network) with thousands of nodes operated in a packet switching environment asynchronously. BCGs are known to be an efficient topology in interconnection networks because of its small diameters, short average path lengths, and low-degree connections. However, the application of BCGs in NGN are 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 short average hop count.
Date of Conference: 10-15 June 2012
Date Added to IEEE Xplore: 29 November 2012
ISBN Information:

ISSN Information:

Conference Location: Ottawa, ON, Canada

References

References is not available for this document.