Traffic Analysis in Random Delaunay Tessellations and Other Graphs
Differential Geometry
2012-03-23 v1 Computational Geometry
Networking and Internet Architecture
Combinatorics
Abstract
In this work we study the degree distribution, the maximum vertex and edge flow in non-uniform random Delaunay triangulations when geodesic routing is used. We also investigate the vertex and edge flow in Erd\"os-Renyi random graphs, geometric random graphs, expanders and random -regular graphs. Moreover we show that adding a random matching to the original graph can considerably reduced the maximum vertex flow.
Cite
@article{arxiv.1203.4863,
title = {Traffic Analysis in Random Delaunay Tessellations and Other Graphs},
author = {John D. Hobby and Gabriel H. Tucci},
journal= {arXiv preprint arXiv:1203.4863},
year = {2012}
}
Comments
Submitted to the Journal of Discrete Computational Geometry