Files
awesome-system-design-resou…/implementations/java/load balancer algorithms/LeastConnections.java
2024-06-01 23:11:42 -07:00

37 lines
1.1 KiB
Java

import java.util.HashMap;
import java.util.List;
import java.util.Map;
public class LeastConnections {
private Map<String, Integer> serverConnections;
public LeastConnections(List<String> servers) {
serverConnections = new HashMap<>();
for (String server : servers) {
serverConnections.put(server, 0);
}
}
public String getNextServer() {
return serverConnections.entrySet().stream()
.min(Map.Entry.comparingByValue())
.map(Map.Entry::getKey)
.orElse(null);
}
public void releaseConnection(String server) {
serverConnections.computeIfPresent(server, (k, v) -> v > 0 ? v - 1 : 0);
}
public static void main(String[] args) {
List<String> servers = List.of("Server1", "Server2", "Server3");
LeastConnections leastConnectionsLB = new LeastConnections(servers);
for (int i = 0; i < 6; i++) {
String server = leastConnectionsLB.getNextServer();
System.out.println(server);
leastConnectionsLB.releaseConnection(server);
}
}
}