Skip to main content

Saving firewall rules permanently in CentOS

By
There is no way to permanently add firewall rules in the Linux machine. But, one can make some changes so that whenever Linux is booting up it will load firewall rules which are already stored in some file.

It can be achieved using iptables-save and iptables-restore to save and restore firewall rules.

First, execute all the IPTable rules on the CentOS machine.

Then save IPTable rules to some file like /etc/iptables.conf using the following command:
$  iptables-save > /etc/iptables.conf
 
Add the following command in /etc/rc.local to reload the rules in every reboot.
$  iptables-restore < /etc/iptables.conf

After executing the above command change the permissions of rc.local to executable.
 
To check whether it is restoring the firewall rules or not, remove the firewall rules
and restart the system. If the firewall rules which you stored using 
iptables-save > /etc/iptables.conf
are present then it is working. Otherwise, repeat the above steps.
Labels:

Comments

Post a Comment

Popular posts from this blog

Leet Code: Problem #710 Random Pick with Blacklist

By
Given a blacklist  B containing unique integers from [0, N) , write a function to return a uniform random integer from [0, N) which is NOT  in B . Optimize it such that it minimizes the call to system’s Math.random() . Note: 1 <= N <= 1000000000 0 <= B.length < min(100000, N) [0, N)  does NOT include N. See interval notation . Example 1: Input: ["Solution","pick","pick","pick"] [[1,[]],[],[],[]] Output: [null,0,0,0] Example 2: Input: ["Solution","pick","pick","pick"] [[2,[]],[],[],[]] Output: [null,1,1,1] Example 3: Input: ["Solution","pick","pick","pick"] [[3,[1]],[],[],[]] Output: [null,0,0,2] Example 4: Input: ["Solution","pick","pick","pick"] [[4,[2]],[],[],[]] Output: [null,1,3,1] Explanation of Input Syntax: The input is two lists: the subroutines called and their argume...
Post a Comment
Read more

Leet Code: Problem: 355. Design Twitter

By
Problem Statement: Design basic twitter which lets user follow and unfollow other users and show the latest new feed related to the current user and the user followers. Implement the following APIs void postTweet(int userId, int tweetId):     Stores the tweetId against the user ID. void follow(int followerId, int followeeId):     Marks that follower ID as following followee ID void unfollow(int followerId, int followeeId):     Marks that follower ID as unfollowing followee ID vector<int> getNewsFeed(int userId):     Returns the set of the latest 10 tweetIDs which include the current user tweetIDs and tweetIDs of the user that the follower if following. Approach to the problem: First we need to store the user IDs of the people a particular user is following To store that we can use map. To optimize things instead of storing list of followers, it is better to store them in a set for quicker access. So the followers data str...
Post a Comment
Read more

LeetCode: Problem #1402. Reducing Dishes

By
Problem Statement: A chef has collected the data on the review for his dishes. Our Chef will take just 1 unit of time to prepare a dish. Our job is to tell him the dishes he has to make in the order to achieve maximum benefit. The maximum benefit is calculated using the formula time[i] * (review ratings). Example 1: Input: reviews = [-1, -10, -9, 0, 5] Output: 14 Explanation: Considering the dishes in the order of -1, 0 ,5 the calculation will be (-1 * 1 + 0 * 2 + 5 * 3) = 14 Example 2: Input: reviews = [6,5,4] Output: 32 Explanation: Considering the dishes in the order of 4, 5, 6 the calculation will be (4 * 1 + 5 * 2 + 6 * 3) = 32 Approach to the solution: Sort the given reviews so that we can concentrate only on maximum benefited reviews. Make cumulative sums from the end. This will help in deciding till which we have to consider the summation. Now start from the end at add the previous array of cumulative sums until a negative number is encountered. We have to iterate in reverse or...
Post a Comment
Read more