Skip to Main Content
The main idea in CSCW is that an application involves multiperson work as a group. They may lie in different sites which are connected via a network. When the application demands real-time cooperation, an underlying scheme should perform the necessary synchronization to ensure application semantics. We present a distributed algorithm which generates a share tree covering all group members. Each member only knows its local routing information. By the exchange of messages between members, the spanning tree is established cooperatively. When the transmit delay is not the crucial metric for the application and each member has an equal probability of sending data, the resulting overlay generated by our method is optimal.
Computer Supported Cooperative Work in Design, 2004. Proceedings. The 8th International Conference on (Volume:1 )
Date of Conference: 26-28 May 2004