P2P: Virtual File System

1
P2P Virtual File System

• Under the supervision of
• Dr.Anupam Agarwal
• Developed
  By
• 
  Hunny Garg B2004029
  Ratnesh Pandey B2004062
• 
  Sameer Gupta B2004068

2
What is P2PVirtual File system all about

• P2Pvirtual file system is an application used
  to communicate and transfer data between nodes in
  the network without the need of any central
  server.
• Microsoft.net(C) platform is used.
• Based on P2P architecture.

3
What is P2P?

• Peer-to-peer is a communications model in which
  each party has the same capabilities and either
  party can initiate a communication session.
• A P2P computer network relies primarily on the
  computing power and bandwidth of the participants
  (computing power at the edges (ends) of a
  connection in the network) rather than in the
  network itself.
• P2P model of network arrangement differs from the
  client-server model where communication is
  usually to and from a central server

4
client-server network vs P2P network
5
Motivation

• To develop an application which can help in
  communication and data sharing between nodes.
• Calculations done..
• In IIITA network
• CC1500 nodes.
• CC2500 nodes.
• Both boys hostel1000 nodes.
• Appox. Data shared on each node 5 GB.
• Total data avail in sharing(5005001000)510000
  GB.

6
(No Transcript)
7
Implementation Details

• The application sends the asynchronous ICMP
  (ping) packet to check the status of a given node
  whether it is alive or not.
• The Ping class offers both synchronous and
  asynchronous methods to detect whether a remote
  host is reachable.
• We are using the asynchronous method because it
  will not halt the system whenever a ping is sent
  to a remote host.

8
Listing the shared folders

• To list the shared folders for an active remote
  host we have used NetworkShares library.
• Two classes defined in this library are
  ShareCollection and Share. ShareCollection is a
  class capable of determining the shared folders
  for a given IP Address and storing the
  information in objects of type Share.

9
Based on keyword search

• Start searching the main directory,then
  recursively check the sub-directories in it.
• The problem arises if sub directory is too deep,
  the application can waste a lot of time looking
  for files in a particular folder if the
  directory structure is too deep.
• To prevent this, we employ the feature of search
  depth. Search depth is an integer variable which
  is incremented by one everytime the search moves
  to a folder a level deeper in the directory tree.
  Whenever the variable exceeds a particular value
  the recursion stops and the function returns.

10
Use of Filters

• Type Filter
• For users who dont know the exact file names of
  what they are looking for we have implemented
  Type Filters.
• A user can specify the type of file he is
  looking for for e.g. audio,document etc.The
  filters will only search for the type specified.
• Reduces search time by 1/10th of total time.

11

• Size Filter
• Using size filters a user can further reduce the
  time the search takes. A user can specify roughly
  the size of file hes looking for.
• This further reduces the search time

12
Modular Desgin Of Application
13
Results

• Low time complexity is achieved with the use of
  asynchronous messaging and multi-threading.
• Time complexity is further reduced with the use
  of filters.

14
Snapshot
15
References