@inproceedings{98ea0245578947738b0bed5d52fdccc1,

title = "Quorum placement in networks: Minimizing network congestion",

abstract = "A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements of the universe reside on the nodes of a physical network and the participating nodes access the system by contacting every element in some quorum, potentially causing the added network congestion induced by these quorum accesses to play a limiting factor in the performance of the algorithm. In this paper we initiate the study of algorithms to place universe elements on the nodes of a physical network so as to minimize the network congestion that results from quorum accesses, while also ensuring that no physical node is overloaded by access requests from clients. We consider two models, one in which communication routes can be chosen arbitrarily and one in which they are fixed in advance. We show that in either model, the optimal congestion (with respect to the load constraints) cannot be approximated to any factor (unless P=NP). However, we show that at most doubling the load on nodes allows us to achieve a congestion that is close to this optimal value. We also shed some light on the extent to which element migration can reduce congestion in this context.",

keywords = "Approximation algorithms, Congestion Problems, LP Rounding, Quorum Systems",

author = "Daniel Golovin and Anupam Gupta and Maggs, {Bruce M.} and Florian Oprea and Reiter, {Michael K.}",

year = "2006",

language = "English (US)",

isbn = "1595933840",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

pages = "16--25",

booktitle = "Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing 2006",

note = "25th Annual ACM Symposium on Principles of Distributed Computing 2006 ; Conference date: 23-07-2006 Through 26-07-2006",

}