-
Notifications
You must be signed in to change notification settings - Fork 2
/
trace_daemon.cpp
539 lines (470 loc) · 18.3 KB
/
trace_daemon.cpp
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
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
#include <ndn-cxx/mgmt/nfd/controller.hpp>
#include <ndn-cxx/mgmt/nfd/fib-entry.hpp>
#include <ndn-cxx/face.hpp>
#include <ndn-cxx/security/validator-null.hpp>
#include <ndn-cxx/security/key-chain.hpp>
#include <map>
#include <chrono>
#include <ctime>
#include <stdio.h>
#include <boost/thread/thread.hpp>
#include <rapidjson/document.h>
#include <rapidjson/stringbuffer.h>
#include <rapidjson/prettywriter.h>
#include <cstdio>
namespace ndn {
namespace examples {
using namespace std::chrono;
using ndn::nfd::Controller;
using namespace rapidjson;
typedef std::chrono::high_resolution_clock Clock;
class Tracker : noncopyable
{
public:
void
runp()
{
a_face.setInterestFilter("/Trace",
bind(&Tracker::onInterest, this, _1, _2),
RegisterPrefixSuccessCallback(),
bind(&Tracker::onRegisterFailed, this, _1, _2));
a_face.processEvents();
}
private:
int number(){
static std::uniform_int_distribution<uint32_t> distribution;
return distribution(getRandomGenerator());
}
static std::mt19937&
getRandomGenerator()
{
static std::mt19937 rng{std::random_device{}()};
return rng;
}
std::string
getcomp(const Interest& interest, int i){
return interest.getName().at(-i).toUri();;
}
void
onRegisterFailed(const Name& prefix, const std::string& reason)
{
std::cerr << "ERROR: Failed to register prefix \""
<< prefix << "\" in local hub's daemon (" << reason << ")"
<< std::endl;
a_face.shutdown();
}
/// loop check
bool
Islooped(const Interest& interest){
bool verdict = false;
for(std::vector<uint32_t>::iterator it=loop.begin() ; it !=loop.end(); ++it){
uint32_t nonce = *it;
if (interest.getNonce() == nonce){
verdict = true;
} // if it's looped do nothing for now
else{
loop.push_back(interest.getNonce()); // else just record the nonce
verdict = false;
}
}
return verdict;
}
void
onInterest(const InterestFilter& filter, const Interest& interest)
{
struct Quest r;
r.First_Arr = steady_clock::now(); // Record arrival time of this request
r.Oname = interest.getName().toUri(); // Record original name of this request
Reqs[interest.getNonce()]=r;
// looped trace interest?
if (Islooped(interest)){
return;
}
int k = (-1)*(interest.getName().size());
int i;
Reqs[interest.getNonce()].p1 = interest.getName().at(k+1).toUri();
Reqs[interest.getNonce()].p2 = interest.getName().at(k+2).toUri();
if (Reqs[interest.getNonce()].p1=="M"){ // Could be from User (no face_id) or from another daemon
// Get the name to trace
const ndn::Name c = interest.getName().at(k+3).toUri();
const ndn::Name nx = c.toUri() ;
ndn::Name v = nx.toUri();
// Different names according to where the interest is coming from UID or TID
std::size_t found4 = interest.getName().at(-1).toUri().find("Key-UID");
if (found4!=std::string::npos){// user interest
for(i=k+4; i< -1; i++){
v = v.toUri() + "/" + interest.getName().at(i).toUri();
}
}else{// another daemon's interest
for(i=k+4; i< -2; i++){
v = v.toUri() + "/" + interest.getName().at(i).toUri();
}
}
//adding the name to the map
Reqs[interest.getNonce()].Lname = v.toUri();
// Query the Fib manager
KeyChain x_keyChain;
ndn::nfd::Controller cont(a_face, x_keyChain);
const ndn::nfd::CommandOptions& options = {};
const ndn::Name& name = Reqs[interest.getNonce()].Lname;
query(cont, name, interest.getNonce(), options);
}else{
// Enter single path section
const ndn::Name c = interest.getName().at(k+3).toUri();
const ndn::Name nx = c.toUri() ;
ndn::Name v = nx.toUri();
// Getting the name to lookup
for(i=k+4; i< -1; i++){
v = v.toUri() + "/" + interest.getName().at(i).toUri(); // The name to lookup
}
Reqs[interest.getNonce()].Lname = v.toUri();
ndn::Interest I;
ndn::Name n = "/Trace/S/"+Reqs[interest.getNonce()].p2+ v.toUri()+ "/Key-TID" + std::to_string(number()) ;
I.setName(n);
I.setNonce(interest.getNonce());
I.setInterestLifetime(interest.getInterestLifetime());
I.setMustBeFresh(true);
Reqs[interest.getNonce()].Express_time = steady_clock::now();
a_face.expressInterest(I,
bind(&Tracker::onData, this, _1, _2),
bind(&Tracker::onNack, this, _1, _2),
bind(&Tracker::onTimeout, this, _1));
return;
}
}
void
onData(const Interest& interest, const Data& data)
{
double wait =0;
if (Reqs[interest.getNonce()].p1 == "M"){ // Trace/M/name/Key-Tid/face_id
Reqs[interest.getNonce()].m_reptime[getcomp(interest, 2)]=steady_clock::now();
steady_clock::duration time_span = Reqs[interest.getNonce()].m_reptime[getcomp(interest, 2)] - Reqs[interest.getNonce()].m_exptime[getcomp(interest, 2)];
double nseconds = float(time_span.count()) * steady_clock::period::num / steady_clock::period::den;
std::string temp = std::string(reinterpret_cast<const char*>(data.getContent().value()), data.getContent().value_size());
// Computing wait time for each interest
for(std::map<std::string,steady_clock::time_point>::iterator it=Reqs[interest.getNonce()].m_reptime.begin(); it!=Reqs[interest.getNonce()].m_reptime.end(); ++it){
steady_clock::duration time_span =Reqs[interest.getNonce()].m_reptime[getcomp(interest, 2)]-it->second;;
double nseconds = float(time_span.count()) * steady_clock::period::num / steady_clock::period::den;
if ((nseconds)>wait){
wait = nseconds;
}
}
// delay between receiving the request for the first time and sending each multipath request
steady_clock::duration T =Reqs[interest.getNonce()].m_exptime[getcomp(interest, 2)]- Reqs[interest.getNonce()].First_Arr;
double DelayToSend = float(T.count()) * steady_clock::period::num / steady_clock::period::den;
Reqs[interest.getNonce()].m_reply[getcomp(interest, 2)]=createData(interest, Dname ,nseconds,wait+DelayToSend, temp);
if(Reqs[interest.getNonce()].mhops.size()==Reqs[interest.getNonce()].m_reply.size()){
createmulti(Reqs[interest.getNonce()].m_reply, interest);
}
}else{
Reqs[interest.getNonce()].Reply = std::string(reinterpret_cast<const char*>(data.getContent().value()), data.getContent().value_size());
Reqs[interest.getNonce()].Rep_time = steady_clock::now();
dataprocessing(interest);
}
}
void
dataprocessing(const Interest& interest){
// Delay time
steady_clock::duration time_span = Reqs[interest.getNonce()].Rep_time-Reqs[interest.getNonce()].Express_time;
double elapsedd_secs = double(time_span.count()) * steady_clock::period::num / steady_clock::period::den;
// First overhead time
steady_clock::duration time_span2 = Reqs[interest.getNonce()].Express_time-Reqs[interest.getNonce()].First_Arr;
double extra = double(time_span2.count()) * steady_clock::period::num / steady_clock::period::den;
double d;
d =mean+extra;
std:: string h = Reqs[interest.getNonce()].Reply;
std::string data_x = createData(interest, Dname, elapsedd_secs, d, h);
shared_ptr<Data> data = make_shared<Data>();
Name dataName(Reqs[interest.getNonce()].Oname);
data->setName(dataName);
data->setFreshnessPeriod(time::seconds(10)); // to be adjusted to the parameter in the user
data->setContent(reinterpret_cast<const uint8_t*>(data_x.c_str()), data_x.size());
m_keyChain.sign(*data);
a_face.put(*data);
}
void
onNack(const Interest& interest, const lp::Nack& nack)
{
double wait =0;
if (Reqs[interest.getNonce()].p1 == "M"){
Reqs[interest.getNonce()].m_reptime[getcomp(interest, 2)]=steady_clock::now();
steady_clock::duration time_span = Reqs[interest.getNonce()].m_reptime[getcomp(interest, 2)] - Reqs[interest.getNonce()].m_exptime[getcomp(interest, 2)];
double nseconds = float(time_span.count()) * steady_clock::period::num / steady_clock::period::den;
if ((nack.getReason()== lp::NackReason::PRODUCER_LOCAL)||(nack.getReason()== lp::NackReason::CACHE_LOCAL)){
///// checking wait time
for(std::map<std::string,steady_clock::time_point>::iterator it=Reqs[interest.getNonce()].m_reptime.begin(); it!=Reqs[interest.getNonce()].m_reptime.end(); ++it){
steady_clock::duration time_span =Reqs[interest.getNonce()].m_reptime[getcomp(interest, 2)]-it->second;;
double nseconds = float(time_span.count()) * steady_clock::period::num / steady_clock::period::den;
if ((nseconds)>wait){
wait = nseconds;
}
}
Reqs[interest.getNonce()].m_reply[getcomp(interest, 2)]= createNack(interest,Dname, nseconds, wait);
if(Reqs[interest.getNonce()].mhops.size()==Reqs[interest.getNonce()].m_reply.size()){
createmulti(Reqs[interest.getNonce()].m_reply, interest);
}
}
}else{
if ((nack.getReason()== lp::NackReason::PRODUCER_LOCAL)||(nack.getReason()== lp::NackReason::CACHE_LOCAL)){ // expected nack could alsp be No route / prohibited / not supported ...
Reqs[interest.getNonce()].Rep_time = steady_clock::now();
nackprocessing(interest);
}else{
std::cout << "Other non supported Nacks for now" << interest << std::endl;
return;
}
}
}
void
nackprocessing(const Interest& interest){
// delay time to get a nack (<>>strategy)
steady_clock::duration time_span = Reqs[interest.getNonce()].Rep_time-Reqs[interest.getNonce()].Express_time;
double elapsedn_secs = double(time_span.count()) * steady_clock::period::num / steady_clock::period::den;
// First overhead time
steady_clock::duration time_span2 = Reqs[interest.getNonce()].Express_time-Reqs[interest.getNonce()].First_Arr;
double extra = double(time_span2.count()) * steady_clock::period::num / steady_clock::period::den;
// Create new name, based on Interest's name
Name dataName(Reqs[interest.getNonce()].Oname);
double d = mean+extra;
std::string idsp = createNack(interest, Dname, elapsedn_secs, d);
// Create Data packet
shared_ptr<Data> data = make_shared<Data>();
data->setName(dataName);
data->setFreshnessPeriod(time::seconds(0));
data->setContent(reinterpret_cast<const uint8_t*>(idsp.c_str()), idsp.size());
m_keyChain.sign(*data);
a_face.put(*data);
}
void createmulti(std::map<std::string, std::string> m, const Interest& interest){
shared_ptr<Data> data = make_shared<Data>();
data->setName(Reqs[interest.getNonce()].Oname);
data->setFreshnessPeriod(time::seconds(0));
std::string temp = format(m);
data->setContent(reinterpret_cast<const uint8_t*>(temp.c_str()), temp.size());
m_keyChain.sign(*data);
a_face.put(*data);
}
std::string createData(const Interest& interest, std::string id, double delay, double over, std::string s)
{
rapidjson::Document document;
document.SetObject();
rapidjson::Document::AllocatorType& allocator = document.GetAllocator();
Value i;
char b[100];
int len = sprintf(b, "%s", id.c_str());
i.SetString(b, len, document.GetAllocator());
Value d(delay);
Value o(over);
document.AddMember("Id", i , allocator);
document.AddMember("delay", d, allocator);
Reqs[interest.getNonce()].E = steady_clock::now();
steady_clock::duration time_span2 = Reqs[interest.getNonce()].E - Reqs[interest.getNonce()].Rep_time;
double extra = double(time_span2.count()) * steady_clock::period::num / steady_clock::period::den;
double ov = over+extra;
Value o2(ov);
document.AddMember("overhead", o2, allocator);
rapidjson::Document document2;
if ( document2.Parse<0>( s.c_str() ).HasParseError() ) {
std::cout << "Parsing error" << std::endl;
}else{
assert(document2.IsObject());
document.AddMember("next", document2.GetObject(), allocator);
}
StringBuffer strbuf;
Writer<StringBuffer> writer(strbuf);
document.Accept(writer);
return strbuf.GetString();
}
std::string format(std::map<std::string, std::string> m){
rapidjson::Document document;
document.SetObject();
rapidjson::Value array(rapidjson::kArrayType);
rapidjson::Document::AllocatorType& allocator = document.GetAllocator();
// here
for (std::map<std::string,std::string>::iterator it=m.begin(); it!=m.end(); ++it){
Value v;
Value vid;
Value vdelay;
Value vover;
// Split the string
std::size_t found = it->second.find(",");
std::string tmpstr = it->second.substr (0, found);
std::size_t found2 = tmpstr.find (":");
vid.SetString (tmpstr.substr (found2+2, tmpstr.size () - found2 - 3).c_str (), allocator);
std::size_t found3 = it->second.find (",",found + 1);
tmpstr = it->second.substr (found + 1, found3 - found);
found2 = tmpstr.find (":");
vdelay.SetDouble (std::atof ((tmpstr.substr (found2+1)).c_str ()));
std::size_t found4 = it->second.find (",",found3 + 1);
tmpstr = it->second.substr (found3 + 1, found4 - found3);
found2 = tmpstr.find (":");
vover.SetDouble (std::atof ((tmpstr.substr (found2+1)).c_str ()));
v.SetObject ().AddMember ("Id", vid, allocator).AddMember ("delay", vdelay, allocator).AddMember ("overhead", vover, allocator);
array.PushBack (v, allocator);
}
document.AddMember("next", array, document.GetAllocator());
StringBuffer strbuf;
Writer<StringBuffer> writer(strbuf);
document.Accept(writer);
std::string temp = strbuf.GetString();
//return (reinterpret_cast<const uint8_t*>(temp.c_str()), temp.size());
return temp;
}
void
onTimeout(const Interest& interest)
{
std::cout << "Timeout " << interest << std::endl;
}
std::string createNack(const Interest& interest, std::string id, double delay, double over)
{
rapidjson::Document document;
document.SetObject();
rapidjson::Document::AllocatorType& allocator = document.GetAllocator();
//nfd-id
Value i;
char b[100];
int len = sprintf(b, "%s", id.c_str());
i.SetString(b, len, document.GetAllocator());
//delay
Value d(delay);
document.AddMember("Id", i , allocator);
document.AddMember("delay", d, allocator);
Reqs[interest.getNonce()].E = steady_clock::now();
steady_clock::duration time_span2 = Reqs[interest.getNonce()].E - Reqs[interest.getNonce()].Rep_time;
double extra = double(time_span2.count()) * steady_clock::period::num / steady_clock::period::den;
double ov = over+extra;
Value o(ov);
document.AddMember("overhead", o, allocator);
StringBuffer strbuf;
Writer<StringBuffer> writer(strbuf);
document.Accept(writer);
//std::cout << " Created nack " << strbuf.GetString() << '\n';
return strbuf.GetString();
}
void
query(Controller& controller, const ndn::Name& name, uint32_t nonce, const ndn::nfd::CommandOptions& options = {})
{
parameters param;
param.nonce = nonce;
param.name = name;
controller.fetch<ndn::nfd::FibDataset>([this, param] (const std::vector<ndn::nfd::FibEntry>& result) {
for (size_t prefixLen = param.name.size(); prefixLen > 0; --prefixLen) {
for (const ndn::nfd::FibEntry& item : result) {
if (item.getPrefix().size() == prefixLen && item.getPrefix().isPrefixOf(param.name)) {
Reqs[param.nonce].mhops.clear();
for (const ndn::nfd::NextHopRecord& nh : item.getNextHopRecords()) {
Reqs[param.nonce].mhops.push_back(nh.getFaceId());
};
}
}
}
std::string aa;
// Create N corresponding interests
for(unsigned int i=0; i<Reqs[param.nonce].mhops.size(); i++){
ndn::Interest I;
aa = "Key-TID" + std::to_string(number());
ndn::Name n = "/Trace/M/"+ Reqs[param.nonce].p2 + Reqs[param.nonce].Lname+ "/" + aa + "/" + std::to_string(Reqs[param.nonce].mhops[i]) ; // attaching the face id as x
I.setName(n);
I.setNonce(param.nonce);
I.setInterestLifetime(ndn::time::milliseconds(10000));
I.setMustBeFresh(true);
Reqs[param.nonce].m_exptime[getcomp(I, 2)]=steady_clock::now();
a_face.expressInterest(I,
bind(&Tracker::onData, this, _1, _2),
bind(&Tracker::onNack, this, _1, _2),
bind(&Tracker::onTimeout, this, _1));
}
},
bind([]{ std::cout << "failure\n";}),
options);
}
struct parameters{
ndn::Name name;
uint32_t nonce;
};
// Request Information
struct Quest{
steady_clock::time_point First_Arr;
steady_clock::time_point Express_time;
steady_clock::time_point Rep_time;
steady_clock::time_point E;
steady_clock::time_point Ef;
std::string p1;
std::string p2;
std::string Oname;
std::string Lname;
std::string Reply;
std::vector<uint64_t> mhops; // multipath's possible next hops
std::map<std::string, std::string> m_reply; //multi path replies
std::map<std::string, steady_clock::time_point> m_exptime; //multi path express
std::map<std::string, steady_clock::time_point> m_reptime; //multi path replies
std::map<std::string, double> m_over; //multi path replies
};
// Request Information
struct mprocess{
steady_clock::time_point Express_time;
steady_clock::time_point Rep_time;
double overhead;
std::string Reply;
};
// map to match a request (nonce) with an object of struct
std::map<uint32_t, Quest> Reqs;
Face a_face;
KeyChain m_keyChain;
std::string data_a;
std::string data_d;
std::vector<uint32_t> loop;
steady_clock::time_point Ts;
steady_clock::time_point To;
public:
float estimate(){
Ts = steady_clock::now(); // to estimate name creation and all
shared_ptr<Data> data = make_shared<Data>();
Name n = "/Test";
data->setName(n);
std::string stupid = "Hello Kitty";
data->setFreshnessPeriod(time::seconds(10));
data->setContent(reinterpret_cast<const uint8_t*>(stupid.c_str()), stupid.size());
m_keyChain.sign(*data);
To = steady_clock::now();
steady_clock::duration time_span = To - Ts;
float nseconds = float(time_span.count()) * steady_clock::period::num / steady_clock::period::den;
return nseconds;
}
double
average(){
float sum =0;
for (int i = 0; i <100; i++){
sum = sum +estimate();
}
return sum/100;
}
double mean =0;
std::string Dname;
};
}
}
int
main(int argc, char** argv)
{
std::string Dname;
int c ;
while( ( c = getopt (argc, argv, "n:") ) != -1 )
{
switch(c)
{
case 'n':
Dname = optarg;
break;
}
}
ndn::examples::Tracker track;
track.mean=track.average();
track.Dname = Dname;
try {
track.runp();
}
catch (const std::exception& e) {
std::cerr << "ERROR: " << e.what() << std::endl;
}
return 0;
}