-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDistributed_Network.h
427 lines (408 loc) · 12.6 KB
/
Distributed_Network.h
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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
#pragma once
#ifndef DISTRIBUTED_NETWORK_H_
#define DISTRIBUTED_NETWORK_H_
#include<iostream>
using namespace std;
#include<cmath>
#include<functional>
#include"AVL.h"
#include"Machine.h"
// Distributed_Network Class
template<class T>
class Distributed_Network
{
private:
int bit_size;
int total_machine;
machine<T>* network;
// Function to sort Circular link_list
void sort()
{
machine<T>* temp = network;
while (temp->next_machine != network)
{
machine<T>* temp1 = new machine<T>();
temp1 = temp->next_machine;
while (temp1 != network)
{
if (temp1->machine_no < temp->machine_no)
{
temp1->swap_data(temp, temp1);
}
temp1 = temp1->next_machine;
}
temp = temp->next_machine;
}
}
machine<T>* pointer(int a)
{
machine<T>* temp = network;
while (temp->next_machine != network)
{
if (temp->machine_no == a)
{
return temp;
}
temp = temp->next_machine;
}
return temp;
}
public:
Distributed_Network()
{
bit_size = 0;
total_machine = 0;
network = NULL;
}
// Funtions to set Bit size of Distributed Network
void set_bit_size(int n)
{
bit_size = n;
}
// Function to set TOtal Machines in Distributed Network
void set_total_machine(int a)
{
total_machine = a;
}
// Function to Link Machines Using IP Address
// & also this function handle to add new machine After Creating Distribited Network
void make_network_using_IP(T no)
{
hash<T> hashing;
int total = pow(2, bit_size);
int hash_value = (unsigned int)hashing(no) % total;
cout << "Machine Hash Value : " << hash_value << endl;
machine<T>* new_machine = new machine<T>();
new_machine->set_machine_no(hash_value);
if (network == NULL)
{
network = new_machine;
new_machine->next_machine = network;
}
else {
machine<T>* temp = network;
while (temp->next_machine != network)
{
if (temp->machine_no == new_machine->machine_no)
{
cout << "Machine with this ID already present" << endl;
return;
}
temp = temp->next_machine;
}
if (temp->machine_no == new_machine->machine_no)
{
cout << "Machine with this ID already present" << endl;
return;
}
temp->next_machine = new_machine;
new_machine->next_machine = network;
}
new_machine->make_file();
this->sort();
}
// Function to Link Machines Using machine_no
// & also this function handle to add new machine After Creating Distribited Network
void make_network_using_machine_no(int no)
{
machine<T>* new_machine = new machine<T>();
new_machine->set_machine_no(no);
cout << "Machine Hash Value : " << no << endl;
if (network == NULL)
{
network = new_machine;
new_machine->next_machine = network;
}
else {
machine<T>* temp = network;
while (temp->next_machine != network)
{
if (temp->machine_no == new_machine->machine_no)
{
cout << "Machine with this ID already present" << endl;
return;
}
temp = temp->next_machine;
}
if (temp->machine_no == new_machine->machine_no)
{
cout << "Machine with this ID already present" << endl;
return;
}
temp->next_machine = new_machine;
new_machine->next_machine = network;
}
new_machine->make_file();
this->sort();
}
// Function to Inset Key_Value pair in Distributed_Network
void insert_data_to_cloud(T val, T data, int k)
{
hash<T> hashing;
int total = pow(2, bit_size);
int hash_value = (unsigned int)hashing(val) % total;
cout << "Key Hash Value : " << hash_value << endl;
machine<T>* mac = pointer(k);
machine<T>* test = network;
bool check = false;
cout << "Path : ";
while (test->next_machine != network)
{
if (hash_value <= test->machine_no && mac->machine_no > test->machine_no)
{
cout << mac->machine_no << "->" << test->machine_no << endl;
test->insert(val, data);
test->limit++;
return;
}
test = test->next_machine;
}
machine<T>* temp = mac;
bool flag = true;
while (temp->next_machine != mac)
{
cout << temp->machine_no;
if (hash_value <= temp->machine_no)
{
if (temp->limit > 100)
{
temp->make_extra_file();
temp->limit = 0;
}
temp->insert(val, data);
temp->limit++;
cout << endl;
return;
}
cout << "->";
temp = temp->next_machine;
}
if (hash_value <= temp->machine_no)
{
cout << temp->machine_no;
if (temp->limit > 100)
{
temp->make_extra_file();
temp->limit = 0;
}
temp->insert(val, data);
temp->limit++;
flag = false;
}
if (flag)
{
cout << network->machine_no;
if (network->limit > 100)
{
network->make_extra_file();
network->limit = 0;
}
network->insert(val, data);
network->limit++;
}
cout << endl;
}
// Function to display all machine in Distributed_Network with Their Address
void display_all_machines()
{
cout << "All Machines in DHT Ring : " << endl;
machine<T>* temp = network;
while (temp->next_machine != network)
{
cout << temp->machine_no << " " << temp << endl;
temp = temp->next_machine;
}
cout << temp->machine_no << " " << temp << endl;
}
// Function to Create Finger_Table for each machine
void manage_table()
{
machine<T>* temp = network;
while (temp->next_machine != network)
{
temp->make_Finger_Table(this->bit_size, this->network);
temp = temp->next_machine;
}
temp->make_Finger_Table(this->bit_size, this->network);
}
// Function to Display Finger_Table using Machine ID
void display_Table_of_machines(int a)
{
machine<T>* temp = network;
while (temp->next_machine != network)
{
if (temp->machine_no == a)
{
temp->display_Table(temp->machine_no);
}
temp = temp->next_machine;
}
if (temp->machine_no == a)
{
temp->display_Table(temp->machine_no);
}
}
// Function to display AVL tree using Machine ID
void display_AVL_of_machines(int a)
{
machine<T>* temp = network;
while (temp->next_machine != network)
{
if (temp->machine_no == a)
{
temp->print_AVL();
}
temp = temp->next_machine;
}
if (temp->machine_no == a)
{
temp->print_AVL();
}
}
// Function to reterive data from Distributed_Network
T reterive_data_from_cloud(T key)
{
hash<T> hashing;
int total = pow(2, bit_size);
int hash_value = (unsigned int)hashing(key) % total;
T data = "";
machine<T>* temp = network;
bool flag = true;
while (temp->next_machine != network)
{
if (hash_value <= temp->machine_no)
{
data = temp->reterive(key);
if (data != "")
{
flag = false;
return data;
}
}
temp = temp->next_machine;
}
if (flag)
{
data = network->reterive(key);
if (data == "")
{
data = temp->reterive(key);
}
}
return data;
}
// Function to reterive Data from Machine using machine_id entered by User/provider
T reterive_data(T key, int no)
{
hash<T> hashing;
int total = pow(2, bit_size);
int hash_value = (unsigned int)hashing(key) % total;
T data = "";
machine<T>* temp = network;
bool flag = true;
while (temp->next_machine != network)
{
if (no == temp->machine_no)
{
if (hash_value <= temp->machine_no)
{
data = temp->reterive(key);
flag = false;
}
machine<T>* addr = NULL;
addr = temp->reterive_using_Lookup(hash_value);
if (hash_value <= addr->machine_no && addr != NULL && data == "")
{
data = addr->reterive(key);
if (data != "")
{
flag = false;
return data;
}
}
}
temp = temp->next_machine;
}
if (flag)
{
data = network->reterive(key);
if (data == "")
{
data = temp->reterive(key);
}
}
return data;
}
// Function to delete Machine using Machine_no & storing its AVL Tree in the next machine
void delete_machine_from_cloud(int id)
{
machine<T>* temp = network;
if (network->machine_no == id)
{
while (temp->next_machine != network)
{
temp = temp->next_machine;
}
temp->next_machine = network->next_machine;
network->next_machine->Shift_AVL_Tree_Data(network);
network = network->next_machine;
}
else {
while (temp->next_machine->machine_no != id)
{
temp = temp->next_machine;
}
temp->next_machine->next_machine->Shift_AVL_Tree_Data(temp->next_machine);
temp->next_machine = temp->next_machine->next_machine;
}
}
// Function to delete Key-Value pair from any machine
void delete_data(T key, int k)
{
hash<T> hashing;
int total = pow(2, bit_size);
int hash_value = (unsigned int)hashing(key) % total;
cout << "Key Hash Value : " << hash_value << endl;
machine<T>* mac = pointer(k);
machine<T>* test = network;
bool check = false;
cout << "Path : ";
while (test->next_machine != network)
{
if (hash_value <= test->machine_no && mac->machine_no > test->machine_no)
{
cout << mac->machine_no << "->" << test->machine_no << endl;
test->delete_data_from_AVL_Tree(key);
return;
}
test = test->next_machine;
}
machine<T>* temp = mac;
bool flag = true;
while (temp->next_machine != mac)
{
cout << temp->machine_no;
if (hash_value <= temp->machine_no)
{
temp->delete_data_from_AVL_Tree(key);
cout << endl;
return;
}
cout << "->";
temp = temp->next_machine;
}
if (hash_value <= temp->machine_no)
{
cout << temp->machine_no;
temp->delete_data_from_AVL_Tree(key);
flag = false;
}
if (flag)
{
cout << network->machine_no;
network->delete_data_from_AVL_Tree(key);
}
cout << endl;
}
};
#endif