|
| 1 | +/* |
| 2 | + * Licensed to the Apache Software Foundation (ASF) under one |
| 3 | + * or more contributor license agreements. See the NOTICE file |
| 4 | + * distributed with this work for additional information |
| 5 | + * regarding copyright ownership. The ASF licenses this file |
| 6 | + * to you under the Apache License, Version 2.0 (the |
| 7 | + * "License"); you may not use this file except in compliance |
| 8 | + * with the License. You may obtain a copy of the License at |
| 9 | + * |
| 10 | + * http://www.apache.org/licenses/LICENSE-2.0 |
| 11 | + * |
| 12 | + * Unless required by applicable law or agreed to in writing, software |
| 13 | + * distributed under the License is distributed on an "AS IS" BASIS, |
| 14 | + * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 15 | + * See the License for the specific language governing permissions and |
| 16 | + * limitations under the License. |
| 17 | + */ |
| 18 | +package com.datastax.oss.driver.internal.core.loadbalancing; |
| 19 | + |
| 20 | +import static org.assertj.core.api.Assertions.assertThat; |
| 21 | +import static org.mockito.ArgumentMatchers.any; |
| 22 | +import static org.mockito.ArgumentMatchers.eq; |
| 23 | +import static org.mockito.ArgumentMatchers.isNull; |
| 24 | +import static org.mockito.Mockito.atLeast; |
| 25 | +import static org.mockito.Mockito.never; |
| 26 | +import static org.mockito.Mockito.spy; |
| 27 | +import static org.mockito.Mockito.times; |
| 28 | +import static org.mockito.Mockito.verify; |
| 29 | +import static org.mockito.Mockito.when; |
| 30 | + |
| 31 | +import com.datastax.oss.driver.api.core.config.DefaultDriverOption; |
| 32 | +import com.datastax.oss.driver.api.core.config.DriverExecutionProfile; |
| 33 | +import com.datastax.oss.driver.api.core.metadata.Node; |
| 34 | +import com.datastax.oss.driver.internal.core.metadata.DefaultNode; |
| 35 | +import com.datastax.oss.driver.shaded.guava.common.collect.ImmutableList; |
| 36 | +import com.datastax.oss.driver.shaded.guava.common.collect.ImmutableMap; |
| 37 | +import com.datastax.oss.driver.shaded.guava.common.collect.ImmutableSet; |
| 38 | +import java.util.Map; |
| 39 | +import java.util.UUID; |
| 40 | +import org.junit.Test; |
| 41 | +import org.mockito.Mock; |
| 42 | + |
| 43 | +public class BasicLoadBalancingPolicyPreferredRemoteDcsTest |
| 44 | + extends BasicLoadBalancingPolicyDcFailoverTest { |
| 45 | + @Mock protected DefaultNode node10; |
| 46 | + @Mock protected DefaultNode node11; |
| 47 | + @Mock protected DefaultNode node12; |
| 48 | + @Mock protected DefaultNode node13; |
| 49 | + @Mock protected DefaultNode node14; |
| 50 | + |
| 51 | + @Override |
| 52 | + @Test |
| 53 | + public void should_prioritize_single_replica() { |
| 54 | + when(request.getRoutingKeyspace()).thenReturn(KEYSPACE); |
| 55 | + when(request.getRoutingKey()).thenReturn(ROUTING_KEY); |
| 56 | + when(tokenMap.getReplicas(KEYSPACE, ROUTING_KEY)).thenReturn(ImmutableSet.of(node3)); |
| 57 | + // Additional mock. Implementation diverges from upstream enough to call this method instead. |
| 58 | + when(tokenMap.getReplicas(eq(KEYSPACE), isNull(), eq(ROUTING_KEY))) |
| 59 | + .thenReturn(ImmutableSet.of(node3)); |
| 60 | + |
| 61 | + // node3 always first, round-robin on the rest |
| 62 | + assertThat(policy.newQueryPlan(request, session)) |
| 63 | + .containsExactly( |
| 64 | + node3, node1, node2, node4, node5, node9, node10, node6, node7, node12, node13); |
| 65 | + assertThat(policy.newQueryPlan(request, session)) |
| 66 | + .containsExactly( |
| 67 | + node3, node2, node4, node5, node1, node9, node10, node6, node7, node12, node13); |
| 68 | + assertThat(policy.newQueryPlan(request, session)) |
| 69 | + .containsExactly( |
| 70 | + node3, node4, node5, node1, node2, node9, node10, node6, node7, node12, node13); |
| 71 | + assertThat(policy.newQueryPlan(request, session)) |
| 72 | + .containsExactly( |
| 73 | + node3, node5, node1, node2, node4, node9, node10, node6, node7, node12, node13); |
| 74 | + |
| 75 | + // Should not shuffle replicas since there is only one |
| 76 | + verify(policy, never()).shuffleHead(any(), eq(1)); |
| 77 | + // But should shuffle remote nodes |
| 78 | + verify(policy, times(12)).shuffleHead(any(), eq(2)); |
| 79 | + } |
| 80 | + |
| 81 | + @Override |
| 82 | + @Test |
| 83 | + public void should_prioritize_and_shuffle_replicas() { |
| 84 | + when(request.getRoutingKeyspace()).thenReturn(KEYSPACE); |
| 85 | + when(request.getRoutingKey()).thenReturn(ROUTING_KEY); |
| 86 | + when(tokenMap.getReplicas(KEYSPACE, ROUTING_KEY)) |
| 87 | + .thenReturn(ImmutableSet.of(node1, node2, node3, node6, node9)); |
| 88 | + // Additional mock. Implementation diverges from upstream enough to call this method instead. |
| 89 | + when(tokenMap.getReplicas(eq(KEYSPACE), isNull(), eq(ROUTING_KEY))) |
| 90 | + .thenReturn(ImmutableSet.of(node1, node2, node3, node6, node9)); |
| 91 | + |
| 92 | + // node 6 and 9 being in a remote DC, they don't get a boost for being a replica |
| 93 | + assertThat(policy.newQueryPlan(request, session)) |
| 94 | + .containsExactly( |
| 95 | + node1, node2, node3, node4, node5, node9, node10, node6, node7, node12, node13); |
| 96 | + assertThat(policy.newQueryPlan(request, session)) |
| 97 | + .containsExactly( |
| 98 | + node1, node2, node3, node5, node4, node9, node10, node6, node7, node12, node13); |
| 99 | + |
| 100 | + // should shuffle replicas |
| 101 | + verify(policy, times(2)).shuffleHead(any(), eq(3)); |
| 102 | + // should shuffle remote nodes |
| 103 | + verify(policy, times(6)).shuffleHead(any(), eq(2)); |
| 104 | + // No power of two choices with only two replicas |
| 105 | + verify(session, never()).getPools(); |
| 106 | + } |
| 107 | + |
| 108 | + @Override |
| 109 | + protected void assertRoundRobinQueryPlans() { |
| 110 | + for (int i = 0; i < 3; i++) { |
| 111 | + assertThat(policy.newQueryPlan(request, session)) |
| 112 | + .containsExactly( |
| 113 | + node1, node2, node3, node4, node5, node9, node10, node6, node7, node12, node13); |
| 114 | + assertThat(policy.newQueryPlan(request, session)) |
| 115 | + .containsExactly( |
| 116 | + node2, node3, node4, node5, node1, node9, node10, node6, node7, node12, node13); |
| 117 | + assertThat(policy.newQueryPlan(request, session)) |
| 118 | + .containsExactly( |
| 119 | + node3, node4, node5, node1, node2, node9, node10, node6, node7, node12, node13); |
| 120 | + assertThat(policy.newQueryPlan(request, session)) |
| 121 | + .containsExactly( |
| 122 | + node4, node5, node1, node2, node3, node9, node10, node6, node7, node12, node13); |
| 123 | + assertThat(policy.newQueryPlan(request, session)) |
| 124 | + .containsExactly( |
| 125 | + node5, node1, node2, node3, node4, node9, node10, node6, node7, node12, node13); |
| 126 | + } |
| 127 | + |
| 128 | + verify(policy, atLeast(15)).shuffleHead(any(), eq(2)); |
| 129 | + } |
| 130 | + |
| 131 | + @Override |
| 132 | + protected BasicLoadBalancingPolicy createAndInitPolicy() { |
| 133 | + when(node4.getDatacenter()).thenReturn("dc1"); |
| 134 | + when(node5.getDatacenter()).thenReturn("dc1"); |
| 135 | + when(node6.getDatacenter()).thenReturn("dc2"); |
| 136 | + when(node7.getDatacenter()).thenReturn("dc2"); |
| 137 | + when(node8.getDatacenter()).thenReturn("dc2"); |
| 138 | + when(node9.getDatacenter()).thenReturn("dc3"); |
| 139 | + when(node10.getDatacenter()).thenReturn("dc3"); |
| 140 | + when(node11.getDatacenter()).thenReturn("dc3"); |
| 141 | + when(node12.getDatacenter()).thenReturn("dc4"); |
| 142 | + when(node13.getDatacenter()).thenReturn("dc4"); |
| 143 | + when(node14.getDatacenter()).thenReturn("dc4"); |
| 144 | + |
| 145 | + // Accept 2 nodes per remote DC |
| 146 | + when(defaultProfile.getInt( |
| 147 | + DefaultDriverOption.LOAD_BALANCING_DC_FAILOVER_MAX_NODES_PER_REMOTE_DC)) |
| 148 | + .thenReturn(2); |
| 149 | + when(defaultProfile.getBoolean( |
| 150 | + DefaultDriverOption.LOAD_BALANCING_DC_FAILOVER_ALLOW_FOR_LOCAL_CONSISTENCY_LEVELS)) |
| 151 | + .thenReturn(false); |
| 152 | + |
| 153 | + when(defaultProfile.getStringList( |
| 154 | + DefaultDriverOption.LOAD_BALANCING_DC_FAILOVER_PREFERRED_REMOTE_DCS)) |
| 155 | + .thenReturn(ImmutableList.of("dc3", "dc2")); |
| 156 | + |
| 157 | + // Use a subclass to disable shuffling, we just spy to make sure that the shuffling method was |
| 158 | + // called (makes tests easier) |
| 159 | + BasicLoadBalancingPolicy policy = |
| 160 | + spy( |
| 161 | + new BasicLoadBalancingPolicy(context, DriverExecutionProfile.DEFAULT_NAME) { |
| 162 | + @Override |
| 163 | + protected void shuffleHead(Object[] currentNodes, int headLength) { |
| 164 | + // nothing (keep in same order) |
| 165 | + } |
| 166 | + }); |
| 167 | + Map<UUID, Node> nodes = |
| 168 | + ImmutableMap.<UUID, Node>builder() |
| 169 | + .put(UUID.randomUUID(), node1) |
| 170 | + .put(UUID.randomUUID(), node2) |
| 171 | + .put(UUID.randomUUID(), node3) |
| 172 | + .put(UUID.randomUUID(), node4) |
| 173 | + .put(UUID.randomUUID(), node5) |
| 174 | + .put(UUID.randomUUID(), node6) |
| 175 | + .put(UUID.randomUUID(), node7) |
| 176 | + .put(UUID.randomUUID(), node8) |
| 177 | + .put(UUID.randomUUID(), node9) |
| 178 | + .put(UUID.randomUUID(), node10) |
| 179 | + .put(UUID.randomUUID(), node11) |
| 180 | + .put(UUID.randomUUID(), node12) |
| 181 | + .put(UUID.randomUUID(), node13) |
| 182 | + .put(UUID.randomUUID(), node14) |
| 183 | + .build(); |
| 184 | + policy.init(nodes, distanceReporter); |
| 185 | + assertThat(policy.getLiveNodes().dc("dc1")).containsExactly(node1, node2, node3, node4, node5); |
| 186 | + assertThat(policy.getLiveNodes().dc("dc2")).containsExactly(node6, node7); // only 2 allowed |
| 187 | + assertThat(policy.getLiveNodes().dc("dc3")).containsExactly(node9, node10); // only 2 allowed |
| 188 | + assertThat(policy.getLiveNodes().dc("dc4")).containsExactly(node12, node13); // only 2 allowed |
| 189 | + return policy; |
| 190 | + } |
| 191 | +} |
0 commit comments