Computer Science – Information Theory
Scientific paper
2010-10-26
Computer Science
Information Theory
Scientific paper
In this report, we study the multiparty communication complexity problem of the multiparty equality function (MEQ): EQ(x_1,...,x_n) = 1 if x_1=...=x_n, and 0 otherwise. The input vector (x_1,...,x_n) is distributed among n>=2 nodes, with x_i known to node i, where x_i is chosen from the set {1,...,M}, for some integer M>0. Instead of the "number on the forehand" model, we consider a point-to-point communication model (similar to the message passing model), which we believe is more realistic in networking settings. We assume a synchronous fully connected network of n nodes, the node IDs (identifiers) are common knowledge. We assume that all point-to-point communication channels/links are private such that when a node transmits, only the designated recipient can receive the message. The identity of the sender is known to the recipient. We demonstrate that traditional techniques generalized from two-party communication complexity problem are not sufficient to obtain tight bounds under the point-to-point communication model. We then introduce techniques which significantly reduce the space of protocols to study. These techniques are used to study some instances of the MEQ problem.
Liang Guanfeng
Vaidya Nitin
No associations
LandOfFree
Multiparty Equality Function Computation in Networks with Point-to-Point Links does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Multiparty Equality Function Computation in Networks with Point-to-Point Links, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Multiparty Equality Function Computation in Networks with Point-to-Point Links will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-160187