Network Orientation

This paper analyses how the symmetry of a processor network innuences the existence of a solution for the network orientation problem. The orientation of cliques, hypercubes and tori is the problem of assigning labels to each link of each processor, in such a way that a sense of direction is given to the network. In this paper the problem of network orientation for these two topologies is studied under the assumption that the network contains a single leader, under the assumption that the processors possess unique identities, and under the assumption that the network is anonymous. The distinction between these three models is considered fundamental in distributed computing. It is shown that orientations can be computed by deterministic algorithms only when either a leader or unique identities are available. Orientations can be computed for anonymous networks by randomized algorithms, but only when the number of processors is known. When the number of processors is not known, even randomized algorithms cannot compute orientations for anonymous processor networks. Lower bounds on the message complexity of orientation and algorithms achieving these bounds are given.

[1]  Baruch Awerbuch,et al.  Complexity of network synchronization , 1985, JACM.

[2]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[3]  Charles J. Colbourn,et al.  Wang Tilings and Distributed Orientation on Anonymous Torus Networks (Extended Abstract) , 1993, WDAG.

[4]  Evangelos Kranakis,et al.  Distributed computing on anonymous hypercube networks , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[5]  Doron Rotem,et al.  Lower Bounds for Distributed Maximum-Finding Algorithms , 1984, JACM.

[6]  Mohamed Naimi.  Parallel assignment to distinct identities in arbitrary networks , 1995, Proceedings of Fourth International Conference on Computer Communications and Networks - IC3N'95.

[7]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[8]  Hans L. Bodlaender,et al.  Distributed Computing on TRansitive Networks: The Thorus , 1989, STACS.

[9]  Douglas B. West,et al.  Election in a Complete Network with a Sense of Direction , 1986, Inf. Process. Lett..

[10]  Amos Israeli,et al.  Uniform Self-Stabilizing Ring Orientation , 1993, Inf. Comput..

[11]  Shlomo Moran,et al.  Extended Impossibility Results for Asynchronous Complete Networks , 1987, Inf. Process. Lett..

[12]  Gerard Tel,et al.  Bit-Optimal Election in Synchronous Rings , 1990, Inf. Process. Lett..

[13]  Nicola Santoro.  Sense of direction, topological awareness and communication complexity , 1984, SIGA.

[14]  Paul M. B. Vitányi,et al.  Time-driven algorithms for distributed control , 1985 .

[15]  Shmuel Zaks,et al.  Tight lower and upper bounds for some distributed algorithms for a complete network of processors , 1984, PODC '84.

[16]  Yossi Matias,et al.  Simple and Efficient Election Algorithms for Anonymous Networks , 1989, WDAG.

[17]  Richard B. Tan,et al.  General symmetric distributed termination detection , 1986 .

[18]  Parameswaran Ramanathan,et al.  Fault-tolerant clock synchronization in distributed systems , 1990, Computer.

[19]  Gerard Tel,et al.  Optimal Synchronization of ABD Networks , 1988, Concurrency.

[20]  Pierre A. Humblet,et al.  A Distributed Algorithm for Minimum-Weight Spanning Trees , 1983, TOPL.

[21]  Evangelos Kranakis,et al.  Distributed computing on Cayley networks , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[22]  Alon Itai,et al.  Symmetry breaking in distributive networks , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[23]  Israel Cidon,et al.  Message Terminate Algorithms for Anonymous Rings of Unknown Size , 1992, WDAG.

[24]  Valmir Carneiro Barbosa,et al.  An introduction to distributed algorithms , 1996 .