TIPC Cluster Domain Sockets / Tasks / #76 Multicast name lookup algorithm is inefficient

Cluster wide IPC providing datagram, connection, and bus messaging

#76 Multicast name lookup algorithm is inefficient

Status: closed-fixed

Owner: Allan Stephens

Labels: Code (8)

Priority: 3

Updated: 2008-05-23

Created: 2008-05-23

Creator: Allan Stephens

Private: No

TIPC's algorithm for identifying on-node and off-node destinations that overlap a multicast name sequence range is not as efficient as it could be. Rather than traversing the list of all known name publications within the cluster, it should just traverse the (potentially
much shorter) list of name publications made by the node itself, and determine if any off-node destinations exist by comparing the sizes of the two lists. (Since the node list must be a subset of the cluster list, a difference in sizes means that at least one off-node destination must exist.)

Discussion

Allan Stephens - 2008-05-23

Patch for TIPC 1.7.5

0010-Optimization-to-multicast-name-lookup-algorithm.txt

If you would like to refer to this comment somewhere else in this project, copy and paste the following link:

Allan Stephens - 2008-05-23

status: open --> closed-fixed
If you would like to refer to this comment somewhere else in this project, copy and paste the following link:

Allan Stephens - 2008-05-23

Logged In: YES
user_id=995681
Originator: YES

A patch for TIPC 1.7.5 is now available that fixes this issue.
File Added: 0010-Optimization-to-multicast-name-lookup-algorithm.txt

If you would like to refer to this comment somewhere else in this project, copy and paste the following link:

Multicast name lookup algorithm is inefficient

Cluster wide IPC providing datagram, connection, and bus messaging

Group

Searches

Help

#76 Multicast name lookup algorithm is inefficient

Discussion