Factor graph approach to distributed facility location in large-scale networks
ISIT（2009）
摘要
In this paper, we present a new approach to solving the distributed facility location problem using the recent modeling and computational methodology of factor graph and message-passing. We first formulate the problem as finding a valid network configuration that minimizes the overall cost. We then represent the problem using a factor graph, and derive simplified, localized, broadcast-based message-passing rules which can elect a near-optimal set of facility nodes in a few iterations. Simulation results for small-world network topologies show that the algorithm is able to achieve good convergence rate and approximation ratio, and scalable to the network size.
更多查看译文
关键词
large-scale network,small-world network topology,facility location problem,approximation ratio,facility node,network size,factor graph approach,factor graph,broadcast-based message-passing rule,good convergence rate,computational methodology,valid network configuration,protocols,network topologies,small world network,computational modeling,graph theory,approximation algorithms,facility location,servers,message passing,convergence,convergence rate,data mining,wireless sensor networks
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要