Symmetry Breaking in the Congest Model: Time- and Message-Efficient Algorithms for Ruling Sets
international symposium on distributed computing(2017)
摘要
We study local symmetry breaking problems in the CONGEST model, focusing on ruling set problems, which generalize the fundamental Maximal Independent Set (MIS) problem. A β-ruling set is an independent set such that every node in the graph is at most β hops from a node in the independent set. Our work is motivated by the following central question: can we break the Θ(log n) time complexity barrier and the Θ(m) message complexity barrier in the CONGEST model for MIS or closely-related symmetry breaking problems? We present the following results: - Time Complexity: We show that we can break the O(log n) "barrier" for 2- and 3-ruling sets. We compute 3-ruling sets in O(log n/loglog n) rounds with high probability (whp). More generally we show that 2-ruling sets can be computed in O(logΔ· (log n)^1/2 + ε + log n/loglog n) rounds for any ε > 0, which is o(log n) for a wide range of Δ values (e.g., Δ = 2^(log n)^1/2-ε). These are the first 2- and 3-ruling set algorithms to improve over the O(log n)-round complexity of Luby's algorithm in the CONGEST model. - Message Complexity: We show an Ω(n^2) lower bound on the message complexity of computing an MIS (i.e., 1-ruling set) which holds also for randomized algorithms and present a contrast to this by showing a randomized algorithm for 2-ruling sets that, whp, uses only O(n log^2 n) messages and runs in O(Δlog n) rounds. This is the first message-efficient algorithm known for ruling sets, which has message complexity nearly linear in n (which is optimal up to a polylogarithmic factor).
更多查看译文
关键词
Congest model, Local model, Maximal independent set, Message complexity, Round complexity, Ruling sets, Symmetry breaking
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要