30.07.2015 Views

Actas JP2011 - Universidad de La Laguna

Actas JP2011 - Universidad de La Laguna

Actas JP2011 - Universidad de La Laguna

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

<strong>Actas</strong> XXII Jornadas <strong>de</strong> Paralelismo (<strong>JP2011</strong>) , <strong>La</strong> <strong>La</strong>guna, Tenerife, 7-9 septiembre 2011required for the different elementary scores withinthe same aggregation block. In [5], the author <strong>de</strong>finesup to 20 different logic operators which <strong>de</strong>scribea mandatoriness------------------------------------------------- Operation Symbolr2r3r4r5gradation among the requirementsof the system. Such gradation ranges from the fullconjunction (logic AND) which illustrates the simultaneityamong all the requirements, to the full disjunction(logic OR) which represents the notion ofreplaceability,SQUAREMEAN DISJUNCTION D+infty+infty+infty+inftyWEAKQD(-) WEAKQD(+) MEDIUMQD STRONGQD(-)D+-5.8026.6757.3167.819STRONGQD(+)D++20.63024.30027.11030.090 DA3.9294.4504.8255.111 D+9.52111.09512.27013.235where meeting just one requirement isenoughARITHMETICMEANA1.0001.0001.0001.000D--1.4491.5191.5651.596 D-+2.7923.1013.3183.479 SQU2.000 D-2.0182.1872.3022.384(see Figure 1).MEDIUMQC STRONGQC(-)C+--1.655-1.550-1.455-1.380 HARMONICMEANHAR-1.000 WEAKQC(+) GEOMETRICMEANGEO0.000 WEAKQC(-) C-+-0.148-0.208-0.235-0.251 CA-0.720-0.732-0.721-0.707 C--0.6190.5730.5460.526STRONGQC(+)C++-9.060-7.639-6.689-6.013 C+-3.510-3.114-2.823-2.606 C-0.2610.1920.1530.129CONJUNCTION C-infty-infty-infty-inftyFig. 1. Aggregation operators proposed by Dujmović, and rvalue for 2, 3, 4 and 5 inputsOnce all the intermediate scores have been computeduntil obtaining a global score, a coarse-grainedanalysis of each target can be performed. Then, theanalysis can be progressively refined using the availableintermediate scores until consi<strong>de</strong>ring the originalbenchmarking results. The benefit of using LSP relieson the fact that it systematises the way in whichscores are obtained from measures and naturally establishesa hierarchical approach for their analysis.The main concepts of LSP are illustrated throughoutFigure 2.Attributes(Benchmark measures)Fig. 2.AggregationAnalysisW·SW·SW·SW·SMeasures are aggregatedattending to a relationshipestrablished by thebenchmark performerW·SW·SS: Intermediate scoresRepresentation of the LSP techniqueIV. Case StudyAs already stated, LSP is a technique that can beapplied to any type of system or component. TheGlobal Scorecase study proposed in this paper emulates the <strong>de</strong>ploymentof a Wireless Mesh Network (WMN) [10],one of the most exten<strong>de</strong>d types of ad hoc network.A. Experimental Set-upOur <strong>de</strong>ployment consisted of 16 wireless no<strong>de</strong>s (includinglaptops and routers). As previously stated,benchmark users must carefully select the most suitablerouting protocol to provi<strong>de</strong> quality communicationswithout <strong>de</strong>lays nor interruptions. olsrd, <strong>de</strong>velopedby the most active and wi<strong>de</strong>r community<strong>de</strong>voted to the <strong>de</strong>velopment of open-source routingprotocols (www.olsr.org), is the most exten<strong>de</strong>d implementationof the popular Optimized Link StateRouting (OLSR) protocol. Accordingly, three differentversions of olsrd, using the same configuration,have been selected as benchmarks targets: v.0.4.10(released in 2006), v.0.5.6 (released in 2008) and currentv.0.6.0 (released in 2010).The applicative traffic addressed to exercise thenetwork was <strong>de</strong>fined in terms of synthetic UDP ConstantBit Rate (CBR) data flows of 200 Kbps, similarto the rates observed in daily scenarios [11].In or<strong>de</strong>r to recreate some of the most importantproblems in the domain of WMNs [10], we selected asubset of 5 of the most harmful faults (both acci<strong>de</strong>ntaland malicious faults or attacks), according to ourprior investigation [4] (see Table I), to be injectedwhile running the workload.TABLE IFaults consi<strong>de</strong>red during the experimentationFault Type OriginAmbient noise (A) Acci<strong>de</strong>ntal NaturalSelective forwarding attack (S) Malicious Human-ma<strong>de</strong>Jellyfish attack (J) Malicious Human-ma<strong>de</strong>Tampering attack (T) Malicious Human-ma<strong>de</strong>Flooding attack (F) Malicious Human-ma<strong>de</strong>B. Aggregation of MeasuresOnce the benchmark experimental conditions havebeen specified, it is necessary to <strong>de</strong>fine the differentmeasures that will be used to assess the quality of theconsi<strong>de</strong>red benchmark target. Conversely to othermeasures-aggregation techniques which are just appliedonce the final measures have been obtained, theLSP technique may assist the benchmark performerto <strong>de</strong>fine a comprehensive hierarchical mo<strong>de</strong>l of measuresapplying a series of refinements. The goal ofthis process is to characterise the quality of the systemthrough a complete and not redundant set ofelemental attributes or variables (a 1 to a n ). This set<strong>de</strong>fines a block and can contain a different amount ofattributes. This blocks composition continues groupingdifferent characteristics until the global score ofthe system is computed.B.1 Measures SelectionApplying this measures-aggregation strategy in anad hoc network involves characterising this particularsystem through its different characteristics. For<strong>JP2011</strong>-375

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!