Review Article

A Comprehensive Review on Adaptability of Network Forensics Frameworks for Mobile Cloud Computing

Table 5

Structure of network forensics frameworks.

FrameworksApproachMethodsEvaluationLimitationsPerformance

TracebackNFEA [71] LO, PMAuthenticated evidence marking scheme (AEMS)Test bed & SimulationComputational & Storage overhead50% performance degrades when AEMS applied to each packet. However, performance gains 40% when it is applied to only select packets.
LWIP [9] PMLightweight IP traceback based on TTL Tree analysis algorithmRouter overheadSignificant path reconstruction in DDoS attack
Scalable-NF [16] LOScalable network forensics Real world traffic tracesCapture real time trafficReduce 97% of irrelevant data for analysis
HB-SST [85]Spread spectrum techniquesHopping based spread spectrumSimulationScalabilityFalse positive decrease exponential with increase in signal length.
ITP [8]LOIP traceback protocol (ITP)SimulationRouter overheadITP shows better results in term of false positive rate & attack detection as comparing with existing frameworks

Converge networkPBNF [87]LOVoIP network forensics patternsSuggest to use NFATs Scalability, Forensics server bottle neckFaster and structural investigation in VoIP traffic
VoIP-NFDE [88]LOVoIP network forensics with digital evidenceTest bedTime consuming, bandwidth utilizationCollects, analyzes, and performs forensics in VoIP DEFSOP operational stage
VoIPEM [62]LOVoIP Evidence ModelS-TLC+Not trace anonymous attacksIdentifies significant information relate to attacks

Intrusion detection systemAIDF [91]Probabilistic modelProbabilistic discovery & inferenceTest bedDatabase for untreated dataPerfect discovery results in 16.67% and information combining from multiple IDS for forensics explanation is 87%
DFITM [92]Dynamic forensics intrusion toleranceFormal methodsFinite state machineStorage overheadEnhancement of availability of forensics server with improvement of collected significant evidence
IIFDH [93] LOSteganographyPrototypedScalabilityReal-time detection with preservation of evidence
NFIDA [94] LOMulti-dimensional analysisNot applicableComputational overheadRecords complete network data with providing data integrity that results in network forensics solution based on intrusion detection analysis.

Attack graph (AG)SA [95]Measure current & future attacksScalable analysisSynthetic & real AGComputational overheadFor large graph the integer value increases when processing time increase. However it remains stable for small graphs
MLL-AT [96]Network attack modelingMulti-level & layer attack treeCase studyScalability, Storage overheadModel attack more accurately, address system risk
AGFE [97]Forensics examinationAnti-forensics injection in AGTest bedScalabilityIdentifies alteration performed by intruders in log files.
FCM [98]Network security evaluationfinite cognitive map & genetic algorithmSimulationObservation depended, lack of awarenessResults best fit value of 1.64 that shows the probability of goal achieved.
CSBH [17]ProbabilisticDesign modelScenario basedComputational overheadIt finds that an approach is user centric, with complexity O (MN2).
AGVI [99]Visualization & InteractionRAVENNot applicableVisualization in real time situationAddress impact of HCI techniques on attack graphs

Distributive ForNet [100]distributive network forensics ArchitectureNot applicableLimited attack detection due to lightweight filteringProvide valuable, trustworthy information about network events
DRNIFS [101]LO, PMArchitectureNot applicableStorage overheadReal time detection with quick incident response
DCNFM [102] LOClient Server ArchitectureNot applicableForensics server bottle neck, Storage overheadIdentifies origin of attack and potential risk
DNF-IA [18] LODynamic network forensics modelLaboratory testLack of cryptography, forensics server bottle neckIntegrated, accurate results in real-time situation when attacks are occurred.

Approaches: LO: logging; PM: packet marking.