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

Miguel Hernando Camelo Botero

• 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