Fault-tolerant routing on Borel Cayley graph
Autor: | K. Wendy Tang, Eric Noel, Junghun Ryu |
---|---|
Rok vydání: | 2012 |
Předmět: | |
Zdroj: | ICC |
DOI: | 10.1109/icc.2012.6364037 |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |
načítá se...