Traffic Analysis in Random Delaunay Tessellations and Other Graphs

Details Traffic Analysis in Random Delaunay Tessellations and Other Graphs Traffic Analysis in Random Delaunay Tessellations and Other Graphs

2012-03-22

arxiv.org/abs/1203.4863v1

Mathematics

Differential Geometry

Submitted to the Journal of Discrete Computational Geometry

Scientific paper

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 $k$-regular graphs. Moreover we show that adding a random matching to the original graph can considerably reduced the maximum vertex flow.

Affiliated with

Also associated with

No associations

Rating

Traffic Analysis in Random Delaunay Tessellations and Other Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Traffic Analysis in Random Delaunay Tessellations and Other Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Traffic Analysis in Random Delaunay Tessellations and Other Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-381191