Cluster.hpp 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410
  1. /*
  2. * ZeroTier One - Network Virtualization Everywhere
  3. * Copyright (C) 2011-2016 ZeroTier, Inc. https://www.zerotier.com/
  4. *
  5. * This program is free software: you can redistribute it and/or modify
  6. * it under the terms of the GNU General Public License as published by
  7. * the Free Software Foundation, either version 3 of the License, or
  8. * (at your option) any later version.
  9. *
  10. * This program is distributed in the hope that it will be useful,
  11. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  12. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  13. * GNU General Public License for more details.
  14. *
  15. * You should have received a copy of the GNU General Public License
  16. * along with this program. If not, see <http://www.gnu.org/licenses/>.
  17. */
  18. #ifndef ZT_CLUSTER_HPP
  19. #define ZT_CLUSTER_HPP
  20. #ifdef ZT_ENABLE_CLUSTER
  21. #include <map>
  22. #include "Constants.hpp"
  23. #include "../include/ZeroTierOne.h"
  24. #include "Address.hpp"
  25. #include "InetAddress.hpp"
  26. #include "SHA512.hpp"
  27. #include "Utils.hpp"
  28. #include "Buffer.hpp"
  29. #include "Mutex.hpp"
  30. #include "SharedPtr.hpp"
  31. #include "Hashtable.hpp"
  32. #include "Packet.hpp"
  33. #include "SharedPtr.hpp"
  34. /**
  35. * Timeout for cluster members being considered "alive"
  36. *
  37. * A cluster member is considered dead and will no longer have peers
  38. * redirected to it if we have not heard a heartbeat in this long.
  39. */
  40. #define ZT_CLUSTER_TIMEOUT 5000
  41. /**
  42. * Desired period between doPeriodicTasks() in milliseconds
  43. */
  44. #define ZT_CLUSTER_PERIODIC_TASK_PERIOD 50
  45. /**
  46. * How often to flush outgoing message queues (maximum interval)
  47. */
  48. #define ZT_CLUSTER_FLUSH_PERIOD 100
  49. /**
  50. * Maximum number of queued outgoing packets per sender address
  51. */
  52. #define ZT_CLUSTER_MAX_QUEUE_PER_SENDER 8
  53. /**
  54. * Expiration time for send queue entries
  55. */
  56. #define ZT_CLUSTER_QUEUE_EXPIRATION 5000
  57. /**
  58. * Chunk size for allocating queue entries
  59. *
  60. * Queue entries are allocated in chunks of this many and are added to a pool.
  61. * ZT_CLUSTER_MAX_QUEUE_GLOBAL must be evenly divisible by this.
  62. */
  63. #define ZT_CLUSTER_QUEUE_CHUNK_SIZE 32
  64. /**
  65. * Maximum number of chunks to ever allocate
  66. *
  67. * This is a global sanity limit to prevent resource exhaustion attacks. It
  68. * works out to about 600mb of RAM. You'll never see this on a normal edge
  69. * node. We're unlikely to see this on a root server unless someone is DOSing
  70. * us. In that case cluster relaying will be affected but other functions
  71. * should continue to operate normally.
  72. */
  73. #define ZT_CLUSTER_MAX_QUEUE_CHUNKS 8194
  74. /**
  75. * Max data per queue entry
  76. *
  77. * If we ever support larger transport MTUs this must be increased. The plus
  78. * 16 is just a small margin and has no special meaning.
  79. */
  80. #define ZT_CLUSTER_SEND_QUEUE_DATA_MAX (ZT_UDP_DEFAULT_PAYLOAD_MTU + 16)
  81. namespace ZeroTier {
  82. class RuntimeEnvironment;
  83. class MulticastGroup;
  84. class Peer;
  85. class Identity;
  86. // Internal class implemented inside Cluster.cpp
  87. class _ClusterSendQueue;
  88. /**
  89. * Multi-homing cluster state replication and packet relaying
  90. *
  91. * Multi-homing means more than one node sharing the same ZeroTier identity.
  92. * There is nothing in the protocol to prevent this, but to make it work well
  93. * requires the devices sharing an identity to cooperate and share some
  94. * information.
  95. *
  96. * There are three use cases we want to fulfill:
  97. *
  98. * (1) Multi-homing of root servers with handoff for efficient routing,
  99. * HA, and load balancing across many commodity nodes.
  100. * (2) Multi-homing of network controllers for the same reason.
  101. * (3) Multi-homing of nodes on virtual networks, such as domain servers
  102. * and other important endpoints.
  103. *
  104. * These use cases are in order of escalating difficulty. The initial
  105. * version of Cluster is aimed at satisfying the first, though you are
  106. * free to try #2 and #3.
  107. */
  108. class Cluster
  109. {
  110. public:
  111. /**
  112. * State message types
  113. */
  114. enum StateMessageType
  115. {
  116. CLUSTER_MESSAGE_NOP = 0,
  117. /**
  118. * This cluster member is alive:
  119. * <[2] version minor>
  120. * <[2] version major>
  121. * <[2] version revision>
  122. * <[1] protocol version>
  123. * <[4] X location (signed 32-bit)>
  124. * <[4] Y location (signed 32-bit)>
  125. * <[4] Z location (signed 32-bit)>
  126. * <[8] local clock at this member>
  127. * <[8] load average>
  128. * <[8] number of peers>
  129. * <[8] flags (currently unused, must be zero)>
  130. * <[1] number of preferred ZeroTier endpoints>
  131. * <[...] InetAddress(es) of preferred ZeroTier endpoint(s)>
  132. *
  133. * Cluster members constantly broadcast an alive heartbeat and will only
  134. * receive peer redirects if they've done so within the timeout.
  135. */
  136. CLUSTER_MESSAGE_ALIVE = 1,
  137. /**
  138. * Cluster member has this peer:
  139. * <[...] serialized identity of peer>
  140. *
  141. * This is typically sent in response to WANT_PEER but can also be pushed
  142. * to prepopulate if this makes sense.
  143. */
  144. CLUSTER_MESSAGE_HAVE_PEER = 2,
  145. /**
  146. * Cluster member wants this peer:
  147. * <[5] ZeroTier address of peer>
  148. *
  149. * Members that have a direct link to this peer will respond with
  150. * HAVE_PEER.
  151. */
  152. CLUSTER_MESSAGE_WANT_PEER = 3,
  153. /**
  154. * A remote packet that we should also possibly respond to:
  155. * <[2] 16-bit length of remote packet>
  156. * <[...] remote packet payload>
  157. *
  158. * Cluster members may relay requests by relaying the request packet.
  159. * These may include requests such as WHOIS and MULTICAST_GATHER. The
  160. * packet must be already decrypted, decompressed, and authenticated.
  161. *
  162. * This can only be used for small request packets as per the cluster
  163. * message size limit, but since these are the only ones in question
  164. * this is fine.
  165. *
  166. * If a response is generated it is sent via PROXY_SEND.
  167. */
  168. CLUSTER_MESSAGE_REMOTE_PACKET = 4,
  169. /**
  170. * Request that VERB_RENDEZVOUS be sent to a peer that we have:
  171. * <[5] ZeroTier address of peer on recipient's side>
  172. * <[5] ZeroTier address of peer on sender's side>
  173. * <[1] 8-bit number of sender's peer's active path addresses>
  174. * <[...] series of serialized InetAddresses of sender's peer's paths>
  175. *
  176. * This requests that we perform NAT-t introduction between a peer that
  177. * we have and one on the sender's side. The sender furnishes contact
  178. * info for its peer, and we send VERB_RENDEZVOUS to both sides: to ours
  179. * directly and with PROXY_SEND to theirs.
  180. */
  181. CLUSTER_MESSAGE_PROXY_UNITE = 5,
  182. /**
  183. * Request that a cluster member send a packet to a locally-known peer:
  184. * <[5] ZeroTier address of recipient>
  185. * <[1] packet verb>
  186. * <[2] length of packet payload>
  187. * <[...] packet payload>
  188. *
  189. * This differs from RELAY in that it requests the receiving cluster
  190. * member to actually compose a ZeroTier Packet from itself to the
  191. * provided recipient. RELAY simply says "please forward this blob."
  192. * RELAY is used to implement peer-to-peer relaying with RENDEZVOUS,
  193. * while PROXY_SEND is used to implement proxy sending (which right
  194. * now is only used to send RENDEZVOUS).
  195. */
  196. CLUSTER_MESSAGE_PROXY_SEND = 6,
  197. /**
  198. * Replicate a network config for a network we belong to:
  199. * <[8] 64-bit network ID>
  200. * <[2] 16-bit length of network config>
  201. * <[...] serialized network config>
  202. *
  203. * This is used by clusters to avoid every member having to query
  204. * for the same netconf for networks all members belong to.
  205. *
  206. * TODO: not implemented yet!
  207. */
  208. CLUSTER_MESSAGE_NETWORK_CONFIG = 7
  209. };
  210. /**
  211. * Construct a new cluster
  212. */
  213. Cluster(
  214. const RuntimeEnvironment *renv,
  215. uint16_t id,
  216. const std::vector<InetAddress> &zeroTierPhysicalEndpoints,
  217. int32_t x,
  218. int32_t y,
  219. int32_t z,
  220. void (*sendFunction)(void *,unsigned int,const void *,unsigned int),
  221. void *sendFunctionArg,
  222. int (*addressToLocationFunction)(void *,const struct sockaddr_storage *,int *,int *,int *),
  223. void *addressToLocationFunctionArg);
  224. ~Cluster();
  225. /**
  226. * @return This cluster member's ID
  227. */
  228. inline uint16_t id() const throw() { return _id; }
  229. /**
  230. * Handle an incoming intra-cluster message
  231. *
  232. * @param data Message data
  233. * @param len Message length (max: ZT_CLUSTER_MAX_MESSAGE_LENGTH)
  234. */
  235. void handleIncomingStateMessage(const void *msg,unsigned int len);
  236. /**
  237. * Broadcast that we have a given peer
  238. *
  239. * This should be done when new peers are first contacted.
  240. *
  241. * @param id Identity of peer
  242. */
  243. void broadcastHavePeer(const Identity &id);
  244. /**
  245. * Send this packet via another node in this cluster if another node has this peer
  246. *
  247. * This is used in the outgoing packet and relaying logic in Switch to
  248. * relay packets to other cluster members. It isn't PROXY_SEND-- that is
  249. * used internally in Cluster to send responses to peer queries.
  250. *
  251. * @param fromPeerAddress Source peer address (if known, should be NULL for fragments)
  252. * @param toPeerAddress Destination peer address
  253. * @param data Packet or packet fragment data
  254. * @param len Length of packet or fragment
  255. * @param unite If true, also request proxy unite across cluster
  256. */
  257. void sendViaCluster(const Address &fromPeerAddress,const Address &toPeerAddress,const void *data,unsigned int len,bool unite);
  258. /**
  259. * Send a distributed query to other cluster members
  260. *
  261. * Some queries such as WHOIS or MULTICAST_GATHER need a response from other
  262. * cluster members. Replies (if any) will be sent back to the peer via
  263. * PROXY_SEND across the cluster.
  264. *
  265. * @param pkt Packet to distribute
  266. */
  267. void sendDistributedQuery(const Packet &pkt);
  268. /**
  269. * Call every ~ZT_CLUSTER_PERIODIC_TASK_PERIOD milliseconds.
  270. */
  271. void doPeriodicTasks();
  272. /**
  273. * Add a member ID to this cluster
  274. *
  275. * @param memberId Member ID
  276. */
  277. void addMember(uint16_t memberId);
  278. /**
  279. * Remove a member ID from this cluster
  280. *
  281. * @param memberId Member ID to remove
  282. */
  283. void removeMember(uint16_t memberId);
  284. /**
  285. * Find a better cluster endpoint for this peer (if any)
  286. *
  287. * @param redirectTo InetAddress to be set to a better endpoint (if there is one)
  288. * @param peerAddress Address of peer to (possibly) redirect
  289. * @param peerPhysicalAddress Physical address of peer's current best path (where packet was most recently received or getBestPath()->address())
  290. * @param offload Always redirect if possible -- can be used to offload peers during shutdown
  291. * @return True if redirectTo was set to a new address, false if redirectTo was not modified
  292. */
  293. bool findBetterEndpoint(InetAddress &redirectTo,const Address &peerAddress,const InetAddress &peerPhysicalAddress,bool offload);
  294. /**
  295. * Fill out ZT_ClusterStatus structure (from core API)
  296. *
  297. * @param status Reference to structure to hold result (anything there is replaced)
  298. */
  299. void status(ZT_ClusterStatus &status) const;
  300. private:
  301. void _send(uint16_t memberId,StateMessageType type,const void *msg,unsigned int len);
  302. void _flush(uint16_t memberId);
  303. void _doREMOTE_WHOIS(uint64_t fromMemberId,const Packet &remotep);
  304. void _doREMOTE_MULTICAST_GATHER(uint64_t fromMemberId,const Packet &remotep);
  305. // These are initialized in the constructor and remain immutable ------------
  306. uint16_t _masterSecret[ZT_SHA512_DIGEST_LEN / sizeof(uint16_t)];
  307. unsigned char _key[ZT_PEER_SECRET_KEY_LENGTH];
  308. const RuntimeEnvironment *RR;
  309. _ClusterSendQueue *const _sendQueue;
  310. void (*_sendFunction)(void *,unsigned int,const void *,unsigned int);
  311. void *_sendFunctionArg;
  312. int (*_addressToLocationFunction)(void *,const struct sockaddr_storage *,int *,int *,int *);
  313. void *_addressToLocationFunctionArg;
  314. const int32_t _x;
  315. const int32_t _y;
  316. const int32_t _z;
  317. const uint16_t _id;
  318. const std::vector<InetAddress> _zeroTierPhysicalEndpoints;
  319. // end immutable fields -----------------------------------------------------
  320. struct _Member
  321. {
  322. unsigned char key[ZT_PEER_SECRET_KEY_LENGTH];
  323. uint64_t lastReceivedAliveAnnouncement;
  324. uint64_t lastAnnouncedAliveTo;
  325. uint64_t load;
  326. uint64_t peers;
  327. int32_t x,y,z;
  328. std::vector<InetAddress> zeroTierPhysicalEndpoints;
  329. Buffer<ZT_CLUSTER_MAX_MESSAGE_LENGTH> q;
  330. Mutex lock;
  331. inline void clear()
  332. {
  333. lastReceivedAliveAnnouncement = 0;
  334. lastAnnouncedAliveTo = 0;
  335. load = 0;
  336. peers = 0;
  337. x = 0;
  338. y = 0;
  339. z = 0;
  340. zeroTierPhysicalEndpoints.clear();
  341. q.clear();
  342. }
  343. _Member() { this->clear(); }
  344. ~_Member() { Utils::burn(key,sizeof(key)); }
  345. };
  346. _Member *const _members;
  347. std::vector<uint16_t> _memberIds;
  348. Mutex _memberIds_m;
  349. std::map< std::pair<Address,unsigned int>,uint64_t > _remotePeers; // we need ordered behavior and lower_bound here
  350. Mutex _remotePeers_m;
  351. uint64_t _lastFlushed;
  352. uint64_t _lastCleanedRemotePeers;
  353. uint64_t _lastCleanedQueue;
  354. };
  355. } // namespace ZeroTier
  356. #endif // ZT_ENABLE_CLUSTER
  357. #endif