Factor graph approach to distributed facility location in large-scale networks

Authors:
Hung Q. Ngo;Sungyoung Lee;Young-Koo Lee
Affiliations:
Department of Computer Engineering, Kyung Hee University, South Korea;Department of Computer Engineering, Kyung Hee University, South Korea;Department of Computer Engineering, Kyung Hee University, South Korea
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Year:
2009

Citing 4
Cited 0

Planet scale software updates

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
The generalized distributive law

IEEE Transactions on Information Theory
Factor graphs and the sum-product algorithm

IEEE Transactions on Information Theory
Node clustering in wireless sensor networks: recent developments and deployment challenges

IEEE Network: The Magazine of Global Internetworking

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.