A novel hotspot location algorithm for P2P streaming distribution networking

Todaypsilas P2P media streaming application periodically suffers from routing hotspots, a.k.a., flash crowds. A routing hotspot is typically created by an unanticipated new event that triggers an unanticipated surge of users that request streaming service from some particular peers, temporarily overwhelming the peerpsilas delivery capabilities. In this paper, we consider how to discover the routing hotspot location. First, we propose a graph-based system model, which takes into account the dependencies among multiple different peers and is suitable for hotspot localization in large-scale real-time P2P networks. Second, based on this model, we design a heuristic algorithm for finding a near-optimal solution to hotspot location. The analysis shows that our algorithm is a near-optimal solution from two aspects: computational complexity and the accuracy of hotspot location. Finally, extensive simulations are conducted to verify that our algorithm can locate routing hotspots quickly and efficiently.