Word-processing-based routing for cayley graphs
- Autores: Daniela Aguirre Guerrero
- Directores de la Tesis: Pere Vilà Talleda (dir. tes.), Lluís Fàbrega i Soler (codir. tes.)
- Lectura: En la Universitat de Girona ( España ) en 2019
- Idioma: español
- Tribunal Calificador de la Tesis: Ricardo Marcelín Jiménez (presid.), José F. Marco (secret.), Robert E. Kooij (voc.)
- Programa de doctorado: Programa de Doctorado en Tecnología por la Universidad de Girona
- Materias:
- Enlaces
- Tesis en acceso abierto en: TDX
- Resumen
This Thesis focuses on the problem of generic routing in Cayley Graphs(CGs). These graphs are a geometric representation of algebraic groups and have been used as topologies of a wide variety of communication networks.
The problem is analyzed from the Automatic Group Theory (AGT), which states that the structure of CGs can be encoded in a set of automatons. From these approach, word-processing techniques are used to design a generic routing scheme that has low complexity; guarantees packet delivery; and provides minimal routing, path diversity and fault-tolerance. These scheme is supported on a set low complexity algorithms for path computation in CGs.
The contributions of this Thesis also include an analysis of the topological properties of CGs and their impact on the performance and robustness of networks that use them as topology.
