Construct the skeleton tree′s adjacency matrix, then define a Topology Signature Vector and compute the distance of matching node pair by the difference of the TSV.

MQ clustering will provide load balancing for all of the inbound events, and the JMS adapter and queue manager will fail over as a pair to the passive node in the availability cluster.

They are slightly different from the node structures I showed you in c, above, because the bottom half of a pair doesn't have to be a pointer to a list node.