Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Assessment details Assessments 3 : Overview Assessment tasks Learning Outcome Mapping Assessment ID Assessment Item When due Weighting ULO# CLO# for BITS 3 * Project

Assessment details
Assessments 3:
Overview
Assessment tasks
Learning Outcome Mapping
Assessment ID Assessment Item
When due
Weighting
ULO#
CLO# for BITS
3*
Project Report
(Group)
Week 12
40%
1,4
A, B, C, D, H, I, J
Project Demonstration
(Group)
Week 13
(Study Week)
15%
Note: * denotes 'Hurdle Assessment Item' that students must achieve at least 40% in this item to pass the unit.
Introduction
You will install a SIEM server and demonstrate any five (5) tasks. You can use any SIEM server including Splunk, Greylog, ELK, etc. Demonstrate how you install it, configure the rsyslogs and demonstrate the five tasks. An example of the five tasks are below:
1. Searches and Queries
2. Mapping
3. Sending logs to the SIEM and performing log analysis (searching on logs)
4. Demonstrate Reporting
5. Demonstrate Dashboard
Report
This is a group project with 3-4 students in a group. You will implement an SIEM server and configure clients to send their logs (e.g. rsyslog) to the server and write rules from the logs and determine appropriate actions on the events.
Demonstration
You will complete a project demonstration at the end of the study period and will be assessed both as an individual and as a member

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Professional Visual Basic 6 Databases

Authors: Charles Williams

1st Edition

1861002025, 978-1861002020

Students also viewed these Databases questions

Question

=+8.12. Show that sup ,, no(i, j) = is possible in Lemma 2.

Answered: 1 week ago