-
Notifications
You must be signed in to change notification settings - Fork 0
/
nexran.cc
1457 lines (1221 loc) · 45.2 KB
/
nexran.cc
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
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include <chrono>
#include <string>
#include "mdclog/mdclog.h"
#include "rmr/RIC_message_types.h"
#include "ricxfcpp/message.hpp"
#include "ricxfcpp/messenger.hpp"
//#include "pistache/string_logger.h"
//#include "pistache/tcp.h"
#include "nexran.h"
#include "e2ap.h"
#include "e2sm.h"
#include "e2sm_nexran.h"
#include "e2sm_kpm.h"
#include "e2sm_zylinium.h"
#include "restserver.h"
//#include "restserver.cc"
using namespace std;
int TX_PKTS=0;
int TOTAL_TX_1=0;
int TOTAL_TX_2=0;
int COUNTER1=0;
int COUNTER2=0;
bool malicious=0;
bool slicecheck=0;
int tx_threshold = 130;
std::string slice1 = "fast";
std::string slice2 = "secure_slice";
std::string ue1imsi = "NULL";
std::string ue2imsi = "NULL";
namespace nexran {
static void rmr_callback(
xapp::Message &msg,int mtype,int subid,int payload_len,
xapp::Msg_component payload,void *data)
{
((App *)data)->handle_rmr_message(
msg,mtype,msg.Get_subid(),payload_len,payload);
}
void App::handle_rmr_message(
xapp::Message &msg,int mtype,int subid,int payload_len,
xapp::Msg_component &payload)
{
mdclog_write(MDCLOG_DEBUG,"RMR message (type %d, source %s)",
mtype,msg.Get_meid().get());
switch (mtype) {
case RIC_SUB_REQ:
case RIC_SUB_RESP:
case RIC_SUB_FAILURE:
case RIC_SUB_DEL_REQ:
case RIC_SUB_DEL_RESP:
case RIC_SUB_DEL_FAILURE:
case RIC_SERVICE_UPDATE:
case RIC_SERVICE_UPDATE_ACK:
case RIC_SERVICE_UPDATE_FAILURE:
case RIC_CONTROL_REQ:
case RIC_CONTROL_ACK:
case RIC_CONTROL_FAILURE:
case RIC_INDICATION:
case RIC_SERVICE_QUERY:
break;
default:
mdclog_write(MDCLOG_WARN,"unsupported RMR message type %d",mtype);
return;
}
e2ap.handle_message(payload.get(),payload_len,subid,
std::string((char *)msg.Get_meid().get()),
std::string((char *)msg.Get_xact().get()));
return;
}
bool App::send_message(const unsigned char *buf,ssize_t buf_len,
int mtype,int subid,const std::string& meid,
const std::string& xid)
{
std::unique_ptr<xapp::Message> msg = Alloc_msg(buf_len);
msg->Set_mtype(mtype);
msg->Set_subid(subid);
msg->Set_len(buf_len);
xapp::Msg_component payload = msg->Get_payload();
memcpy((char *)payload.get(),(char *)buf,
((msg->Get_available_size() < buf_len)
? msg->Get_available_size() : buf_len));
std::shared_ptr<unsigned char> msg_meid((unsigned char *)strdup(meid.c_str()));
msg->Set_meid(msg_meid);
if (!xid.empty()) {
std::shared_ptr<unsigned char> msg_xid((unsigned char *)strdup(xid.c_str()));
msg->Set_xact(msg_xid);
}
return msg->Send();
}
/*
* These handlers work at the App level. The E2AP request tracking
* library stores requests and watches for responses, and by the time
* these handlers are invoked, it has constructed that mapping for us.
* These handlers map request/response pairs to RequestGroups that came
* from the northbound interface.
*/
bool App::handle(e2ap::SubscriptionResponse *resp)
{
mdclog_write(MDCLOG_DEBUG,"nexran SubscriptionResponse handler");
}
bool App::handle(e2ap::SubscriptionFailure *resp)
{
mdclog_write(MDCLOG_DEBUG,"nexran SubscriptionFailure handler");
}
bool App::handle(e2ap::SubscriptionDeleteResponse *resp)
{
mdclog_write(MDCLOG_DEBUG,"nexran SubscriptionDeleteResponse handler");
}
bool App::handle(e2ap::SubscriptionDeleteFailure *resp)
{
mdclog_write(MDCLOG_DEBUG,"nexran SubscriptionDeleteFailure handler");
}
bool App::handle(e2ap::ControlAck *control)
{
mdclog_write(MDCLOG_DEBUG,"nexran ControlAck handler");
}
bool App::handle(e2ap::ControlFailure *control)
{
mdclog_write(MDCLOG_DEBUG,"nexran ControlFailure handler");
}
bool App::handle(e2ap::Indication *ind)
{
bool retval = false;
mdclog_write(MDCLOG_DEBUG,"nexran Indication handler");
if (ind->model) {
e2sm::kpm::KpmIndication *kind;
e2sm::nexran::SliceStatusIndication *nind;
e2sm::zylinium::MaskStatusIndication *zind;
if ((kind = dynamic_cast<e2sm::kpm::KpmIndication *>(ind->model)) != NULL)
retval = handle(kind);
else if ((nind = dynamic_cast<e2sm::nexran::SliceStatusIndication *>(ind->model)) != NULL)
retval = handle(nind);
else if ((zind = dynamic_cast<e2sm::zylinium::MaskStatusIndication *>(ind->model)) != NULL)
retval = handle(zind);
}
delete ind;
return retval;
}
bool App::handle(e2ap::ErrorIndication *ind)
{
mdclog_write(MDCLOG_DEBUG,"nexran ErrorIndication handler");
}
bool App::handle(e2sm::nexran::SliceStatusIndication *ind)
{
mdclog_write(MDCLOG_DEBUG,"nexran SliceStatusIndication handler");
std::string rname;
if (ind->parent && ind->parent->subscription_request != nullptr) {
rname = ind->parent->subscription_request->meid;
mutex.lock();
if (db[ResourceType::NodeBResource].count(rname) > 0) {
NodeB *nodeb = (NodeB *)db[App::ResourceType::NodeBResource][rname];
nodeb->update_last_indication();
}
mutex.unlock();
}
}
/// @brief
/// @param kind
/// @return
bool App::handle(e2sm::kpm::KpmIndication *kind)
{
mdclog_write(MDCLOG_INFO,"KpmIndication: %s",
kind->report->to_string('\n',',').c_str());
e2sm::kpm::KpmReport *report = kind->report;
std::string rname;
if (kind->parent && kind->parent->subscription_request != nullptr) {
rname = kind->parent->subscription_request->meid;
mutex.lock();
if (db[ResourceType::NodeBResource].count(rname) > 0) {
NodeB *nodeb = (NodeB *)db[App::ResourceType::NodeBResource][rname];
nodeb->update_config(report->available_ul_prbs);
nodeb->update_last_indication();
}
mutex.unlock();
}
if (influxdb && (report->slices.size() || report->ues.size())) {
influxdb->batchOf(report->slices.size() + report->ues.size());
for (auto it = report->slices.begin(); it != report->slices.end(); ++it) {
influxdb->write(influxdb::Point{"slice"}
.addField("dl_bytes", (long long int)it->second.dl_bytes)
.addField("ul_bytes", (long long int)it->second.ul_bytes)
.addField("dl_prbs", (long long int)it->second.dl_prbs)
.addField("ul_prbs", (long long int)it->second.ul_prbs)
.addField("tx_pkts", (long long int)it->second.tx_pkts)
.addField("tx_errors", (long long int)it->second.tx_errors)
.addField("tx_brate", (long long int)it->second.tx_brate)
.addField("rx_pkts", (long long int)it->second.rx_pkts)
.addField("rx_errors", (long long int)it->second.rx_errors)
.addField("rx_brate", (long long int)it->second.rx_brate)
.addField("dl_cqi", it->second.dl_cqi)
.addField("dl_ri", it->second.dl_ri)
.addField("dl_pmi", it->second.dl_pmi)
.addField("ul_phr", it->second.ul_phr)
.addField("ul_sinr", it->second.ul_sinr)
.addField("ul_mcs", it->second.ul_mcs)
.addField("ul_samples", (long long int)it->second.ul_samples)
.addField("dl_mcs", it->second.dl_mcs)
.addField("dl_samples", (long long int)it->second.dl_samples)
.addTag("slice", it->first.c_str())
.addTag("nodeb", rname.c_str()));
}
for (auto it = report->ues.begin(); it != report->ues.end(); ++it) {
influxdb->write(influxdb::Point{"ue"}
.addField("dl_bytes", (long long int)it->second.dl_bytes)
.addField("ul_bytes", (long long int)it->second.ul_bytes)
.addField("dl_prbs", (long long int)it->second.dl_prbs)
.addField("ul_prbs", (long long int)it->second.ul_prbs)
.addField("tx_pkts", (long long int)it->second.tx_pkts)
.addField("tx_errors", (long long int)it->second.tx_errors)
.addField("tx_brate", (long long int)it->second.tx_brate)
.addField("rx_pkts", (long long int)it->second.rx_pkts)
.addField("rx_errors", (long long int)it->second.rx_errors)
.addField("rx_brate", (long long int)it->second.rx_brate)
.addField("dl_cqi", it->second.dl_cqi)
.addField("dl_ri", it->second.dl_ri)
.addField("dl_pmi", it->second.dl_pmi)
.addField("ul_phr", it->second.ul_phr)
.addField("ul_sinr", it->second.ul_sinr)
.addField("ul_mcs", it->second.ul_mcs)
.addField("ul_samples", (long long int)it->second.ul_samples)
.addField("dl_mcs", it->second.dl_mcs)
.addField("dl_samples", (long long int)it->second.dl_samples)
.addTag("ue", std::to_string(it->first).c_str())
.addTag("nodeb", rname.c_str()));
}
try {
influxdb->flushBatch();
}
catch (...) {
mdclog_write(MDCLOG_ERR,"failed to write KPM points to influxdb");
}
}
// If we don't have BW reports for all slices, do not modify proportions?
// Add up all slice dl_bytes, get proportions
// map those to share proportions
// figure out the delta for each slice to equalize
// 10, 5, 10 // 512, 512, 512
// new target: (25/3)=8.333... for each
// 25/3-10=-1.667, 25/3-5=3.333, 25/3-10=-1.667
// -1.667/10 == -16.67% (apply that to current share, so remove 16.67%
// of its share, and so on)
// new shares: 512+(512*-.1667) = 426
// 512+(512*.6667) = 853
// 512+(512*-.1667) = 426
// If all share factors are within 5%, make no changes.
// ugh, this is also assuming a single nodeb, because our slice
// share policy is global, not per nodeb
// but -- we could also keep a per-nodeb specialization :-D
// maybe hide it from user, who knows
if (report->slices.size() == 0) {
mdclog_write(MDCLOG_DEBUG,"no slices in KPM report; not autoequalizing");
if (mdclog_level_get() == MDCLOG_DEBUG) {
mutex.lock();
std::stringstream ss;
for (auto it = db[ResourceType::SliceResource].begin();
it != db[ResourceType::SliceResource].end();
++it) {
Slice *slice = (Slice *)it->second;
if (dynamic_cast<ProportionalAllocationPolicy *>(slice->getPolicy()) == NULL)
continue;
ProportionalAllocationPolicy *policy = \
dynamic_cast<ProportionalAllocationPolicy *>(slice->getPolicy());
if (false && !policy->isAutoEqualized())
continue;
ss << it->first << "[share=" << policy->getShare() << "]" << std::endl;
}
mutex.unlock();
mdclog_write(MDCLOG_DEBUG,"current shares: %s",ss.str().c_str());
}
return true;
}
// Have to lock at this point; we're going to iterate over
// and possibly adjust the slice proportions.
mutex.lock();
// Index some stuff locally for easier iteration; save share modification factors.
std::map<std::string,Slice *> slices;
std::map<std::string,Slice *> report_slices;
std::map<std::string,ProportionalAllocationPolicy *> policies;
std::map<std::string,float> new_share_factors;
//std::map<std::string,int> new_shares;
uint64_t slices_total = 0;
uint64_t slices_prb_total = 0;
// Create local indexes.
for (auto it = db[ResourceType::SliceResource].begin(); it != db[ResourceType::SliceResource].end(); ++it) {
std::string slice_name = it->first;
Slice *slice = (Slice *)it->second;
ProportionalAllocationPolicy *policy = \
dynamic_cast<ProportionalAllocationPolicy *>(slice->getPolicy());
if (!policy)
continue;
//if the policy is false or null, the loop iteration is skipped using continue.
//Otherwise, the slice, policy, and new_share_factors values are assigned to their respective maps for further processing.
slices[slice_name] = slice;
policies[slice_name] = policy;
// placeholder until later iteration
new_share_factors[slice_name] = 0.0f;
}
int num_autoeq_slices = 0;
for (auto it = report->slices.begin(); it != report->slices.end(); ++it) {
std::string slice_name = it->first;
// If this is not a slice we know of, ignore.
if (slices.count(slice_name) == 0)
continue;
Slice *slice = (Slice *)slices[slice_name];
ProportionalAllocationPolicy *policy = \
dynamic_cast<ProportionalAllocationPolicy *>(slice->getPolicy());
if (!policy)
continue;
report_slices[slice_name] = slice;
// NB: only auto-eq amongst metrics for auto-eq'd slices.
// XXX: is this right?
if (policy->isAutoEqualized()) {
slices_total += it->second.dl_bytes;
slices_prb_total += it->second.dl_prbs;
++num_autoeq_slices;
}
policy->getMetrics().add(it->second);
}
// First, check if any slices should be released from throttling.
for (auto it = slices.begin(); it != slices.end(); ++it) {
std::string slice_name = it->first;
Slice *slice = (Slice *)it->second;
ProportionalAllocationPolicy *policy = policies[slice_name];
if (!policy->isThrottled() || !policy->isThrottling())
continue;
// Ensure we flush old metrics, even if we didn't add any new ones
// from the current report.
policy->getMetrics().flush();
int new_share = policy->maybeEndThrottling();
if (new_share > -1) {
mdclog_write(MDCLOG_DEBUG,"stopping throttling slice '%s' (%d -> %d)",
slice_name.c_str(),policy->getShare(),new_share);
// NB: we just compute a share factor, because that's what the
// auto-equalizing code cares about.
// nshare = cshare + (cshare * f)
// n - c = c * f
// (n - c) / c = f
// 110 = 100 + 100 * .1
// (110 - 100) / 100 = f
int cur_share = policy->getShare();
new_share_factors[slice_name] = (new_share - cur_share) / (float)cur_share;
}
else {
new_share = policy->maybeUpdateThrottling();
if (new_share > -1 && new_share != policy->getShare()) {
int cur_share = policy->getShare();
new_share_factors[slice_name] = (new_share - cur_share) / (float)cur_share;
}
}
}
// Second, check if any slices should be newly throttled.
for (auto it = slices.begin(); it != slices.end(); ++it) {
std::string slice_name = it->first;
Slice *slice = (Slice *)it->second;
ProportionalAllocationPolicy *policy = policies[slice_name];
if (!policy->isThrottled() || policy->isThrottling())
continue;
// Ensure we flush old metrics, even if we didn't add any new ones
// from the current report.
e2sm::kpm::MetricsIndex& metrics = policy->getMetrics();
mdclog_write(MDCLOG_DEBUG,"considering throttle start for slice '%s': %ld (%d)",
slice_name.c_str(),metrics.get_total_bytes(),metrics.size());
metrics.flush();
mdclog_write(MDCLOG_DEBUG,"considering throttle start for slice '%s': %ld (%d) (post flush)",
slice_name.c_str(),metrics.get_total_bytes(),metrics.size());
int new_share = policy->maybeStartThrottling();
if (new_share > -1) {
mdclog_write(MDCLOG_DEBUG,"starting throttling slice '%s' (%d -> %d)",
slice_name.c_str(),policy->getShare(),new_share);
// NB: we just compute a share factor, because that's what the
// auto-equalizing code cares about.
int cur_share = policy->getShare();
new_share_factors[slice_name] = (new_share - cur_share) / (float)cur_share;
}
}
// Begin auto-equalize checks.
bool any_above_threshold = false;
uint64_t available_prbs_per_slice = 0;
if (num_autoeq_slices > 0)
available_prbs_per_slice = (report->period_ms * 2 * report->available_dl_prbs) / num_autoeq_slices;
uint64_t prb_threshold = (uint64_t)(0.15f * available_prbs_per_slice);
if (available_prbs_per_slice > 0) {
// Check PRB utilization. If no slice has utilized at least 15% of an
// even PRB allocation, do nothing.
for (auto it = report_slices.begin(); it != report_slices.end(); ++it) {
std::string slice_name = it->first;
uint64_t dl_prbs = report->slices[slice_name].dl_prbs;
if (dl_prbs > prb_threshold) {
any_above_threshold = true;
break;
}
}
}
// Create the new share factors.
if (any_above_threshold) {
mdclog_write(MDCLOG_INFO,"PRB utilization threshold (%lu/%lu) reached; checking for new share factors",
prb_threshold,available_prbs_per_slice);
any_above_threshold = false;
for (auto it = report_slices.begin(); it != report_slices.end(); ++it) {
std::string slice_name = it->first;
uint64_t dl_bytes = report->slices[slice_name].dl_bytes;
ProportionalAllocationPolicy *policy = policies[slice_name];
if (!policy->isAutoEqualized()) {
mdclog_write(MDCLOG_DEBUG,"skipping slice '%s'; not autoequalized",
slice_name.c_str());
continue;
}
if (new_share_factors[slice_name] != 0.0f) {
mdclog_write(MDCLOG_DEBUG,"skipping slice '%s' with existing new_share_factor %f",
slice_name.c_str(),new_share_factors[slice_name]);
continue;
}
float nf = ((float)slices_total / num_autoeq_slices - dl_bytes) / dl_bytes;
if (nf > 0.05f || nf < -0.05f) {
any_above_threshold = true;
mdclog_write(MDCLOG_DEBUG,"candidate proportional share factor above threshold (%s): %f",
slice_name.c_str(),nf);
}
else
mdclog_write(MDCLOG_DEBUG,"candidate proportional share factor below threshold (%s): %f",
slice_name.c_str(),nf);
}
}
// XXX: have to do a second time through the loop to actually set the
// new share factors, sigh
//int tx_pkts=0;
//int total_tx_pkts=0;
if (any_above_threshold) {
for (auto it = report->slices.begin(); it != report->slices.end(); ++it) {
std::string slice_name = it->first;
uint64_t dl_bytes = report->slices[slice_name].dl_bytes;
if (policies.count(slice_name) == 0)
continue;
ProportionalAllocationPolicy *policy = policies[slice_name];
if (!policy->isAutoEqualized())
continue;
if (new_share_factors[slice_name] != 0.0f)
continue;
new_share_factors[slice_name] = ((float)slices_total / num_autoeq_slices - dl_bytes) / dl_bytes;
mdclog_write(MDCLOG_DEBUG,"new proportional share factor (%s): %f",
slice_name.c_str(),new_share_factors[slice_name]);
}
}
//hsdbhbdfhjhbdgufhdjhjfsdhoiugjfidsjgoijsdfijgi
//jkdsngjdfkgjfdskjgsd
//djgjdfhjgkfdskgkdjsgk
//dkjsnhgjdhufshsgusfdjg
//kjdfkgsjfkgsdfkljfg
//sdkgjfsdhjakhjks
//fdjhsjghfdgjksdfkg
//dsfjgjkdfshg sdjg
//fsdkjgksdfkgfdg
for (auto it = report->ues.begin(); it != report->ues.end(); ++it) {
int ue_name = it->first;
mdclog_write(MDCLOG_INFO,"UE NAME '%d':",ue_name);
if(ue_name==70)
{
//total the tx pkts for ue1
TOTAL_TX_1 = TOTAL_TX_1+ report->ues[ue_name].tx_pkts;
mdclog_write(MDCLOG_INFO, "Total tx_pkts '%d': %d",
ue_name, TOTAL_TX_1);
COUNTER1++;
mdclog_write(MDCLOG_INFO,"COUNT: %d",
COUNTER1);
}
else if(ue_name==71)
{
TOTAL_TX_2 = TOTAL_TX_2 + report->ues[ue_name].tx_pkts;
mdclog_write(MDCLOG_INFO, "Total tx_pkts '%d': %d",
ue_name, TOTAL_TX_2);
COUNTER2++;
mdclog_write(MDCLOG_INFO,"COUNT: %d",
COUNTER2);
}
if(COUNTER1 == 10 || COUNTER2 == 10){
if (TOTAL_TX_1 > TOTAL_TX_2)
{
ue1imsi = "001010123456789";
ue2imsi = "001010123456780";
}
else
{
ue1imsi = "001010123456780";
ue2imsi = "001010123456789";
}
if (COUNTER1 == 10)
{
float avg_tx_1=TOTAL_TX_1/10;
mdclog_write(MDCLOG_INFO,"Avg tx_pkts '%d': %f",
ue_name, avg_tx_1);
if(avg_tx_1 >= tx_threshold){
tx_threshold *= 10;
mdclog_write(MDCLOG_DEBUG, "UE1 imsi: %s", ue1imsi.c_str());
mdclog_write(MDCLOG_DEBUG, "UE2 imsi: %s", ue2imsi.c_str());
mdclog_write(MDCLOG_DEBUG,"UE[%d] found MALICIOUS",
ue_name);
AppError *ae = nullptr;
//delete slicing binding to UE
//need imsi and what slice the UE is bound to.
mdclog_write(MDCLOG_DEBUG,"UNBINDING START");
mutex.unlock();
unbind_ue_slice(ue1imsi,slice1,&ae);
mutex.lock();
mdclog_write(MDCLOG_DEBUG,"UNBINDING SUCCESS");
/*
mutex.unlock();
del(App::ResourceType::UeResource, ue1imsi, &ae);
mutex.lock(); */
/*rapidjson::Document d;
d.Parse(request.body().c_str());
string writer == "imsi\":\"001010123456789\",\"tmsi\":\"\",\"crnti\":\"\",\"status\":{\"connected\":false}"
Ue *ue = Ue::create(d,&ae); */
//mutex.unlock();
/*
// Create a JSON object that represents the UE.
rapidjson::Document d;
d.SetObject();
d.AddMember("imsi", rapidjson::Value().SetString("001010123456789"), d.GetAllocator()); */
// Call the postUE() method.
//server.postUe(d, &ae);
//add(App::ResourceType::UeResource,ue,writer,&ae);
//mutex.lock();
//slice create does not have a non REST way to create slices. For now just use curl to create an initial malicious slice
// Create a response object.
/*
Pistache::Http::ResponseWriter response;
server.postUe(d, response);
// Check the response code.
if (response.status() != Pistache::Http::Code::OK)
{ std::cerr << "Error: " << response.status() << std::endl; return 1; }
// Check the response body.
const std::string& body = response.body();
if (body != "UE created successfully.")
{ std::cerr << "Error: unexpected response body: " << body << std::endl; return 1; }
*/
mdclog_write(MDCLOG_DEBUG,"BINDING START");
//bind to malicious UE to secure slice
mutex.unlock();
bind_ue_slice(ue1imsi,slice2,&ae);
mutex.lock();
mdclog_write(MDCLOG_DEBUG,"BINDING SUCCESS");
//print something here telling us wht happened
}
TOTAL_TX_1 = 0;
COUNTER1 = 0;
}
else if(COUNTER2 == 10)
{
float avg_tx_2=TOTAL_TX_2/10;
mdclog_write(MDCLOG_INFO,"Avg tx_pkts '%d': %f",
ue_name, avg_tx_2);
if(avg_tx_2 >= tx_threshold)
{
tx_threshold *= 10;
mdclog_write(MDCLOG_DEBUG, "UE1 imsi: %s", ue1imsi.c_str());
mdclog_write(MDCLOG_DEBUG, "UE2 imsi: %s", ue2imsi.c_str());
mdclog_write(MDCLOG_DEBUG,"UE[%d] found MALICIOUS",
ue_name);
//slice_name.c_str(),new_share_factors[slice_name]);
AppError *ae = nullptr;
//delete slicing binding to UE
//need imsi and what slice the UE is bound to.
mdclog_write(MDCLOG_DEBUG,"UNBINDING START");
mutex.unlock();
unbind_ue_slice(ue2imsi,slice1,&ae);
mutex.lock();
mdclog_write(MDCLOG_DEBUG,"UNBINDING SUCCESS");
//slice create does not have a non REST way to create slices. For now just use curl to create an initial malicious slice
//create secure slice
// string x="MALICIOUS";
// d=x.c_str();
// Slice *slice = Slice::create(d,&ae);
mdclog_write(MDCLOG_DEBUG,"BINDING START");
//bind to malicious UE to secure slice
mutex.unlock();
bind_ue_slice(ue2imsi,slice2,&ae);
mutex.lock();
mdclog_write(MDCLOG_DEBUG,"BINDING SUCCESS");
//print something here
}
TOTAL_TX_2 = 0;
COUNTER2 = 0;
}
}
}
// Handle any updates; log either way.
for (auto it = new_share_factors.begin(); it != new_share_factors.end(); ++it) {
std::string slice_name = it->first;
// Update the policies and push out control messages to bound
// nodebs.
Slice *slice = slices[slice_name];
ProportionalAllocationPolicy *policy = policies[slice_name];
int cshare = policy->getShare();
int nshare = std::min((int)(cshare + (cshare * it->second)),1024);
if (nshare < 1 || nshare < 64)
{
//nshare = 1;
nshare = 64;
}
if (influxdb) {
influxdb->write(influxdb::Point{"share"}
.addField("share", nshare)
.addTag("slice", slice_name.c_str()));
}
policy->setShare(nshare);
if (cshare == nshare) {
mdclog_write(MDCLOG_INFO,"slice '%s' share unchanged: %d",
slice_name.c_str(),nshare);
continue;
}
mdclog_write(MDCLOG_INFO,"slice '%s' share: %d -> %d",
slice_name.c_str(),cshare,nshare);
e2sm::nexran::ProportionalAllocationPolicy *npolicy = \
new e2sm::nexran::ProportionalAllocationPolicy(nshare);
e2sm::nexran::SliceConfig *sc = new e2sm::nexran::SliceConfig(slice_name,npolicy);
e2sm::nexran::SliceConfigRequest *sreq = new e2sm::nexran::SliceConfigRequest(nexran,sc);
sreq->encode();
for (auto it2 = db[ResourceType::NodeBResource].begin();
it2 != db[ResourceType::NodeBResource].end();
++it2) {
NodeB *nodeb = (NodeB *)it2->second;
if (!nodeb->is_slice_bound(slice_name))
continue;
// Each request needs a different RequestId, so we have to
// re-encode each time.
std::shared_ptr<e2ap::ControlRequest> creq = std::make_shared<e2ap::ControlRequest>(
e2ap.get_requestor_id(),e2ap.get_next_instance_id(),
1,sreq,e2ap::CONTROL_REQUEST_ACK);
creq->set_meid(nodeb->getName());
e2ap.send_control_request(creq,nodeb->getName());
}
}
mutex.unlock();
return true;
}
bool App::handle(e2sm::zylinium::MaskStatusIndication *ind)
{
mdclog_write(MDCLOG_INFO,"MaskStatusIndication: %s",
ind->report->to_string('\n',',').c_str());
std::string rname;
int total_prbs = -1;
if (ind->parent && ind->parent->subscription_request != nullptr) {
mutex.lock();
rname = ind->parent->subscription_request->meid;
if (db[ResourceType::NodeBResource].count(rname) > 0) {
NodeB *nodeb = (NodeB *)db[App::ResourceType::NodeBResource][rname];
nodeb->update_mask_from_status(ind->report);
nodeb->update_last_indication();
total_prbs = nodeb->get_total_prbs();
}
mutex.unlock();
}
if (influxdb && total_prbs > 0) {
int dl_masked_bits = ind->report->dl_mask.get_masked_bit_count(total_prbs);
int ul_masked_bits = ind->report->ul_mask.get_masked_bit_count(total_prbs);
int dl_available_bits = ind->report->dl_mask.get_available_bit_count(total_prbs);
int ul_available_bits = ind->report->ul_mask.get_available_bit_count(total_prbs);
influxdb->write(influxdb::Point{"masks"}
.addField("dl_masked_bits", (long long int)dl_masked_bits)
.addField("ul_masked_bits", (long long int)ul_masked_bits)
.addField("dl_available_bits", (long long int)dl_available_bits)
.addField("ul_available_bits", (long long int)ul_available_bits)
.addTag("nodeb", rname.c_str()));
}
return true;
}
void App::response_handler()
{
std::unique_lock<std::mutex> lock(mutex);
while (!should_stop) {
if (cv.wait_for(lock,std::chrono::seconds(1)) == std::cv_status::timeout)
continue;
for (auto it = request_groups.begin(); it != request_groups.end(); ++it) {
int succeeded = 0,failed = 0,pending = 0;
RequestGroup *group = *it;
if (group->is_done(&succeeded,&failed,&pending)
|| group->is_expired()) {
std::shared_ptr<RequestContext> ctx = group->get_ctx();
Pistache::Http::ResponseWriter& response = ctx->get_response();
if (pending)
response.send(static_cast<Pistache::Http::Code>(504));
else if (failed)
response.send(static_cast<Pistache::Http::Code>(502));
else
response.send(static_cast<Pistache::Http::Code>(200));
request_groups.erase(it);
}
}
lock.unlock();
cv.notify_one();
}
}
void App::init()
{
db[ResourceType::SliceResource][std::string("default")] = new Slice("default");
}
void App::start()
{
if (running)
return;
should_stop = false;
/*
* Init the E2. Note there is nothing to do until we are configured
* via northbound interface with objects. Eventually we should
* store config in the RNIB and restore things on startup, possibly.
*/
e2ap.init();
Add_msg_cb(RIC_SUB_RESP,rmr_callback,this);
Add_msg_cb(RIC_SUB_FAILURE,rmr_callback,this);
Add_msg_cb(RIC_SUB_DEL_RESP,rmr_callback,this);
Add_msg_cb(RIC_SUB_DEL_FAILURE,rmr_callback,this);
Add_msg_cb(RIC_CONTROL_ACK,rmr_callback,this);
Add_msg_cb(RIC_CONTROL_FAILURE,rmr_callback,this);
Add_msg_cb(RIC_INDICATION,rmr_callback,this);
rmr_thread = new std::thread(&App::Listen,this);
response_thread = new std::thread(&App::response_handler,this);
/*
* Init and start the northbound interface.
* NB: the RMR Messenger superclass is already running at this point.
*/
server.init(this);
server.start();
running = true;
}
void App::stop()
{
/* Stop the northbound interface. */
server.stop();
/* Stop the RMR Messenger superclass. */
Stop();
should_stop = true;
rmr_thread->join();
delete rmr_thread;
rmr_thread = NULL;
response_thread->join();
delete response_thread;
response_thread = NULL;
running = false;
}
void App::serialize(ResourceType rt,
rapidjson::Writer<rapidjson::StringBuffer>& writer)
{
const char *label;
mutex.lock();
writer.StartObject();
writer.String(rtype_to_label_plural[rt]);
writer.StartArray();
for (auto it = db[rt].begin(); it != db[rt].end(); ++it)
it->second->serialize(writer);
writer.EndArray();
writer.EndObject();
mutex.unlock();
}
bool App::serialize(ResourceType rt,std::string& rname,
rapidjson::Writer<rapidjson::StringBuffer>& writer,
AppError **ae)
{
mutex.lock();
if (db[rt].count(rname) < 1) {
mutex.unlock();
if (ae) {
if (*ae == NULL)
*ae = new AppError(404);
(*ae)->add(std::string(rtype_to_label[rt])
+ std::string(" does not exist"));
}
return false;
}
db[rt][rname]->serialize(writer);
mutex.unlock();
return true;
}
bool App::add(ResourceType rt,AbstractResource *resource,
rapidjson::Writer<rapidjson::StringBuffer>& writer,
AppError **ae)
{
std::string& rname = resource->getName();
mutex.lock();
if (db[rt].count(rname) > 0) {
if (ae) {
if (*ae == NULL)
*ae = new AppError(403);
(*ae)->add(std::string(rtype_to_label[rt])
+ std::string(" already exists"));
}
mutex.unlock();
return false;
}
db[rt][rname] = resource;
resource->serialize(writer);
mutex.unlock();
if (rt == App::ResourceType::NodeBResource) {
NodeB *nodeb = (NodeB *)resource;
/*
e2sm::nexran::EventTrigger *trigger = \
new e2sm::nexran::EventTrigger(nexran,1000);
std::list<e2ap::Action *> actions;
actions.push_back(new e2ap::Action(1,e2ap::ACTION_REPORT,NULL,-1));
std::shared_ptr<e2ap::SubscriptionRequest> req = \
std::make_shared<e2ap::SubscriptionRequest>(
e2ap.get_requestor_id(),e2ap.get_next_instance_id(),
1,trigger,actions);
req->set_meid(rname);
e2ap.send_subscription_request(req,rname);
*/
e2sm::nexran::SliceStatusRequest *sreq = \
new e2sm::nexran::SliceStatusRequest(nexran);
std::shared_ptr<e2ap::ControlRequest> creq = std::make_shared<e2ap::ControlRequest>(
e2ap.get_requestor_id(),e2ap.get_next_instance_id(),
1,sreq,e2ap::CONTROL_REQUEST_ACK);
creq->set_meid(rname);
e2ap.send_control_request(creq,rname);
e2sm::kpm::EventTrigger *trigger = \
new e2sm::kpm::EventTrigger(kpm,app_config.kpm_interval_index);
std::list<e2ap::Action *> actions;
actions.push_back(new e2ap::Action(1,e2ap::ACTION_REPORT,NULL,-1));
std::shared_ptr<e2ap::SubscriptionRequest> req = \
std::make_shared<e2ap::SubscriptionRequest>(
e2ap.get_requestor_id(),e2ap.get_next_instance_id(),
0,trigger,actions);
req->set_meid(rname);
e2ap.send_subscription_request(req,rname);
e2sm::zylinium::MaskStatusRequest *msreq = \
new e2sm::zylinium::MaskStatusRequest(zylinium);
std::shared_ptr<e2ap::ControlRequest> mscreq = std::make_shared<e2ap::ControlRequest>(
e2ap.get_requestor_id(),e2ap.get_next_instance_id(),
2,msreq,e2ap::CONTROL_REQUEST_ACK);
mscreq->set_meid(rname);
e2ap.send_control_request(mscreq,rname);
e2sm::zylinium::EventTrigger *ztrigger = \
new e2sm::zylinium::EventTrigger(zylinium);
std::list<e2ap::Action *> zactions;
zactions.push_back(new e2ap::Action(1,e2ap::ACTION_REPORT,NULL,-1));
std::shared_ptr<e2ap::SubscriptionRequest> zreq = \
std::make_shared<e2ap::SubscriptionRequest>(
e2ap.get_requestor_id(),e2ap.get_next_instance_id(),
2,ztrigger,zactions);
zreq->set_meid(rname);
e2ap.send_subscription_request(zreq,rname);
e2sm::zylinium::MaskConfigRequest *mcreq = \
nodeb->make_mask_config_request(zylinium);
std::shared_ptr<e2ap::ControlRequest> mccreq = std::make_shared<e2ap::ControlRequest>(
e2ap.get_requestor_id(),e2ap.get_next_instance_id(),
2,mcreq,e2ap::CONTROL_REQUEST_ACK);