FRANK: A Fast Node Ranking Approach in Large-Scale Networks
To support the ever-increasing data traffic demands, the Internet has been experiencing a rapid growth in recent decades. Effective and efficient monitoring is highly needed in order to properly manage such complex infrastructure. It is of theoretical and practical significance to derive network device importance (i.e., node rank) for resource utilization optimization, user experience improvement, and security enhancement. Recent development in the Internet infrastructure has introduced prosperous in-network computation resources across the network. To exploit such distributed resources, in this article, we propose a core-graphbased framework, called FRank, for fast node ranking algorithms, which accelerates convergence and reduces communication cost by converting most inter-partition state change propagations into intra-partition ones. We have implemented FRank in a cluster to validate its correctness and efficiency. The experiment results demonstrate that at the least FRank reduces the execution time of existing cutting-edge methods by 30.2 percent with 43.5 percent less communication cost.
원문복사신청을 하시면, 일부 해외 인쇄학술지의 경우 외국학술지지원센터(FRIC)에서
무료 원문복사 서비스를 제공합니다.
NDSL에서는 해당 원문을 복사서비스하고 있습니다. 위의 원문복사신청 또는 장바구니 담기를 통하여 원문복사서비스 이용이 가능합니다.
- 이 논문과 함께 출판된 논문 + 더보기