Cloud computing and hyperbolic Voronoi diagrams on the sphere

TL;DR

This paper addresses optimizing cloud computing networks on the sphere by using hyperbolic Voronoi diagrams, providing a mathematical solution and simulation results.

Contribution

It introduces a novel application of hyperbolic Voronoi diagrams on the sphere to solve total distance minimization in cloud networks.

Findings

Hyperbolic Voronoi diagrams effectively model network optimization.

Simulation results validate the proposed solution.

The method improves efficiency in spherical cloud network layouts.

Abstract

In this work we study the minimization problem for the total distance in a cloud computing network on the sphere. We give a solution to this problem in terms of hyperbolic Voronoi diagrams on the sphere. We present results of computer simulations illustrating the solution.