Network Orientation

GERARD TEL
1994 International Journal of Foundations of Computer Science  
This paper analyses how the symmetry of a processor network in uences 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
more » ... sors 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.
doi:10.1142/s0129054194000037 fatcat:h2syqucx6nfbpl43d64rewt6um