A geometric routing scheme in word-metric spaces for data networks

• Autores: Miguel Hernando Camelo Botero
• Directores de la Tesis: Lluís Fàbrega i Soler (dir. tes.), Pere Vilà Talleda (dir. tes.)
• Lectura: En la Universitat de Girona ( España ) en 2014
• Idioma: inglés
• Tribunal Calificador de la Tesis: Yezyd Donoso Meisel (presid.), Josep Lluís Marzo i Lázaro (secret.), Davide Careglio (voc.)
• Enlaces
  • Tesis en acceso abierto en: TDX
• Resumen

  • This research work explores the use of the Greedy Geometric Routing (GGR) schemes to solve the scalability problem of the routing systems in Internet-like networks and several families of Data Center architectures. We propose a novel and simple embedding of any connected finite graph into a Word-Metric space, i.e., a metric space generated by algebraic groups. Then, built on top of this greedy embedding, we propose three GGR schemes and we prove the theoretical upper bounds of the Routing Table size, vertex label size and stretch. The first scheme works for any kind of graph and the other two are specialized for Internet-like and several families of DC topologies