The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - February (2012 vol.23)
pp: 255-262
Seiichiro Tani , NTT Corporation, Atsugi and Japan Science and Technology Agency, Tokyo
ABSTRACT
View is a labeled directed graph containing all information about the network that a party can learn by exchanging messages with its neighbors. View can be used to solve distributed problems on an anonymous network (i.e., a network that does not guarantee that every party has a unique identifier). This paper presents an algorithm that constructs views in a compressed form on an anonymous n-party network of any topology in at most 2n rounds with O(n^6\log n) bit complexity, where the time complexity (i.e., the number of local computation steps per party) is O(n^6\log n). This is the first view-construction algorithm that runs in O(n) rounds with polynomial bits complexity. The paper also gives an algorithm that counts the number of nonisomorphic views in the network in O(n^6\log n) time complexity if a view is given in the compressed form. These algorithms imply that some well-studied problems, including the leader election problem, can deterministically be solved in O(n) rounds with polynomial bit and time complexity on an anonymous n-party network of any topology.
INDEX TERMS
Analysis of algorithms and problem complexity, distributed networks.
CITATION
Seiichiro Tani, "Compression of View on Anonymous Networks—Folded View—", IEEE Transactions on Parallel & Distributed Systems, vol.23, no. 2, pp. 255-262, February 2012, doi:10.1109/TPDS.2011.142
REFERENCES
[1] M. Yamashita and T. Kameda, "Computing on an Anonymous Network," Proc. Seventh Ann. ACM Symp. Principles of Distributed Computing (PODC '88), pp. 117-130, 1988.
[2] M. Yamashita and T. Kameda, "Computing on Anonymous Networks: Part I—Characterizing the Solvable Cases," IEEE Trans. Parallel Distributed Systems, vol. 7, no. 1, pp. 69-89, Jan. 1996.
[3] M. Yamashita and T. Kameda, "Computing on Anonymous Networks: Part II—Decision and Membership Problems," IEEE Trans. Parallel Distributed Systems, vol. 7, no. 1, pp. 90-96, Jan. 1996.
[4] D. Angluin, "Local and Global Properties in Networks of Processors (Extended Abstract)," Proc. 12th Ann. ACM Symp. Theory of Computing (STOC '80), pp. 82-93, 1980.
[5] E. Kranakis, D. Krizanc, and J. van den Berg, "Computing Boolean Functions on Anonymous Networks," Information and Computation, vol. 114, no. 2, pp. 214-236, 1994.
[6] N. Norris, "Universal Covers of Graphs: Isomoriphism to Depth n-1 Implies Isomoriphism to All Depths," Discrete Applied Math., vol. 56, no. 1, pp. 61-74, 1995.
[7] P. Boldi, S. Shammah, S. Vigna, B. Codenotti, P. Gemmell, and J. Simon, "Symmetry Breaking in Anonymous Networks: Characterizations," Proc. Fourth Israel Symp. Theory of Computing and Systems (ISTCS), pp. 16-26, 1996.
[8] P. Boldi and S. Vigna, "Fibrations of Graphs," Discrete Math., vol. 243, pp. 21-66, 2002.
[9] Y. Afek and Y. Matias, "Elections in Anonymous Networks," Information and Computation, vol. 113, no. 2, pp. 312-330, 1994.
[10] M. Yamashita and T. Kameda, "Leader Election Problem on Networks in which Processor Identity Numbers are not Distinct," IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 9, pp. 878-887, Sept. 1999.
[11] S. Das, P. Flocchini, A. Nayak, and N. Santoro, "Effective Elections for Anonymous Mobile Agents," Proc. 17th Int'l Symp. Algorithms and Computation (ISAAC '06), pp. 732-743, 2006.
[12] Y.M. Jérémie Chalopin, "An Efficient Message Passing Election Algorithm Based on Mazurkiewicz's Algorithm," Fundamenta Informaticae, vol. 80, pp. 221-246, 2007.
[13] S. Tani, H. Kobayashi, and K. Matsumoto, "Exact Quantum Algorithms for the Leader Election Problem," Proc. 22nd Symp. Theoretical Aspects of Computer Science, pp. 581-592, 2005.
[14] H. Kobayashi, K. Matsumoto, and S. Tani, "Brief Announcement: Exactly Electing a Unique Leader is not Harder than Computing Symmetric Functions on Anonymous Quantum Networks," Proc. 28th Ann. ACM Symp. Principles of Distributed Computing (PODC '09), pp. 334-335, 2009.
[15] K.R. Abrahamson, A. Adler, L. Higham, and D.G. Kirkpatrick, "Tight Lower Bounds for Probabilistic Solitude Verification on Anonymous Rings," vol. 41, no. 2, pp. 277-310, 1994.
[16] E. Kranakis and D. Krizanc, "Distributed Computing on Anonymous Hypercube Networks," J. Algorithms, vol. 23, no. 1, pp. 32-50, 1997.
[17] P. Boldi and S. Vigna, "Computing Anonymously with Arbitrary Knowledge," Proc. 18th Ann. ACM Symp. Principles of Distributed Computing, pp. 181-188, 1999.
[18] N.A. Lynch, Distributed Algorithms. Morgan Kaufman Publishers, 1996.
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool