Network File System

Network File System

We designed a NFS server which helps us to transfer files and directories between a different systems in the same network.You can also designed your own NFS server by the help of our team Programmerix. We share some method with you so that you can make our own nfs server with the help of Redhat 7.3 operating system(Linux).

1)NFS:- Network File System is a server-client protocol used for sharing the files bwteeen computers on a common network. We can directly access to any files on the remote file system. NFS protocol can't be run on Windows operating system because Window is not NFS compatible. Rather than NFS we use SAMBA protocol on windows to transfer the files.
2)Steps:- 
⦁ On Server(redhat 7.3):-
1) install the software **NFS_UTILS**
-------yum install -y nfs-utils
2)Configure nfs server
------- create a directory like data(or any name) anywhere
------- now open the file /etc/exports
vim /etc/exports
-------- write the following --
/data                     192.168.43.23(rw,no_root_squash)
        (path of the directory)            ( ip address of the client )
***no_root_squash is used to allow the root user on the client server to acces or create files on the NFS  server as root.
3) Restart the services:-
-------- systemctl restart nfs
-------- exportfs -r 
-------- systemctl stop firewalld
-------- setenforce 0 (to stop firewalls)
-------- iptables -F
⦁ On Client :-
1) ping the server to check the host is reachable or not
2) showmount -e 192.168.43.63(server ip)
3) create a directory to mount the share folder
4) mount 192.168.43.63:/data  /mnt
5) To unmount the shared folder write unmount /mnt.


 

Comments

Post a Comment

Popular posts from this blog

Fibonacci Series with Python

Image
Fibonacci Series  F ibonacci Series  are the numbers in the following   integer sequence , called the  Fibonacci series  , and characterized by the fact that every number after the first two is the sum of the two preceding ones:- {\displaystyle 1,\;1,\;2,\;3,\;5,\;8,\;13,\;21,\;34,\;55,\;89,\;144,\;\ldots }       Often, especially in modern usage, the sequence is extended by one more initial term: {\displaystyle 0,\;1,\;1,\;2,\;3,\;5,\;8,\;13,\;21,\;34,\;55,\;89,\;144,\;\ldots } By definition, the first two numbers in the Fibonacci sequence are either 1 and 1, or 0 and 1, depending on the chosen starting point of the sequence, and each subsequent number is the sum of the previous two. <PROGRAM> def fibo():     a=int(0)     b=int(1)     list=[]     list.append(a)     list.append(b)     for i in range(2,5):         k=a+b   ...
Read more
Image
----MERGE SORT---- M erge Sort is a Divide and conqueror problem.  It divides an input array in two halves, calls itself for the two halves and then merges the two sorted halves.   The merge() function  is used for merging two halves.It follows the top-down approach.  Our Team "Programmerix" has created our own version of Merging code so that we can solve many students problem.We use recursive function and random function this code to help the programmers to insert the inputs via keyboard.Hope you all like it----- Gmail ----Program---- #include<iostream.h> #include<conio.h> #include<stdlib.h> void Merge(int [],int,int,int); void input(int a[],int n) { int i; randomize(); for(i=0;i<n;i++) { a[i]=rand()%100; } cout<<"array is \n"; for(i=0;i<n;i++) { cout<<" "<<a[i]; } cout<<endl; } void Ms(int a[],int low,int high) { int mid; if(low<high) { mid=(low+high)...
Read more