1 /* Copyright (c) 2012-2014, 2016. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
9 import org.simgrid.msg.Host;
11 import org.simgrid.msg.Msg;
12 import org.simgrid.msg.Comm;
13 import org.simgrid.msg.Task;
14 import org.simgrid.msg.Process;
15 import org.simgrid.msg.MsgException;
17 public class Node extends Process {
19 protected RoutingTable table;
20 protected int deadline;
21 protected int findNodeSuccedded = 0;
22 protected int findNodeFailed = 0;
25 public Node(Host host, String name, String[]args) {
26 super(host,name,args);
30 public void main(String[] args) throws MsgException {
31 //Check the number of arguments.
32 if (args.length != 2 && args.length != 3) {
33 Msg.info("Wrong argument count.");
36 this.id = Integer.valueOf(args[0]);
37 this.table = new RoutingTable(this.id);
39 if (args.length == 3) {
40 this.deadline = Integer.valueOf(args[2]).intValue();
41 Msg.info("Hi, I'm going to join the network with the id " + id + "!");
42 if (joinNetwork(Integer.valueOf(args[1]))) {
46 Msg.info("I couldn't join the network :(");
50 this.deadline = Integer.valueOf(args[1]).intValue();
51 Msg.info("Hi, I'm going to create the network with the id " + id + "!");
52 table.update(this.id);
55 Msg.debug("I'm leaving the network");
56 Msg.debug("Here is my routing table:" + table);
59 public void mainLoop() {
60 double next_lookup_time = Msg.getClock() + Common.RANDOM_LOOKUP_INTERVAL;
61 while (Msg.getClock() < this.deadline) {
64 comm = Task.irecv(Integer.toString(id));
67 if (Msg.getClock() >= next_lookup_time) {
69 next_lookup_time += Common.RANDOM_LOOKUP_INTERVAL;
74 Task task = comm.getTask();
82 Msg.info(findNodeSuccedded + "/" + (findNodeSuccedded + findNodeFailed) + " FIND_NODE have succedded.");
86 * @brief Try to make the node join the network
87 * @param idKnown Id of someone we know in the system
89 public boolean joinNetwork(int idKnown) {
90 boolean answerGot = false;
91 double timeBegin = Msg.getClock();
92 Msg.debug("Joining the network knowing " + idKnown);
93 //Add ourselves and the node we know to our routing table
94 table.update(this.id);
95 table.update(idKnown);
96 //Send a "FIND_NODE" to the node we know.
97 sendFindNode(idKnown,this.id);
98 //Wait for the answer.
104 comm = Task.irecv(Integer.toString(id));
110 Task task = comm.getTask();
111 if (task instanceof FindNodeAnswerTask) {
113 //Retrieve the node list and ping them
114 FindNodeAnswerTask answerTask = (FindNodeAnswerTask)task;
115 Answer answer = answerTask.getAnswer();
118 if (answer.getDestinationId() == this.id) {
119 //Ping everyone in the list
120 for (Contact c : answer.getNodes()) {
121 table.update(c.getId());
131 catch (Exception ex) {
133 Msg.info("FIND_NODE failed");
135 } while (!answerGot && trials < Common.MAX_JOIN_TRIALS);
136 /* Second step: Send a FIND_NODE in a node in each bucket */
137 int bucketId = table.findBucket(idKnown).getId();
138 for (int i = 0; ((bucketId - i) > 0 ||
139 (bucketId + i) <= Common.IDENTIFIER_SIZE) &&
140 i < Common.JOIN_BUCKETS_QUERIES; i++) {
141 if (bucketId - i > 0) {
142 int idInBucket = table.getIdInPrefix(this.id,bucketId - i);
143 this.findNode(idInBucket,false);
145 if (bucketId + i <= Common.IDENTIFIER_SIZE) {
146 int idInBucket = table.getIdInPrefix(this.id,bucketId + i);
147 findNode(idInBucket,false);
150 Msg.debug("Time spent:" + (Msg.getClock() - timeBegin));
154 /* Send a request to find a node in the node's routing table. */
155 public boolean findNode(int destination, boolean counts) {
156 int queries, answers;
158 boolean destinationFound = false;
160 double timeBeginReceive;
161 double timeout, globalTimeout = Msg.getClock() + Common.FIND_NODE_GLOBAL_TIMEOUT;
162 //Build a list of the closest nodes we already know.
163 Answer nodeList = table.findClosest(destination);
164 Msg.verb("Doing a FIND_NODE on " + destination);
166 timeBeginReceive = Msg.getClock();
168 queries = this.sendFindNodeToBest(nodeList);
170 timeout = Msg.getClock() + Common.FIND_NODE_TIMEOUT;
175 comm = Task.irecv(Integer.toString(id));
180 Task task = comm.getTask();
181 if (task instanceof FindNodeAnswerTask) {
182 FindNodeAnswerTask answerTask = (FindNodeAnswerTask)task;
183 //Check if we received what we are looking for.
184 if (answerTask.getDestinationId() == destination) {
185 table.update(answerTask.getSenderId());
186 //Add the answer to our routing table
187 for (Contact c: answerTask.getAnswer().getNodes()) {
188 table.update(c.getId());
192 nodesAdded = nodeList.merge(answerTask.getAnswer());
194 /* If it's not our answer, we answer to the node that has queried us anyway */
196 //Update the timeout if it's not our answer.
197 timeout += Msg.getClock() - timeBeginReceive;
198 timeBeginReceive = Msg.getClock();
202 timeout += Msg.getClock() - timeBeginReceive;
203 timeBeginReceive = Msg.getClock();
208 catch (Exception e) {
211 } while (answers < queries && Msg.getClock() < timeout);
212 destinationFound = nodeList.destinationFound();
213 } while (!destinationFound && (nodesAdded > 0 || answers == 0) && Msg.getClock() < globalTimeout
214 && steps < Common.MAX_STEPS);
216 if (destinationFound) {
220 Msg.debug("Find node on " + destination + " succedded");
222 Msg.debug("Find node on " + destination + " failed");
223 Msg.debug("Queried " + queries + " nodes to find " + destination);
224 Msg.debug(nodeList.toString());
229 return destinationFound;
233 * @brief Sends a "PING" request to a node
234 * @param destination Ping destination id.
236 public void ping(int destination) {
237 boolean destinationFound = false;
238 double timeout = Msg.getClock() + Common.PING_TIMEOUT;
239 PingTask pingTask = new PingTask(this.id);
240 /* Sending the ping task */
241 pingTask.dsend(Integer.toString(destination));
244 Task task = Task.receive(Integer.toString(this.id),Common.PING_TIMEOUT);
245 if (task instanceof PingAnswerTask) {
246 PingAnswerTask answerTask = (PingAnswerTask)task;
247 if (answerTask.getSenderId() == destination) {
248 this.table.update(destination);
249 destinationFound = true;
258 catch (Exception ex) {
260 } while (Msg.getClock() < timeout && !destinationFound);
264 * @brief Sends a "FIND_NODE" request (task) to a node we know.
265 * @param id Id of the node we are querying
266 * @param destination id of the node we are trying to find.
268 public void sendFindNode(int id, int destination) {
269 Msg.debug("Sending a FIND_NODE to " + Integer.toString(id) + " to find " + destination );
270 FindNodeTask task = new FindNodeTask(this.id,destination);
271 task.dsend(Integer.toString(id));
274 /** Sends a "FIND_NODE" request to the best "alpha" nodes in a node list */
275 public int sendFindNodeToBest(Answer nodeList) {
276 int destination = nodeList.getDestinationId();
278 for (i = 0; i < Common.alpha && i < nodeList.size(); i++) {
279 Contact node = nodeList.getNodes().get(i);
280 if (node.getId() != this.id) {
281 this.sendFindNode(node.getId(),destination);
287 public void randomLookup() {
292 * @brief Handles an incomming task
293 * @param task The task we need to handle
295 public void handleTask(Task task) {
296 if (task instanceof KademliaTask) {
297 table.update(((KademliaTask) task).getSenderId());
298 if (task instanceof FindNodeTask) {
299 handleFindNode((FindNodeTask)task);
301 else if (task instanceof PingTask) {
302 handlePing((PingTask)task);
307 public void handleFindNode(FindNodeTask task) {
308 Msg.debug("Received a FIND_NODE from " + task.getSenderId());
309 Answer answer = table.findClosest(task.getDestination());
310 FindNodeAnswerTask taskToSend = new FindNodeAnswerTask(this.id,task.getDestination(),answer);
311 taskToSend.dsend(Integer.toString(task.getSenderId()));
314 public void handlePing(PingTask task) {
315 Msg.debug("Received a PING from " + task.getSenderId());
316 PingAnswerTask taskToSend = new PingAnswerTask(this.id);
317 taskToSend.dsend(Integer.toString(task.getSenderId()));