@Override public void destroyNode(OverlayNode overlayNode) throws OverlayException { overlayNode.leave(); } }
/** * Constructor of the class. Receives a reference of the chord node and * initializes the size, pointer next and the fingers table. * * @param nodeChord The reference of the chord node. */ FingersTable(ChordNode nodeChord, KeyFactory keyFactory) { this.size = keyFactory.getKeyLength(); this.chordNode = nodeChord; this.next = 0; this.fingersTable = new ChordKey[size]; this.keyFactory = keyFactory; }
ChordKey getKey(String name) { return (ChordKey) keyFactory.newKey(name); }
boolean putSync(Resource resource, ProgressStatus progressStatus) throws StorageException { progressStatus.status("put", 0L, 1L); progressStatus.status("overlay-node-lookup", 0L, 1L); Key key = keyFactory.newKey(resource.getId()); log.debug("Resource to put: [" + resource.getId() + "] Hashing: [" + key.getHashing() + "]"); Key lookupKey = overlayNode.lookUp(key); progressStatus.status("overlay-node-lookup", 1L, 1L); if (lookupKey == null) { log.error("Impossible to do put the resource: " + resource.getId() + " in this moment"); throw new StorageException("Impossible to do put the resource: " + resource.getId() + " in this moment"); } log.debug("Lookup key for " + key.getHashing() + ": [" + lookupKey.getValue() + "]"); boolean success = put(resource, lookupKey, true, progressStatus); progressStatus.status("put", 1L, 1L); return success; }
public void leave(ProgressStatus progressStatus) throws StorageException { try { Key[] keys = overlayNode.leave(); Set<String> resourcesNames = resourceManager.getAllKeys(); log.info("Leaving..."); log.debug("Number of files to transfer: [" + resourcesNames.size() + "]"); if (!keys[0].equals(overlayNode.getKey())) { for (String name : resourcesNames) { Resource resource = resourceManager.find(name); put(resource, keys[0], false, progressStatus); resource.close(); } } resourceManager.deleteAll(); communicationManager.removeObserver(overlayNode.getKey().getValue()); } catch (OverlayException | IOException e) { log.error("Error while leaving dhash node: '" + overlayNode.getKey().toString() + "'"); } }
/** * Replicates the specified file in its successors. * * @param resourceId The specified {@link Resource} to replicate. * @throws OverlayException */ public void replicateData(String resourceId, ProgressStatus progressStatus) throws OverlayException, StorageException { Key[] succesorList = overlayNode.getNeighborsList(); for (int i = 0; i < Math.min(replicationFactor, succesorList.length); i++) { Resource resource = resourceManager.find(resourceId); log .debug("Replicate File: [" + resource.getId() + "] Hashing: [" + succesorList[i].getHashing() + "]"); log.debug("Replicate to " + succesorList[i].getHashing()); put(resource, succesorList[i], false, progressStatus); } }
if (key1.getHashing().compareTo(key2.getHashing()) == -1) { if (hashing.compareTo(key1.getHashing()) == 1 && (hashing.compareTo(key2.getHashing()) == -1 || hashing .compareTo(key2.getHashing()) == 0)) { return true; if (key1.getHashing().compareTo(key2.getHashing()) == 1) { if ((hashing.compareTo(key1.getHashing()) == 1 && hashing .compareTo(key2.getHashing()) == 1) || hashing.compareTo(key2.getHashing()) == 0) { return true; } else { if (hashing.compareTo(key1.getHashing()) == -1 && hashing.compareTo(key2.getHashing()) == -1) { return true; if (hashing.compareTo(key2.getHashing()) == 0) { return true;
/** * Relocates the resources of the node. * * @param key The node where the files will be relocated. */ public void relocateAllResources(Key key, ProgressStatus progressStatus) throws StorageException { Set<String> resourcesNames = resourceManager.getAllKeys(); log.info("Relocating Files..."); log.debug("Number of files: [" + resourcesNames.size() + "]"); int filesRelocated = 0; for (String name : resourcesNames) { Resource resource = resourceManager.find(name); Key fileKey = getFileKey(name); if (!fileKey.isBetween(key, overlayNode.getKey())) { boolean relocate = put(resource, key, false, progressStatus); filesRelocated++; } } log.info("Files relocated: [" + filesRelocated + "]"); }
/** * Join a Chord ring using node <code>node</code>. * <p> * The <code>join</code> function asks <code>node</code> to find the * immediate successor of <code>n</code>. * * @param node Identifier of the known node. */ public void join(Key node) { Message lookupMessage; predecessor = null; lookupMessage = Message.builder() .id(idGenerator.newId()) .sendType(Message.SendType.REQUEST) .messageType(Protocol.LOOKUP) .address(Address.builder() .destination(node.getValue()) .source(key.getValue()) .build()) .param(Protocol.LookupParams.HASHING.name(), key.getHashing().toString()) .param(Protocol.LookupParams.TYPE.name(), LookupType.JOIN.name()) .build(); successor = communicationManager.send(lookupMessage, ChordKey.class, LookupResponseParams.NODE_FIND.name()); successorList.initializeSuccessors(); }
public StorageNode createNode(String name) throws DHashFactoryException { OverlayNode overlayNode; DHashNode dhashNode; try { overlayNode = overlayNodeFactory.createNode(name); dhashNode = createNode(name, overlayNode); } catch (OverlayException e) { throw new DHashFactoryException("Error creating overlay node", e); } return dhashNode; }
/** * Creates dhash node by name and overlay node. The name is escaped using * <code>EscapeChars.forHTML</code>. Adds observer to the communication * * @param name Node name * @param overlayNode Overlay node * @return DHash node */ private DHashNode createNode(String name, OverlayNode overlayNode) { DHashNode dhashNode; MessageProcessorGateway dHashEnviroment; ResourceManager resourceManager = resourceManagerFactory.of(name); dhashNode = getDHashNode(name, overlayNode, resourceManager); ReAssignObserver reAssignObserver = getReAssignObserver(dhashNode); overlayNode.getObservable().addObserver(reAssignObserver); dHashEnviroment = getMessageProcessor(dhashNode, resourceManager); communicationManager.addMessageProcessor(name, dHashEnviroment); communicationManager.addMessageStreamProcessor(name, getMessageStreamProcessor(dhashNode, resourceManager)); log.debug("DHash Node " + name + " Created"); return dhashNode; }
Key getFileKey(String name) { return keyFactory.newKey(name); }
if (key1.getHashing().compareTo(key2.getHashing()) == -1) { if (hashing.compareTo(key1.getHashing()) == 1 && (hashing.compareTo(key2.getHashing()) == -1)) { return true; if (key1.getHashing().compareTo(key2.getHashing()) == 1) { if (hashing.compareTo(key1.getHashing()) == 1 && hashing.compareTo(key2.getHashing()) == 1) { return true; } else { if (hashing.compareTo(key1.getHashing()) == -1 && hashing.compareTo(key2.getHashing()) == -1) { return true; if (hashing.compareTo(key2.getHashing()) == 0) { return true;
/** * Called always for <code>FingersTable.fixFingers</code> * <p> * Create the <code>i-th</code> entry to be test in the fingers table. The * next entry is given by * <code>(node.key + 2^(next-1)) mod 2^(size), 1<=k<=m</code> * * @param key Node's key * @return {@link Key} The key to be test in the fingers table. */ ChordKey createNext(ChordKey key) { Key nextKey; BigInteger nextValue; BigInteger twoPow; BigInteger maxValue; twoPow = new BigInteger("2"); twoPow = twoPow.pow(next); nextValue = new BigInteger(key.getHashing().toByteArray()); nextValue = nextValue.add(twoPow); maxValue = new BigInteger("2"); maxValue = maxValue.pow(size); nextValue = nextValue.mod(maxValue); nextKey = keyFactory.newKey(nextValue); return (ChordKey) nextKey; }
/** * Process message of type is SET_SUCCESSOR * * @param message Message SET_SUCCESSOR */ private Message processSetSuccessor(Message message) { ChordKey nodeSucessor; nodeSucessor = (ChordKey) keyFactory.newKey(message.getParam(SetSuccessorParams.SUCCESSOR .name())); chordNode.setSuccessor(nodeSucessor); return null; }
/** * Process message of type is SET_PREDECESSOR * * @param message Message SET_PREDECESSOR */ private Message processSetPredecessor(Message message) { ChordKey nodePredecessor; nodePredecessor = (ChordKey) keyFactory.newKey(message .getParam(SetPredecessorParams.PREDECESSOR.name())); chordNode.setPredecessor(nodePredecessor); return null; }
@Override public void update(Observable observable, Object object) { if (object instanceof Message) { Message message = (Message) object; log.info("Update: " + message); if (message.getMessageType().getName().equals(RE_ASSIGN)) { try { dHashNode.relocateAllResources(keyFactory.newKey(message.getParam(PREDECESSOR)), (name, current, size) -> { }); } catch (StorageException e) { log.error("Problem relocating files", e); } } } } }
/** * Process message of type is NOTIFY * * @param message Message NOTIFY */ private Message processNotify(Message message) { if (!message.isMessageFromMySelf()) { ChordKey node; node = (ChordKey) keyFactory.newKey(message.getAddress().getSource()); chordNode.notify(node); } return null; }
ChordKey id; id = (ChordKey) keyFactory.newKey(new BigInteger(message.getParam(LookupParams.HASHING .name())));