About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Computer Networks and ISDN Systems
Paper
Construction of optimal communication structures for weighted distributed match-making
Abstract
Several distributed issues such as name service and replicated data management need a communication structure with an intersection property. This paper discusses the efficiency of communication structures for cases in which the issues are weighted. We first provide a lower bound of communication complexity, using a distribution vector, and then give a method for constructing an efficient and symmetric communication structure. Our method achieves the lower bound 2 √abn in the symmetric case, where √an/b and √bn/a are integers, a and b are weights, and n is the number of nodes. © 1993.