We consider the problem of capacitated kinetic clustering in which $n$ mobile terminals and $k$ base stations with respective operating capacities are given. The task is to assign the mobile terminals to the base stations such that the total squared distance from each terminal to its assigned base station is minimized and the capacity constraints are satisfied. This paper focuses on the development of distributed and computationally efficient algorithms that adapt to the motion of both terminals and base stations.
C.-C. Ni, Z. Su, J. Gao, X.D. Gu
In INFOCOM 2016,
2016
Analysis of Internet topologies has shown that the Internet topology has negative curvature, measured by Gromov’s ``thin triangle condition”, which is tightly related to core congestion and route reliability. In this work we analyze the discrete Ricci curvature of the Internet, defined by Ollivier et al., Lin et al., etc. Ricci curvature measures whether local distances diverge or converge. It is a more local measure which allows us to understand the distribution of curvatures in the network.
C.-C. Ni, Y.-Y. Lin, J. Gao, X.D. Gu, E. Saucan
In INFOCOM 2015,
2015