Definition

Hyperbolic Traffic Load Centrality used for ranking nodes with respect to their importance in the routing operation. $HTLC$ is based on network embedding in hyperbolic space, while assuming paths paved by greedy routing over hyperbolic coordinates, which requires less computational cost than shortest path routing. Greedy routing in hyperbolic space also yields paths with lengths very close to the shortest ones for the social networks of interest bearing the scale free property.

References

• Stai E., Sotiropoulos K., Karyotis V., Papavassiliou S., 2016. Hyperbolic Traffic Load Centrality for large-scale complex communications networks. 2016 23rd International Conference on Telecommunications, ICT 2016, . DOI: 10.1109/ICT.2016.7500371