Cassandra remove the offline node

Use the nodetool tool that under the cassandra/bin directory

nodetool status

There are two nodes have been off line.

nodetool removenode 199553f1-f310-41e1-b4a4-f5a1fef7d1b8

wait for a moment

and on cassandra server terminal you will see:

INFO 10:50:36 Removing host: 199553f1-f310-41e1-b4a4-f5a1fef7d1b8
INFO 10:50:36 Sleeping for 30000ms to ensure /192.168.1.201 does not change
INFO 10:51:06 Advertising removal for /192.168.1.201
INFO 10:51:07 [Stream #60607920-429e-11e6-b2ec-cbf9a478e7df] Executing streaming plan for Restore replica count
INFO 10:51:07 Handshaking version with /192.168.1.110

...

INFO  10:51:07 Completing removal of /192.168.1.201

and now , execute nodetool status, you will see

finish.

时间： 2024-12-23 06:19:30

Cassandra remove the offline node的相关文章

LeetCode 19. Remove Nth Node From End of List

Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked list becomes 1->2->3->5. Note:Given n

19 Remove Nth Node From End of List

Given a linked list, remove the nth node from the end of list and return its head. For example,    Given linked list: 1->2->3->4->5, and n = 2.    After removing the second node from the end, the linked list becomes 1->2->3->5. Note:G

[LeetCode]Remove Nth Node From End of List

提米:删除链表从尾部到头部第N的节点. 思路: 两个指针,一个从头开始前移N个节点后,第二个指针开始移动,当第一指针移动到末尾时,第二个指针指向的是从尾部到头部的第N个节点. 注意: 1.N不合法,大于链表长度 2.要删除的是头结点 /***************************************************************************************** Given a linked list, remove the nth node f

LeetCode19 Remove Nth Node From End of List

题意: Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked list becomes 1->2->3->5. Try to d

Remove Nth Node From End of List

Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked list becomes 1->2->3->5. 使用两个指针扫描,当第一

Merge Two Sorted Lists & Remove Nth Node From End of List

1.合并两个排好序的list Merge Two Sorted Lists Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists. 2.删除list倒数第n个元素 Remove Nth Node From End of List Given a linked list,

[Leetcode][Python]19: Remove Nth Node From End of List

# -*- coding: utf8 -*-'''__author__ = '[email protected]' 19: Remove Nth Node From End of Listhttps://oj.leetcode.com/problems/remove-nth-node-from-end-of-list/ Given a linked list, remove the nth node from the end of list and return its head. For ex

【leetcode】Remove Nth Node From End of List（easy）

Given a linked list, remove the nth node from the end of list and return its head. For example, Given linked list: 1->2->3->4->5, and n = 2. After removing the second node from the end, the linked list becomes 1->2->3->5. 思路: 最基本的思路肯定

63. Swap Nodes in Pairs && Rotate List && Remove Nth Node From End of List

Swap Nodes in Pairs Given a linked list, swap every two adjacent nodes and return its head. For example, Given 1->2->3->4, you should return the list as 2->1->4->3. Your algorithm should use only constant space. You may not modify the va