-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathOptimisticalUnchokedHandler.java
129 lines (109 loc) · 4.62 KB
/
OptimisticalUnchokedHandler.java
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
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
// This class is used to deal with optimistically unchoking neighbor.
public class OptimisticalUnchokedHandler implements Runnable {
private Map<Integer, NeighborInfo> neighborsMap;
private Map<Integer, NeighborInfo> interestedNeighborMap;
private List<NeighborInfo> chokedNeighbors;
private NeighborInfo optimisticalUnchokedNeighbor;
private Commoncfg commoncfg;
private Logger logger;
private int myPeerID;
public OptimisticalUnchokedHandler(Commoncfg commoncfg, Map<Integer, NeighborInfo> neighborsMap, Logger logger, int myPeerID) {
this.neighborsMap = neighborsMap;
interestedNeighborMap = new HashMap<>();
chokedNeighbors = new ArrayList<>();
this.commoncfg = commoncfg;
this.logger = logger;
this.myPeerID = myPeerID;
}
public void run() {
try {
while (true) {
selectOptimisticalUnchokedNeighbor();
// System.out.println("Select optimistical unchoked neighbor: Peer " + optimisticalUnchokedNeighbor.getPeerID());
Thread.sleep(commoncfg.getOptimistic_Unchoking_Interval() * 1000);
}
} catch (Exception e) {
e.printStackTrace();
}
}
private synchronized void selectOptimisticalUnchokedNeighbor() {
NeighborInfo prevOptimisticalUnchokedNeighbor = getPrevOptimisticalUnchokedNeighbor();
getInteresetedNeighbor();
getChokedNeighbors();
if (prevOptimisticalUnchokedNeighbor != null) {
Message msg = null;
try {
msg = new ChokeMessage();
neighborsMap.get(prevOptimisticalUnchokedNeighbor.getPeerID()).setOptimisticallyUnchoked(false);
neighborsMap.get(prevOptimisticalUnchokedNeighbor.getPeerID()).setChoked(true);
neighborsMap.get(prevOptimisticalUnchokedNeighbor.getPeerID()).getClient().send(msg.getMessageBytes());
} catch (IOException e) {
e.printStackTrace();
}
}
if (chokedNeighbors.size() > 0) {
optimisticalUnchokedNeighbor = chokedNeighbors.get((int) Math.random() * chokedNeighbors.size());
Message msg = null;
try {
boolean a = false;
if (a) {
System.out.println("To select Optimistical Unchoked Neighbor");
}
msg = new UnchokeMessage();
neighborsMap.get(optimisticalUnchokedNeighbor.getPeerID()).setOptimisticallyUnchoked(true);
neighborsMap.get(optimisticalUnchokedNeighbor.getPeerID()).setChoked(false);
boolean b = false;
if (b) {
System.out.println("To send byte messages");
}
neighborsMap.get(optimisticalUnchokedNeighbor.getPeerID()).getClient().send(msg.getMessageBytes());
System.out.println("Unchoke " + neighborsMap.get(optimisticalUnchokedNeighbor.getPeerID()).getPeerID());
if (myPeerID != optimisticalUnchokedNeighbor.getPeerID()) {
logger.OptUnchokedNeighbours("" + myPeerID, "" + optimisticalUnchokedNeighbor.getPeerID());
}
} catch (IOException e) {
e.printStackTrace();
}
}
}
private void getChokedNeighbors() {
chokedNeighbors.clear();
for (Integer peerID : interestedNeighborMap.keySet()) {
NeighborInfo neighbor = interestedNeighborMap.get(peerID);
if (neighbor.isChoked()) {
chokedNeighbors.add(neighbor);
}
}
}
private NeighborInfo getPrevOptimisticalUnchokedNeighbor() {
for (Integer peerID : neighborsMap.keySet()) {
boolean a = false;
if (a) {
System.out.println("To get Optimistical Unchoked Neighbor");
}
NeighborInfo neighbor = neighborsMap.get(peerID);
if (neighbor.isOptimisticallyUnchoked()) {
return neighbor;
}
}
return null;
}
private void getInteresetedNeighbor() {
interestedNeighborMap.clear();
boolean a = false;
if (a) {
System.out.println("To get Interested Neighbor");
}
for (Integer peerID : neighborsMap.keySet()) {
NeighborInfo neighbor = neighborsMap.get(peerID);
if (neighbor.isInterest() == true) {
interestedNeighborMap.put(peerID, neighbor);
}
}
}
}