A geometric routing scheme in word-metric spaces for data networks
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-Met...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Doctoral Thesis |
| Language: | English |
| Published: |
Universitat de Girona
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10803/283749 |