The studies on the relationship between label consistency, computabilityand complexity assume the existence of {\em local orientation};this assumption is in fact at the basis of the {\em point-to-point} model and is realistic for systems where a communication link can connect only two entities.

However, in systems which use more advanced communication and interconnection technology such as {\em buses}, {\em optical} networks, {\em wireless} communication media, etc., and more importantly, heterogeneous systems (such as {\em internet}) which include any combination of the above, local orientation can {\em not} be assumed.

In this paper we consider a new type of consistency which we shall call {\em backward consistency} and which, unlike sense of direction, can exist evenwithout local orientation. Thus, unlike all previous forms of consistency, it can be found (or designed) in advanced distributed systems. We study backward consistency both in terms of its relationship with the traditional properties of local orientation and (weak) sense of direction,and with respect to symmetries of the edge labelings and of the naming functions.We prove that backward consistency is computationally equivalent to sense of direction; in other words, it is possible to take advantage of the computational power of sense of direction even in absence of local orientation.