subject

Configure a firewall on a Linux machineSet up a stateless firewall that accomplishes the following objectives. Allows web traffic to external servers with class A IP addresses and at ports 80 and 443.Allows secure shell connections from your machine to any machine at port 22.Allows secure shell connections from any one of the fox servers to your machine at port 22.Allows any critical traffic needed for your machine to function. For VDI machines the firewall should allow all TCP traffic to and from 10.100.1.161 through 10.100.1.164 (which are the VDI gateways) and all traffic on the loopback interface. Blocks all other TCP traffic. Logs all blocked packets before dropping them. Use a custom label to easily extract the log information generated by the firewall rules you created.

ansver
Answers: 1

Another question on Computers and Technology

question
Computers and Technology, 21.06.2019 16:00
How do i draw hello world in python and how do i make it loop?
Answers: 3
question
Computers and Technology, 22.06.2019 01:00
)a grad student comes up with the following algorithm to sort an array a[1..n] that works by first sorting the first 2/3rds of the array, then sorting the last 2/3rds of the (resulting) array, and finally sorting the first 2/3rds of the new array. 1: function g-sort(a, n) . takes as input an array of n numbers, a[1..n] 2: g-sort-recurse(a, 1, n) 3: end function 4: function g-sort-recurse(a, `, u) 5: if u ⒠` ≤ 0 then 6: return . 1 or fewer elements already sorted 7: else if u ⒠` = 1 then . 2 elements 8: if a[u] < a[`] then . swap values 9: temp ↠a[u] 10: a[u] ↠a[`] 11: a[`] ↠temp 12: end if 13: else . 3 or more elements 14: size ↠u ⒠` + 1 15: twothirds ↠d(2 ◠size)/3e 16: g-sort-recurse(a, `, ` + twothirds ⒠1) 17: g-sort-recurse(a, u ⒠twothirds + 1, u) 18: g-sort-recurse(a, `, ` + twothirds ⒠1) 19: end if 20: end function first (5 pts), prove that the algorithm correctly sorts the numbers in the array (in increasing order). after showing that it correctly sorts 1 and 2 element intervals, you may make the (incorrect) assumption that the number of elements being passed to g-sort-recurse is always a multiple of 3 to simplify the notation (and drop the floors/ceilings).
Answers: 3
question
Computers and Technology, 22.06.2019 12:00
Which of the following “invisible” marks represents an inserted tab?
Answers: 1
question
Computers and Technology, 22.06.2019 21:50
Given int variables k and total that have already been declared, use a while loop to compute the sum of the squares of the first 50 counting numbers, and store this value in total. thus your code should put 11 + 22 + 33 + + 4949 + 50*50 into total. use no variables other than k and total.
Answers: 2
You know the right answer?
Configure a firewall on a Linux machineSet up a stateless firewall that accomplishes the following o...
Questions
question
Mathematics, 27.04.2021 18:00
question
Mathematics, 27.04.2021 18:00
question
Mathematics, 27.04.2021 18:00
Questions on the website: 13722360