nam a 5i 4500
Geometric routing
Enrutamiento geométrico
Enrutament geomètric
Greedy embedding
Incrustación greedy
Incrustació greedy
Compact routing
Enrutamiento compacto
Enrutament compacte
Group theory
Teoría de grupos
Teoria de grups
Word-metric spaces
Espacio métrico de palabras
Espai mètric de paraules
A geometric routing scheme in word-metric spaces for data networks
[Girona]:
Universitat de Girona,
2014
Accés lliure
http://hdl.handle.net/10803/283749
cr |||||||||||
AAMMDDs2014 sp ||||fsm||||0|| 0 eng|c
Camelo Botero, Miguel Hernando,
autor
1 recurs en línia (92 pàgines)
Tesi
Doctorat
Universitat de Girona. Departament d'Arquitectura i Tecnologia de Computadors
2014
Universitat de Girona. Departament d'Arquitectura i Tecnologia de Computadors
Tesis i dissertacions electròniques
Fàbrega i Soler, Lluís,
supervisor acadèmic
Vilà Talleda, Pere,
supervisor acadèmic
TDX
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
g
ES-BaCBU
cat
rda
ES-BaCBU
text
txt
rdacontent
informàtic
c
rdamedia
recurs en línia
cr
rdacarrier