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

Low time complexity algorithms for path computation in Cayley Graphs

“…The algorithms proposed in this paper extend the work of [1]. In contrast to the algorithms presented in [12,14,16], our algorithms are topology-agnostic and have no constraints on the size of the computed paths. In addition, we present an algorithm for computing the shortest path avoiding a set of nodes and edges, which is useful in the design of fault-tolerant routing schemes.…”

“…A routing algorithm for Boreal CG, which is fault-tolerant but is not shortest path and does not ensure packet delivery is proposed in [14]. A shortest path algorithm for pancake graphs is presented in [16].…”

“…However, routing schemes with low space and time complexity can be designed taking advantage of the vertex-transitive property of CG [9]. Recent proposals in this direction include algorithms for path computation in specific families of CG [12,14]. To the best of our knowledge, there is no topology-agnostic algorithms for path computation in CG.…”