1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
|
// Copyright 2018 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
package com.yahoo.search.dispatch;
import com.yahoo.search.Query;
import com.yahoo.search.dispatch.SearchCluster.Group;
import com.yahoo.search.dispatch.SearchCluster.Node;
import junit.framework.AssertionFailedError;
import org.junit.Test;
import java.util.Arrays;
import java.util.Optional;
import static org.hamcrest.Matchers.equalTo;
import static org.hamcrest.Matchers.is;
import static org.hamcrest.Matchers.not;
import static org.junit.Assert.assertThat;
/**
* @author ollivir
*/
public class LoadBalancerTest {
@Test
public void requreThatLoadBalancerServesSingleNodeSetups() {
Node n1 = new SearchCluster.Node(0, "test-node1", 0, 0);
SearchCluster cluster = new SearchCluster(88.0, Arrays.asList(n1), null, 1, null);
LoadBalancer lb = new LoadBalancer(cluster);
Optional<Group> grp = lb.takeGroupForQuery(new Query());
Group group = grp.orElseGet(() -> {
throw new AssertionFailedError("Expected a SearchCluster.Group");
});
assertThat(group.nodes().size(), equalTo(1));
}
@Test
public void requreThatLoadBalancerServesMultiGroupSetups() {
Node n1 = new SearchCluster.Node(0, "test-node1", 0, 0);
Node n2 = new SearchCluster.Node(1, "test-node2", 1, 1);
SearchCluster cluster = new SearchCluster(88.0, Arrays.asList(n1, n2), null, 1, null);
LoadBalancer lb = new LoadBalancer(cluster);
Optional<Group> grp = lb.takeGroupForQuery(new Query());
Group group = grp.orElseGet(() -> {
throw new AssertionFailedError("Expected a SearchCluster.Group");
});
assertThat(group.nodes().size(), equalTo(1));
}
@Test
public void requreThatLoadBalancerIgnoresClusteredSingleGroup() {
Node n1 = new SearchCluster.Node(0, "test-node1", 0, 0);
Node n2 = new SearchCluster.Node(1, "test-node2", 1, 0);
SearchCluster cluster = new SearchCluster(88.0, Arrays.asList(n1, n2), null, 2, null);
LoadBalancer lb = new LoadBalancer(cluster);
Optional<Group> grp = lb.takeGroupForQuery(new Query());
assertThat(grp.isPresent(), is(false));
}
@Test
public void requreThatLoadBalancerIgnoresClusteredGroups() {
Node n1 = new SearchCluster.Node(0, "test-node1", 0, 0);
Node n2 = new SearchCluster.Node(1, "test-node2", 1, 0);
Node n3 = new SearchCluster.Node(0, "test-node3", 0, 1);
Node n4 = new SearchCluster.Node(1, "test-node4", 1, 1);
SearchCluster cluster = new SearchCluster(88.0, Arrays.asList(n1, n2, n3, n4), null, 2, null);
LoadBalancer lb = new LoadBalancer(cluster);
Optional<Group> grp = lb.takeGroupForQuery(new Query());
assertThat(grp.isPresent(), is(false));
}
@Test
public void requreThatLoadBalancerReturnsDifferentGroups() {
Node n1 = new SearchCluster.Node(0, "test-node1", 0, 0);
Node n2 = new SearchCluster.Node(1, "test-node2", 1, 1);
SearchCluster cluster = new SearchCluster(88.0, Arrays.asList(n1, n2), null, 1, null);
LoadBalancer lb = new LoadBalancer(cluster);
// get first group
Optional<Group> grp = lb.takeGroupForQuery(new Query());
Group group = grp.get();
int id1 = group.id();
// release allocation
lb.releaseGroup(group);
// get second group
grp = lb.takeGroupForQuery(new Query());
group = grp.get();
assertThat(group.id(), not(equalTo(id1)));
}
@Test
public void requreThatLoadBalancerReturnsSameGroupForSameQuery() {
Node n1 = new SearchCluster.Node(0, "test-node1", 0, 0);
Node n2 = new SearchCluster.Node(1, "test-node2", 1, 1);
SearchCluster cluster = new SearchCluster(88.0, Arrays.asList(n1, n2), null, 1, null);
LoadBalancer lb = new LoadBalancer(cluster);
Query q = new Query();
// get first group
Optional<Group> grp = lb.takeGroupForQuery(q);
Group group = grp.get();
int id1 = group.id();
// release allocation
lb.releaseGroup(group);
// continue with same query
grp = lb.takeGroupForQuery(q);
group = grp.get();
assertThat(group.id(), equalTo(id1));
}
@Test
public void requreThatLoadBalancerReturnsGroupWithShortestQueue() {
Node n1 = new SearchCluster.Node(0, "test-node1", 0, 0);
Node n2 = new SearchCluster.Node(1, "test-node2", 1, 1);
SearchCluster cluster = new SearchCluster(88.0, Arrays.asList(n1, n2), null, 1, null);
LoadBalancer lb = new LoadBalancer(cluster);
// get first group
Optional<Group> grp = lb.takeGroupForQuery(new Query());
Group group = grp.get();
int id1 = group.id();
// get second group
grp = lb.takeGroupForQuery(new Query());
group = grp.get();
int id2 = group.id();
assertThat(id2, not(equalTo(id1)));
// release second allocation
lb.releaseGroup(group);
// get third group
grp = lb.takeGroupForQuery(new Query());
group = grp.get();
assertThat(group.id(), equalTo(id2));
}
}
|
