Fault-tolerant routing on Borel Cayley graph

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.

[1]  Jon Crowcroft,et al.  A survey and comparison of peer-to-peer overlay network schemes , 2005, IEEE Communications Surveys & Tutorials.

[2]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[3]  Kumar N. Sivarajan,et al.  Lightwave networks based on de Bruijn graphs , 1994, TNET.

[4]  Tobias Bjerregaard,et al.  A survey of research and practices of Network-on-chip , 2006, CSUR.

[5]  K. Wendy Tang,et al.  A graph theoretic approach to ultrafast information distribution: Borel Cayley graph resizing algorithm , 2010, Comput. Commun..

[6]  K. Wendy Tang,et al.  Novel Sensor MAC Protocol Applied to Cayley and Manhattan Street Networks with CrossBow MICA2 , 2006, 2006 3rd Annual IEEE Communications Society on Sensor and Ad Hoc Communications and Networks.

[7]  Wolfgang Nejdl,et al.  Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs , 2004, ISPA.

[8]  K. Wendy Tang,et al.  Vertex-transitivity and routing for Cayley graphs in GCR representations , 1992, SAC '92.

[9]  S. Lakshmivarahan,et al.  Symmetry in Interconnection Networks Based on Cayley Graphs of Permutation Groups: A Survey , 1993, Parallel Comput..

[10]  Eytan Modiano,et al.  Capacity provisioning and failure recovery for Low Earth Orbit satellite constellation , 2003, Int. J. Satell. Commun. Netw..

[11]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

[12]  M. Vetterli,et al.  Lattice networks: capacity limits, optimal routing, and queueing behavior , 2006, IEEE/ACM Transactions on Networking.

[13]  Dhiraj K. Pradhan,et al.  Fault diagnosis in multi layered De Bruijn based architectures for sensor networks , 2010, 2010 8th IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops).

[14]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[15]  Dmitri Loguinov,et al.  Graph-theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience , 2003, IEEE/ACM Transactions on Networking.

[16]  K. Wendy Tang,et al.  Representations of Borel Cayley Graphs , 1993, SIAM J. Discret. Math..