-
Notifications
You must be signed in to change notification settings - Fork 0
/
NetMan.cpp
12620 lines (11114 loc) · 439 KB
/
NetMan.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
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
#pragma warning(disable: 4786)
#pragma warning(disable: 4018)
#include <assert.h>
#include <vector>
#include <algorithm>
#include <ctime>
#include "OchInc.h"
#include "OchObject.h"
#include "MappedLinkList.h"
#include "AbsPath.h"
#include "AbstractGraph.h"
#include "OXCNode.h"
#include "AbstractPath.h"
#include "UniFiber.h"
#include "WDMNetwork.h"
#include "TopoReader.h"
#include "SimplexLink.h"
#include "Vertex.h"
#include "Graph.h"
#include "Connection.h"
#include "ConnectionDB.h"
#include "Lightpath.h"
#include "Lightpath_Seg.h"
#include "LightpathDB.h"
#include "Circuit.h"
#include "EventList.h"
#include "Event.h"
#include "Log.h"
#include "NetMan.h"
#include "Channel.h"
#include "OchMemDebug.h"
#include "ConstDef.h"
#include "BinaryHeap.h"
#include "OXCNode.h"
#include "VNF.h"
#include "ServiceChain.h"
//#define DEBUGMASSIMO
//#define Con_Prov
//#define DEBUG_FABIO
#ifdef _DEBUG
#define new DEBUG_NEW
#undef THIS_FILE
static char THIS_FILE[] = __FILE__;
#endif
extern bool dbgactive;
using namespace NS_OCH;
//-B: constructor sets specific parameters
NetMan::NetMan(): m_dTxThreshold(1.0), m_nNumberOfPaths(1), m_hCostSlack(0),
m_bWithOptimization(false),pc(0),bc(0),fc(0),bothc(0),pcPer(0),bcPer(0),fcPer(0),bothcPer(0),pcTot(0),bcTot(0),fcTot(0),bothcTot(0),n(0),
NumNAT(0),NumFW(0),NumTM(0),NumWOC(0),NumIDPS(0),NumVOC(0),m_NumPVNF(0),VNFCounter(0),m_NumActVNF(0)
{
p_block = new Sstat(); // Add by ANDREA
stop_perc = 5.0; // Add by ANDREA
conf = 0.95; // Add by ANDREA
isLinkDisjointActive=true; //FABIO
pathTotCost=0;
}
NetMan::~NetMan()
{
}
//-B: method to print stats: mean, variance, stdDev, Error (= confidence percentage error -> margin of error)
// -> taken from the Stat object referenced by p_block
// (p_block is an attribute of 'this' object, that is a NetMan class object)
void NetMan::printStat(ostream& out) const{
cout << endl << "\n-> printStat" << endl;
this->p_block->StatLog(this->p_block, conf, "BLOCKING PROB", out);
cout << "---------------ESCO printStat---------------" << endl;
}
//-B: update stats about blocking prob and conflict's stats
// if a true value is returned for okstat var the while cycle (in the run method of Simulator class) stops
// Add by Andrea
bool NetMan::updateStat(UINT connection, UINT nRunConnections) {
double block = m_runLog.m_nBlockedCon; //FABIO ANDREA
double prov = m_runLog.m_nProvisionedCon;
double lat =m_runLog.m_Latency_Violated;
bool okstat = false;
//*p_block += (double)(block/prov);
//LA:commented to replace with latency
//*p_block += (double)(block/nRunConnections); //-B: since stats are computed every N_RUN_CONNECTIONS (m_nRunConnections is set in Simulator class)
*p_block += (double)(lat/nRunConnections);
n++; //-B: num of times stats are updated???
//-B: update conflict count
pcTot += pc;
fcTot += fc;
bcTot += bc;
bothcTot += bothc;
//-B: update conflict stats
pcPer = pcTot / 100 / n;
bcPer = bcTot / 100 / n;
fcPer = fcTot / 100 / n;
bothcPer = bothcTot / 100 / n;
//-B: reset temporary stat values
pc = 0; bc = 0; fc = 0; bothc = 0;
//*wl_num += (double)m_runLog.m_dSumLinkLoad; // #link*192
//*tx_num += (double)m_runLog.m_dSumTxLoad; // #tx
//-B: useless switch?!
switch (m_eStatActive){
case PBLOCK:
{ //ALMENO 300000 connessioni..
//cout << endl << "******************* IS CONFIDENCE SATISFIED???" << endl;
if((p_block->isconfsatisfied(stop_perc , conf) == true /*&& (connection >= 300000)*/) || (p_block->mean() == 0.0 && (connection) == 1000000)) //tolto per evitare che una volta raggiunta la confidenza si fermi la simulazione
{
connReached = connection;
okstat = true;
//cout << "******************************* CONFIDENZA SODDISFATTA!!! Premi invio" << endl << endl;
//cin.get();
}
break;
}
default:
DEFAULT_SWITCH;
}
return okstat; //-B: read comments above about the value returned
}
//-B: it should print NetMan object status (useful for debugging purpose; to be tried)
// it also dump LightpathDB and Graph objects (ConnectionDB.dump and WDMNet.dump were commented)
void NetMan::dump(ostream& out)
{
//-B: per il dump del WDMNetwork object è stata fatta una funzione a parte
// m_hWDMNet.dump(out);
// out<<endl;
#ifdef DEBUGB
out << "\n-> NetMan DUMP" << endl;
#endif // DEBUGB
//out<<"- NetMan @ "<<(void*)this<<':'<<endl;
out << " \t#OfPaths in Yen's algorithm = " << m_nNumberOfPaths; //-B: it simply is the num of k shortest paths to be computed in the Yen's algorithm
out << " | conf: " << conf
<< " | TxReq per lp: " << m_nTxReqPerLightpath
<< " | Time policy: " << m_nTimePolicy;
out<<" | ProvisionType = ";
char *pProvisionType;
switch (m_eProvisionType)
{
case PT_SEG_SP_NO_HOP:
pProvisionType = "SEG_NO_HOP";
break;
case PT_SEG_SP_L_NO_HOP:
pProvisionType = "SEG_L_NO_HOP";
break;
case PT_SEG_SPP:
pProvisionType = "SEG_SPP";
break;
case PT_SEG_SP_B_HOP:
pProvisionType = "SEG_B_HOP";
case PT_wpSEG_SPP:
pProvisionType = "wpSEG_SPP";
break;
case PT_wpPAL_DPP:
pProvisionType = "DED wp";
break;
case PT_PAL_DPP:
pProvisionType = "DED ";
break;
case PT_wpUNPROTECTED:
pProvisionType = "UNPR wp";
break;
case PT_UNPROTECTED_GREEN:
pProvisionType = "UNPR GREEN";
break;
case PT_BBU:
pProvisionType = "BBU_HOTEL";
break;
case PT_DVNF:
pProvisionType = "Dynamic_VNF";
break;
default:
DEFAULT_SWITCH;
}
out << pProvisionType;
out << " | GroomingPolicy: " << m_eGroomingPolicy;
out << endl;
//cin.get();
//-B: CONNECTIONDB DUMP
m_hConnectionDB.dump(out);
out<<endl;
//-B: LIGHTPATHDB DUMP
m_hLightpathDB.dump(out);
out<<endl;
////-B: WDMNet DUMP
//if (pProvisionType = "BBU_HOTEL")
//{
// m_hWDMNet.BBU_WDMNetdump(out);
// this->simplexLinkDump();
//}
//else
// m_hWDMNet.dump(out);
///////////////////////////////////////////-B: WDM network -> Graph Simplex Link dump
#ifdef DEBUGB
//cout << "\n-> 'simplexLinkDump'" << endl;
#endif // DEBUGB
this->linkCapacityDump();
//////////////////////////////////////////////
//out << endl;
//out << -> WDMNetPast DUMP" << endl;
//m_hWDMNetPast.dump(out);
//cin.get();
//out << endl;
//-B: GRAPH DUMP (too long)
//m_hGraph.dump(out); //Graph object should represent the network state
}
//-B: it should print the WDMNetwork object status (useful for debugging purpose; to be tried)
void NetMan::WDMNetdump(ostream& out) const
{
m_hWDMNet.dump(out);
out<<endl;
/*out<<"- NetMan @"<<(void*)this<<':'<<endl;
out<<" #OfPaths = "<<m_nNumberOfPaths<<endl;
out<<" ProvisionType = ";
char *pProvisionType;
switch (m_eProvisionType) {
case PT_SEG_SP_NO_HOP:
pProvisionType = "SEG_NO_HOP";
break;
case PT_SEG_SP_L_NO_HOP:
pProvisionType = "SEG_L_NO_HOP";
break;
case PT_SEG_SPP:
pProvisionType = "SEG_SPP";
break;
case PT_SEG_SP_B_HOP:
pProvisionType = "SEG_B_HOP";
break;
default:
DEFAULT_SWITCH;
}
out<<pProvisionType<<endl;
m_hConnectionDB.dump(out);
out<<endl;
m_hLightpathDB.dump(out);
out<<endl;
//m_hWDMNet.dump(out);
//out<<endl;
m_hGraph.dump(out);
out<<"- NetMan end of dump"<<endl;*/
}
//-B: return true if the initialization of the NetMan object has been done correctly (with all the input parameters)
// this method is called in ConProvisionMain.cpp and it is called before the initialization of Simulator object
// this method calls 2 main methods: readTopo (-> readTopoHelper) and genInitialStateGraph
bool NetMan::initialize(const char* pTopoFile,
const char* pProtectionType,
int nNumberOfPaths,
double dEpsilon,
int nTimePolicy,
const char* UnAv) // M//ANDREA
{
#ifdef DEBUGB
cout << "\nReading topology file in NetMan class" << endl;
//cin.get();
#endif // DEBUGB
assert(pTopoFile && pProtectionType);
TopoReader hTopoReader;
if (!hTopoReader.readTopo(m_hWDMNet, pTopoFile))
{
cerr<<"- Error reading topo file "<<pTopoFile<<endl;
return false;
}
// if (!hTopoReader.readTopo(m_hServWDMNet, pTopoFile)) {
// cerr
//}
// Parse protection type<<"- Error reading topo Serv file "<<pTopoFile<<endl;
// return false;
//-B: set the provisioning type
cout<<"Reading the topology file is done now it's time to set the provisioing type"<<endl;
if (0 == strcmp(pProtectionType, "SEG_SP_NO_HOP")) {
m_eProvisionType = PT_SEG_SP_NO_HOP;
} else if (0 == strcmp(pProtectionType, "wpSEG_SPP")) {
m_eProvisionType = PT_wpSEG_SPP;
} else if (0 == strcmp(pProtectionType, "wpUNPROTECTED")) {
m_eProvisionType = PT_wpUNPROTECTED;
} else if (0 == strcmp(pProtectionType, "wpDEDICATED")) {
m_eProvisionType = PT_wpPAL_DPP;
} else if (0 == strcmp(pProtectionType, "SPPBw")) {
m_eProvisionType = PT_SPPBw;
} else if (0 == strcmp(pProtectionType, "SPPCh")) {
m_eProvisionType = PT_SPPCh;
} else if (0 == strcmp(pProtectionType, "UNPROTECTED")) {
m_eProvisionType = PT_UNPROTECTED;
} else if (0 == strcmp(pProtectionType, "UNPROTECTED_GREEN")) {
m_eProvisionType = PT_UNPROTECTED_GREEN;
} else if (0 == strcmp(pProtectionType, "DEDICATED")) {
m_eProvisionType = PT_PAL_DPP;
} else if (0 == strcmp(pProtectionType, "SEG_SP_B_HOP")) {
m_eProvisionType = PT_SEG_SP_B_HOP;
} else if (0 == strcmp(pProtectionType, "SEG_SP_L_NO_HOP")) {
m_eProvisionType = PT_SEG_SP_L_NO_HOP;
} else if (0 == strcmp(pProtectionType, "SEG_SP_PB_HOP")) {
m_eProvisionType = PT_SEG_SP_PB_HOP;
} else if (0 == strcmp(pProtectionType, "SEG_SPP")) {
m_eProvisionType = PT_SEG_SPP;
} else if (0 == strcmp(pProtectionType, "SEG_SPP_B_HOP")) {
m_eProvisionType = PT_SEG_SPP_B_HOP;
} else if (0 == strcmp(pProtectionType, "SEG_SPP_PB_HOP")) {
m_eProvisionType = PT_SEG_SPP_PB_HOP;
} else if (0 == strcmp(pProtectionType, "SEG_SP_AGBSP")) {
m_eProvisionType = PT_SEG_SP_AGBSP;
} else if (0 == strcmp(pProtectionType, "BBU_HOTEL")) {
m_eProvisionType = PT_BBU;
} else if (0 == strcmp(pProtectionType, "Dynamic_VNF")) {
m_eProvisionType = PT_DVNF;
} else {
TRACE1("- ERROR: invalid protection type: %s\n", pProtectionType);
return false;
}
if (nNumberOfPaths <= 0) {
TRACE1("- ERROR: invalid #OfPaths: %d\n", nNumberOfPaths);
return false;
}
m_nNumberOfPaths = nNumberOfPaths;
m_hWDMNet.m_dEpsilon = dEpsilon;
//m_hServWDMNet.m_dEpsilon = dEpsilon; //-M
m_nTimePolicy = nTimePolicy; // M
// if (m_nTimePolicy==1){
// cerr <<"The value of TimePolicy is" << m_nTimePolicy <<endl;
// }
m_UnAv=false;
if(0 == strcmp(UnAv, "A")) //LA: they are equal
m_UnAv=true;
// Added ANDREA
m_eStatActive = PBLOCK;
//Generate graph of the network/LA: not needed if there is no conversion
m_hWDMNet.genStateGraph(m_hGraph);
// generate initial state graph
//genInitialStateGraph();
//m_hWDMNetPast = m_hWDMNet;
this->m_hWDMNet.setBetweennessCentrality(m_hGraph);
//LA:for lighter version
//this->m_hWDMNet.setBetweennessCentrality();
/*cout<<"\n this is the size of nodelist"<<this->m_hWDMNet.m_hNodeList.size();
cin.get();*/
return true;
}
//-B: it should provide an array useful to deal with link/node disjointness
inline void NetMan::genInitialStateGraph()
{
switch (m_eProvisionType) {
case PT_SEG_SP_NO_HOP:
case PT_SEG_SP_L_NO_HOP://-t
case PT_SEG_SP_AGBSP://-t
case PT_SEG_SP_B_HOP:
case PT_SEG_SPP:
case PT_SEG_SPP_B_HOP:
case PT_SEG_SP_PB_HOP:
case PT_SEG_SPP_PB_HOP:
case PT_UNPROTECTED:
case PT_PAL_DPP:
case PT_wpUNPROTECTED:
case PT_UNPROTECTED_GREEN:
case PT_wpSEG_SPP:
case PT_wpPAL_DPP:
case PT_SPPBw:
case PT_SPPCh:
case PT_BBU:
case PT_DVNF: //LA:added to support dynamic vnf
// single link/node failure
//LA: for shared path protection case: if not link disjoint we need to count nodes otherwise links
if(isLinkDisjointActive)
m_hWDMNet.allocateConflictSet(m_hWDMNet.getNumberOfLinks());
else
m_hWDMNet.allocateConflictSet(m_hWDMNet.getNumberOfNodes());
//m_hServWDMNet.allocateConflictSet(m_hServWDMNet.getNumberOfNodes());
break;
default:
DEFAULT_SWITCH;
}
}
//-B: reset attributes/info about connections, nodes (also links???)
void NetMan::resetAll()
{
//-B: delete/reset/release everything (?) about connections -> before resetting everything, it seems to update the stats of each lighpath
deprovisionAll();
//-B: reset everything (?) about all the nodes in the network
m_hGraph.reset4ShortestPathComputation();
SimplexLink *pSLink;
list<AbstractLink*>::const_iterator itr;
for (itr = m_hGraph.m_hLinkList.begin(); itr != m_hGraph.m_hLinkList.end(); itr++)
{
pSLink = (SimplexLink*)(*itr); //-B: SimplexLink class derived from AbstractLink class
//-B: if SimplexLinkType of the pSLink object is set to LT_UniFiber, then set the cost atttribute equal to 1
if (SimplexLink::LT_UniFiber == pSLink->getSimplexLinkType())
pSLink->modifyCost(1);
}
//-B: why does it call again the same method???
m_hWDMNet.reset4ShortestPathComputation();
}
//-B: delete/reset/release everything (?) about connections/lightpaths
void NetMan::deprovisionAll()
{
cout<<m_hConnectionDB.m_hConList.size()<<" connection(s) remaining"<<endl;
Connection *pCon;
while (!m_hConnectionDB.m_hConList.m_hList.empty()) {
pCon = m_hConnectionDB.m_hConList.m_hList.front();
deprovisionConnection(pCon);
delete pCon;
}
}
//-B: it simply returns the num of OXC nodes in the network (stored in m_hNodeList)
UINT NetMan::getNumberOfOXCNodes() const
{
return m_hWDMNet.getNumberOfNodes();
}
//-B: it simply returns the num of unidirectional fibers in the network (stored in m_hLinkList)
UINT NetMan::getNumberOfUniFibers() const
{
return m_hWDMNet.getNumberOfLinks();
}
//-B: return a reference to the WDMNetwork object, attribute of NetMan object
WDMNetwork* NetMan::getWDMNetwork()
{
return (&m_hWDMNet);
}
//-B: return true if the provisioning of the connection passed as parameter has been done correctly
// it calls the provisionConnectionHelper method, which calls a different method CASENAME_Provision
// depending on the provisioning type of the connection (these methods are implemented in this class, see below)
// ATTENTION: not used in while cycle of run method (class Simulator) -> provisionConnectionxTime is used instead
bool NetMan::provisionConnection(Connection *pCon)
{
bool bSuccess;
try {
bSuccess = provisionConnectionHelper(pCon);
} catch (OchException) {
cerr<<OchException::m_pErrorMsg<<endl;
this->dump(cout);
bSuccess = false;
}
return bSuccess;
}
//-B: return true if the provisioning of the connection passed as parameter has been done correctly
// it calls the provisionConnectionHelper method, which calls a different method CASENAME_Provision
// depending on the provisioning type of the connection (these methods are implemented in this class, see below)
// also, set the departure event list equal to the dep event list passed as parameter (DepaPC)
// (EventList evList is not used)
// [in sostanza, rispetto a provisionConnection (vedi sopra) imposta i valori delle var m_HoldingTimeIncoming
// e m_HArrivalTimeIncoming (appartenenti all'oggetto NetMan) uguali a quelli della connessione passata come parametro]
// -M List Event added
bool NetMan::provisionConnectionxTime(Connection *pCon, list<Event*>& DepaPC, EventList& evList)
{
// int a=0;
// Event *pEvent;
// list<Event*>::const_iterator itrE;
// for (itrE=DepaPC.begin(); itrE!=DepaPC.end(); itrE++) {
// pEvent = (Event*)(*itrE);
// assert(pEvent);
// cerr << pEvent-> m_hTime <<endl;
// a++;
// }
// cerr << "dimensione lista" << a << endl;
// a=0;
m_hDepaNet = DepaPC;
// int a=0;
// Event *pEvent;
// list<Event*>::const_iterator itrE;
// for (itrE=m_hDepaNet.begin(); itrE!=m_hDepaNet.end(); itrE++) {
// pEvent = (Event*)(*itrE);
// assert(pEvent);
// cerr << pEvent-> m_hTime <<endl;
// a++;
// }
// cerr << "dimensione lista" << a << endl;
// a=0;
DepaPC.erase(DepaPC.begin(), DepaPC.end());
//m_hDepaNet.erase(m_hDepaNet.begin(), m_hDepaNet.end());
m_hHoldingTimeIncoming = pCon->m_dHoldingTime;
m_hArrivalTimeIncoming = pCon->m_dArrivalTime;
bool bSuccess;
try {
bSuccess = provisionConnectionHelper(pCon);
} catch (OchException) {
cerr<<OchException::m_pErrorMsg<<endl;
this->dump(cout);
bSuccess = false;
}
return bSuccess;
}
//-B: return true if the provisioning of the connection passed as parameter has been done correctly
// call a different method CASENAME_Provision. Log the provisioning of the connection passed as parameter
// (to count the provisioned/blocked connections) and add it to the Connection DB (a Connection list)
inline bool NetMan::provisionConnectionHelper(Connection *pCon)
{
assert(pCon);
bool bSuccess = false;
switch (m_eProvisionType) {
case PT_wpSEG_SPP:
bSuccess = wpSEG_SPP_Provision(pCon);
break;
case PT_wpUNPROTECTED:
bSuccess = wpUNPROTECTED_Provision(pCon);
break;
case PT_UNPROTECTED:
bSuccess = UNPROTECTED_Provision(pCon);
break;
case PT_UNPROTECTED_GREEN:
bSuccess = UNPROTECTED_ProvisionGreen(pCon);
break;
case PT_PAL_DPP: //fabio 8 dic..avrò fatto bene ad usare questo nome gia assegnato?
bSuccess = PAL_DPP_Provision(pCon);
break;
case PT_wpPAL_DPP: //fabio 8 dic..avrò fatto bene ad usare questo nome gia assegnato?
bSuccess = wpPAL_DPP_Provision(pCon);
break;
case PT_SPPBw:
bSuccess = SPPBw_Provision(pCon);
break;
case PT_SPPCh:
bSuccess = SPPCh_Provision(pCon);
break;
case PT_SEG_SP_NO_HOP:
bSuccess = SEG_SP_NO_HOP_Provision(pCon);
break;
case PT_SEG_SP_L_NO_HOP:
bSuccess = SEG_SP_L_NO_HOP_Provision(pCon);//-t
break;
case PT_SEG_SP_AGBSP:
bSuccess = SEG_SP_AGBSP_Provision(pCon);//-t
break;
case PT_SEG_SPP:
bSuccess = SEG_SPP_Provision(pCon);
break;
case PT_SEG_SP_B_HOP:
bSuccess = SEG_SP_B_HOP_Provision(pCon);
break;
case PT_SEG_SPP_B_HOP:
bSuccess = SEG_SPP_B_HOP_Provision(pCon);
break;
case PT_SEG_SP_PB_HOP:
bSuccess = SEG_SP_PB_HOP_Provision(pCon);
break;
case PT_SEG_SPP_PB_HOP:
bSuccess = SEG_SPP_PB_HOP_Provision(pCon);
break;
case PT_BBU:
bSuccess = BBU_ProvisionNew(pCon); //-B: both VWP and WP cases
break;
//case PT_DVNF:
//bSuccess= DVNF_ProvisionVNF(pCon); //LA:
//break;
default:
DEFAULT_SWITCH;
};
#ifdef DEBUGB
UINT weird = 0;
//-B: check if there is something strange
weird = this->checkEmptyLightpaths();
if (weird > 0)
{
cout << "CI SONO " << weird << " LIGHTPATHS CON FREECAP = OCLIGHTPATH. WEIRD!" << endl;
cin.get();
this->m_hLightpathDB.dump(cout);
cin.get();
//this->removeEmptyLinkFromGraph();
//assert(this->checkEmptyLightpaths() == 0);
}
#endif // DEBUGB
//if (bSuccess)
//{
//this->checkGrooming(pCon); /-B: NOT NEEDED ANYMORE
//}
// log this provisioning, increasing counter of accepted or blocked connections
pCon->log(m_hLog);
//*************************************************************
pCon->log(m_runLog); // Statistical Log Add by Andrea *
//*************************************************************
// add to connection db if provisioned
if (bSuccess)
m_hConnectionDB.addConnection(pCon);
return bSuccess;
}
//-B: delete/reset/release everything (?) about connections
// depending on the connection provisioning type, it calls a different method CASENAME_Deprovision
void NetMan::deprovisionConnection(Connection* pCon)
{
switch (m_eProvisionType)
{
case PT_wpSEG_SPP:
wpSEG_SPP_Deprovision(pCon);
break;
case PT_wpUNPROTECTED:
wpUNPROTECTED_Deprovision(pCon);
break;
case PT_SPPBw:
SPPBw_Deprovision(pCon);
break;
case PT_SPPCh:
SPPCh_Deprovision(pCon);
break;
case PT_wpPAL_DPP:
wpPAL_DPP_deprovision(pCon);
break;
case PT_SEG_SP_NO_HOP:
SEG_SP_NO_HOP_Deprovision(pCon);
break;
case PT_SEG_SP_L_NO_HOP:
SEG_SP_L_NO_HOP_Deprovision(pCon);
break;
case PT_SEG_SP_AGBSP:
SEG_SP_AGBSP_Deprovision(pCon);
break;
case PT_SEG_SPP:
SEG_SPP_Deprovision(pCon);
break;
case PT_UNPROTECTED:
UNPROTECTED_Deprovision(pCon);
break;
case PT_UNPROTECTED_GREEN:
UNPROTECTED_Deprovision(pCon);
break;
case PT_PAL_DPP:
PAL_DPP_Deprovision(pCon);
break;
case PT_SEG_SP_B_HOP:
SEG_SP_B_HOP_Deprovision(pCon);
break;
case PT_SEG_SPP_B_HOP:
SEG_SPP_B_HOP_Deprovision(pCon);
break;
case PT_SEG_SP_PB_HOP:
SEG_SP_PB_HOP_Deprovision(pCon);
break;
case PT_SEG_SPP_PB_HOP:
SEG_SPP_PB_HOP_Deprovision(pCon);
break;
case PT_BBU:
BBU_Deprovision(pCon);
break;
case PT_DVNF:
DVNF_Deprovision(pCon);
break;
default:
DEFAULT_SWITCH;
}
pCon->m_eStatus = Connection::TORNDOWN;
m_hConnectionDB.removeConnection(pCon);
}
//**************************** PAL_DPP ****************************
inline bool NetMan::PAL_DPP_Provision_OCLightpath(Connection *pCon)
{
assert(OCLightpath == pCon->m_eBandwidth);
// check if there are enough Tx (Rx) at Src (Dst)
OXCNode *pOXCSrc = (OXCNode*)m_hWDMNet.lookUpNodeById(pCon->m_nSrc);
OXCNode *pOXCDst = (OXCNode*)m_hWDMNet.lookUpNodeById(pCon->m_nDst);
assert(pOXCSrc && pOXCDst);
if ((pOXCSrc->m_nFreeTx < m_nTxReqPerLightpath) ||
(pOXCDst->m_nFreeRx < m_nTxReqPerLightpath)) {
pCon->m_eStatus = Connection::DROPPED;
pCon->m_bBlockedDueToUnreach = true;
pCon->m_bBlockedDueToTx = true;
return false;
}
Lightpath *pLP = new Lightpath(0, Lightpath::LPT_PAL_Dedicated);
// apply Suurballe's algorithm to the reachability graph
AbstractGraph hWLGraph;
m_hWDMNet.genReachabilityGraphThruWL(hWLGraph);
// NB: may need to set the shorter one as primary
LINK_COST hCost =
hWLGraph.Suurballe(pLP->m_hPPhysicalPath, pLP->m_hBPhysicalPath,
pCon->m_nSrc, pCon->m_nDst,
AbstractGraph::LCF_ByOriginalLinkCost);
if (UNREACHABLE == hCost) {
delete pLP;
pCon->m_eStatus = Connection::DROPPED;
pCon->m_bBlockedDueToUnreach = true;
return false;
}
Circuit *pCircuit =
new Circuit(pCon->m_eBandwidth, Circuit::CT_PAL_DPP, NULL);
pLP->m_nBWToBeAllocated = pCon->m_eBandwidth;
pCircuit->addVirtualLink(pLP);
pCircuit->setUp(this);
pCon->m_pPCircuit = pCircuit;
pCon->m_eStatus = Connection::SETUP;
return true;
}
bool NetMan::PAL_DPP_MinTHP_Provision(Connection *pCon)
{
// NB: wrong, should provision OCLightpath the same way as others
// if (OCLightpath == pCon->m_eBandwidth)
// return PAL_DPP_Provision_OCLightpath(pCon);
AbstractGraph hAuxGraph;
vector<Lightpath*> hLPList;
list<AbstractLink*> hMinCostPath;
// STEP 1: Generate auxilary graph
try {
PAL_DPP_MinTHP_GenAuxGraph(hAuxGraph, hLPList, pCon);
} catch (...) {
cerr<<"- OUT OF MEMORY: "<<__FILE__<<":"<<__LINE__<<endl;
}
// STEP 2: Apply min-cost path computation
AbstractNode *pSrc = hAuxGraph.lookUpNodeById(pCon->m_nSrc);
AbstractNode *pDst = hAuxGraph.lookUpNodeById(pCon->m_nDst);
LINK_COST hMinCost = hAuxGraph.Dijkstra(hMinCostPath, pSrc, pDst,
AbstractGraph::LCF_ByOriginalLinkCost);
if (UNREACHABLE == hMinCost) {
pCon->m_eStatus = Connection::DROPPED;
pCon->m_bBlockedDueToUnreach = true;
// delete temp lightpaths
vector<Lightpath*>::const_iterator itr;
for (itr=hLPList.begin(); itr!=hLPList.end(); itr++) {
if (0 == (*itr)->getId()) delete (*itr);
}
return false;
}
Circuit *pCircuit =
new Circuit(pCon->m_eBandwidth, Circuit::CT_PAL_DPP, NULL);
// STEP 3: Check min-cost path
bool bRcAvailable;
try {
bRcAvailable = PAL_DPP_MinTHP_NewCircuit(*pCircuit, hAuxGraph,
hLPList, hMinCostPath);
} catch (...) {
cerr<<"- OUT OF MEMORY: "<<__FILE__<<":"<<__LINE__<<endl;
}
// STEP 4: If okay then set up this new circuit
if (bRcAvailable) {
try {
pCircuit->setUp(this);
} catch (...) {
cerr<<"- OUT OF MEMORY: "<<__FILE__<<":"<<__LINE__<<endl;
}
// STEP 5: Associate the circuit w/ the connection
pCon->m_pPCircuit = pCircuit;
// STEP 6: Update status
pCon->m_eStatus = Connection::SETUP;
} else {
pCon->m_eStatus = Connection::DROPPED;
delete pCircuit;
}
// delete temp lightpaths
vector<Lightpath*>::const_iterator itr;
for (itr=hLPList.begin(); itr!=hLPList.end(); itr++) {
if (0 == (*itr)->getId()) delete (*itr);
}
return bRcAvailable;
}
inline bool NetMan::PAL_DPP_MinTHP_NewCircuit(Circuit& hCircuit,
const AbstractGraph& hAuxGraph,
const vector<Lightpath*>& hLPList,
const list<AbstractLink*>& hMinCostPath)
{
UINT nUniFibers = m_hWDMNet.getNumberOfLinks();
int *pChannelReqOnLink = new int[nUniFibers];
memset(pChannelReqOnLink, 0, sizeof(int)*nUniFibers);
AbstractLink *pAuxLink;
Lightpath *pLP;
list<AbstractLink*>::const_iterator itr;
for (itr=hMinCostPath.begin(); itr!=hMinCostPath.end(); itr++) {
pAuxLink = *itr;
assert(pAuxLink);
// link ID is the index of that lightpath in hLPList
pLP = hLPList[pAuxLink->getId()];
if (0 == pLP->getId()) { // new lightpath, check rc availability
PAL_DPP_MinTHP_NewCircuit_Helper(pChannelReqOnLink,
pLP->m_hPPhysicalPath);
PAL_DPP_MinTHP_NewCircuit_Helper(pChannelReqOnLink,
pLP->m_hBPhysicalPath);
}
pLP->m_nBWToBeAllocated = hCircuit.m_eBW;
hCircuit.addVirtualLink(pLP);
}
// resource available?
bool bRcAvailable = true;
list<AbstractLink*>::const_iterator itrUniFiber;
UniFiber *pUniFiber;
for (itrUniFiber=m_hWDMNet.m_hLinkList.begin();
itrUniFiber!=m_hWDMNet.m_hLinkList.end(); itrUniFiber++) {
pUniFiber = (UniFiber*)(*itrUniFiber);
assert(pUniFiber);
if (pUniFiber->countFreeChannels() <
pChannelReqOnLink[pUniFiber->getId()]) {
bRcAvailable = false; // not enough available wavelengths
break;
}
}
delete []pChannelReqOnLink;
return bRcAvailable;
}
inline void NetMan::PAL_DPP_MinTHP_NewCircuit_Helper(int* pChannelReqOnLink,
const AbstractPath& hPath)
{
list<UINT>::const_iterator itrNext1 = hPath.m_hLinkList.begin();
assert(itrNext1 != hPath.m_hLinkList.end());
list<UINT>::const_iterator itrCurr1 = itrNext1++;
AbstractLink *pLink;
while (itrNext1 != hPath.m_hLinkList.end()) {
pLink = m_hWDMNet.lookUpLink(*itrCurr1, *itrNext1);
assert(pLink);
pChannelReqOnLink[pLink->getId()]++;
itrCurr1 = itrNext1++;
}
}
inline void NetMan::PAL_DPP_MinTHP_GenAuxGraph(AbstractGraph& hAuxGraph,
vector<Lightpath*>& hLPList,
const Connection* pCon)
{
list<AbstractNode*>::const_iterator itrSrc;
list<AbstractNode*>::const_iterator itrDst;
hAuxGraph.deleteContent();
for (itrSrc=m_hWDMNet.m_hNodeList.begin();
itrSrc!=m_hWDMNet.m_hNodeList.end(); itrSrc++)
hAuxGraph.addNode(new AbstractNode((*itrSrc)->getId()));
AbstractGraph hWLGraph;
m_hWDMNet.genReachabilityGraphThruWL(hWLGraph);
// link ID is the index of that lightpath in hLPList
UINT nLinkId = 0;
for (itrSrc = m_hWDMNet.m_hNodeList.begin(); itrSrc != m_hWDMNet.m_hNodeList.end(); itrSrc++)
for (itrDst = m_hWDMNet.m_hNodeList.begin(); itrDst!=m_hWDMNet.m_hNodeList.end(); itrDst++)
{
if (itrSrc == itrDst)
continue;
// search for existing lightpath w/ min # of WLs
Lightpath *pTargetLP = NULL;
if (pCon->m_eBandwidth < OCLightpath) {
pTargetLP = lookUpLightpathOfMinChannels((*itrSrc)->getId(),
(*itrDst)->getId(), pCon->m_eBandwidth);
}
LINK_COST hNewCost = UNREACHABLE;
Lightpath *pNewLP = NULL;
if ((NULL == pTargetLP) || (GP_MinTHP == m_eGroomingPolicy)) {
// constraints on Tx & Rx
OXCNode *pOXCSrc = (OXCNode*)(*itrSrc);
OXCNode *pOXCDst = (OXCNode*)(*itrDst);
assert(pOXCSrc && pOXCDst);
if ((pOXCSrc->m_nFreeTx >= m_nTxReqPerLightpath)
&& (pOXCDst->m_nFreeRx >= m_nTxReqPerLightpath)) {
// apply Suurballe's algorithm for each s-d pair on hWLGraph
pNewLP = new Lightpath(0, Lightpath::LPT_PAL_Dedicated);
// NB: may need to set the shorter one as primary
hNewCost = hWLGraph.Suurballe(pNewLP->m_hPPhysicalPath,
pNewLP->m_hBPhysicalPath,
(*itrSrc)->getId(),
(*itrDst)->getId(),
AbstractGraph::LCF_ByOriginalLinkCost);
}
}
bool bUseExistingLP = false;
bool bUseNewLP = false;
//m_eGroomingPolicy=GP_MinTHP;//levare
switch (m_eGroomingPolicy) {
case GP_MinNTHP:
if (pTargetLP) bUseExistingLP = true;
else if (UNREACHABLE != hNewCost)
bUseNewLP = true;
break;
case GP_MinTHP:
if (pTargetLP) {
if (UNREACHABLE != hNewCost) {
if (pTargetLP->getCost() <= hNewCost)
bUseExistingLP = true; // use existing LP
else
bUseNewLP = true; // use new LP
} else {
bUseExistingLP = true; // use existing LP
}
} else { // no existing LP
if (UNREACHABLE != hNewCost)
bUseNewLP = true; // use new LP
}
break;
default:
DEFAULT_SWITCH;
}
assert(!(bUseExistingLP && bUseNewLP));
if (bUseExistingLP) {
assert(pTargetLP->getCost() >= 0);
// to encourage grooming, use hUseCost instead of hRealCost
LINK_COST hRealCost = pTargetLP->getCost();
LINK_COST hUseCost = hRealCost - 1;
hAuxGraph.addLink(nLinkId++, (*itrSrc)->getId(), (*itrDst)->getId(), hUseCost, 1);
// use existing lightpath
hLPList.push_back(pTargetLP);
if (pNewLP) delete pNewLP;
} else if (bUseNewLP) {
assert(hNewCost >= 0);
hAuxGraph.addLink(nLinkId++,(*itrSrc)->getId(),
(*itrDst)->getId(), hNewCost, 1);
// use new lightpath
hLPList.push_back(pNewLP);
} else {
// no existing/new lightpath connect these two nodes
if (pNewLP) delete pNewLP;
}
}
}
inline void NetMan::PAL_DPP_MinTHP_Deprovision(Connection* pCon)
{
if (pCon->m_pPCircuit)
pCon->m_pPCircuit->tearDown(this);
if (pCon->m_pBCircuit)
pCon->m_pBCircuit->tearDown(this);
}
//-B: Log some info about lightpaths, count num of backup channels and other logs
//LA:modified
void NetMan::logPeriodical(SimulationTime hTimeSpan)
{
//-B: log peak and average network cost
this->logNetCostPeriodical(hTimeSpan);
//-B: log peak and average number of lightpaths
this->logActiveLpPeriodical(hTimeSpan);
//-B: log peak and average number of active hotels/nodes
//LA: commented: this->logActiveHotelsPeriodical(hTimeSpan);
//-B: log peak and average number of BBUs (count only macro cells)
//LA:commented: this->logActiveBBUs(hTimeSpan);
//-B: log peak and average number of active small cells
//LA:commented:this->logActiveSmallCells(hTimeSpan);
//////////////////////////////////////////////////////////////////////////////////