TECHNIQUES FOR SELECTING SPANNING TREE AMONG CANDIDATE LINKS WITHIN AN AD HOC NETWORK

摘要

Techniques are disclosed for developing spanning trees at devices that are interconnected in a rendering network. According to the techniques, a change in connectivity between two devices in the rendering network may be detected at a first one of the devices, information representing a cost of connectivity may be stored in a data record at the first device. A spanning tree may then be calculated from a candidate set of communication links that interconnect the devices of the rendering network according to cost information representing those communication links. A device may exchange information, such as information regarding the rendering network, to another device of the rendering network according to communication links identified for the spanning tree. The data record may be of a conflict-free replicated data type.