SlideShare a Scribd company logo
1 of 4
Download to read offline
Sameer Tuladhar, L. Sumalatha / International Journal of Engineering Research and
                   Applications (IJERA) ISSN: 2248-9622 www.ijera.com
                   Vol. 2, Issue 5, September- October 2012, pp.1063-1066
     Replication of Query Messages in the Unstructured Overlays
                        Peer-to-Peer Network
                               Sameer Tuladhar, L. Sumalatha
                                M.Tech.(Student), JNTUK, Kakinada,AP,India.
                               Assistant Professor, JNTUK, Kakinada, AP,India.


Abstract—
         Unstructured       peer–to-peer     (P2P)       In each of the P2P networks, a search mechanism
networks are attractive because they impose few          needs to be defined so that resources need to be
constraints to the participating peers and have a        known to be of importance to be used by users. But
low maintenance overhead. It provides high               the problem arises because of the dynamic nature of
resilience and tolerance to the continuous arrival       the P2P network which lacks central directory for
and departure of nodes. However the current              resource location. Moreover current P2P content
P2P networks are mostly constricted by on-               distribution systems suffer from limitations such as
demand content discovery mechanism. The                  content discovery mechanism only when requested
CoQUOS Approach has been suggested over                  and have no provision for declarations of data items
publish-subscribe      systems      which      can       they own to other interested peers. Participating
continuously notify the new data items, and a            peers in the P2P network discover data by
means for the peers to advertise contents.               circulating queries which are received by other peers
Another point that should be considered is churn         and respond back if it has any matching data. But
which is the phenomenon of dynamic nature of             the shortcoming is that these queries are not cached
entry and departure of peers in the P2P network.         in the overlays network which results in the network
Thus the churn significantly affects the search          to forget the query once it completed circulation.
mechanism in the P2P networks leading to                 Besides these limitations P2P networks must also
question the effectiveness and reliability of P2P        deal with the churn which is the instantaneous
networks. In addition to the two novel                   connectivity of the peers and intentionally or
techniques, namely cluster-resilient random walk         unintentionally departing from the network at any
algorithm for queries propagation and dynamic            instance of time. The more the churn is prevailing in
probability-based query registration scheme as           the network lesser will be the reliability of the
suggested in CoQUOS approach, we suggest the             network.
message replication of query registrations
present on a peer to one or more of its                  1.1 Paper Contributions
neighbouring peers. For this, a technique called                    In a P2P network, data and other necessary
Frequency Aware Search is suggested that                 resources are stored in a distributed fashion by the
defines a policy for partitioning the search space       participating peers of the network which has to be of
and a replication policy of keys. This paper             any interest to others. However to know whether the
elaborates the suggested algorithms through              data is available or not and also to inform the
theoretical analysis and also reports the                interested peers that requested data is available,
effectiveness    proposed      schemes    through        flooding of message seems to be an easy way out.
experimental evaluations.                                But it results in unnecessary traffic in the network.
                                                         In this paper we discuss about the CoQUOS
Keywords— Peer-to-Peer networks, CoQUOS                  approach for unstructured overlays network which
Approach, Random Walks, Churn, Message                   not only implements the message forwarding
replication                                              without flooding to all the peers but also provides
                                                         best-effort notification service for the registered
1.       INTRODUCTION                                    queries from the peers about the discovery of the
          Unstructured peer-to-peer networks have        required data. The main advantage of this approach
been use for quite a long time for content sharing or    is that it doesn’t enforce any topological constraints
file sharing by the participating nodes. Searching in    on the underlying network structure and doesn’t
these types of networks is very popular these days.      require any complex index structures of routing
Overlays networks form virtual topologies on top of      mechanism. On top of these features, this paper
an underlying network as the links in the overlay        deals with a search algorithm to improve the
networks have no correspondence with links               negative impacts of the churn by replicating the
established in the underlying network. P2P networks      messages to the neighbouring peers. This algorithm
are the best example of such overlays network.           is Frequency-Aware Search (FASE) which is
                                                         basically a search space partitioning mechanism,



                                                                                              1063 | P a g e
Sameer Tuladhar, L. Sumalatha / International Journal of Engineering Research and
                               Applications (IJERA) ISSN: 2248-9622 www.ijera.com
                               Vol. 2, Issue 5, September- October 2012, pp.1063-1066

         combined with a replication policy. It also doesn’t                                   in black i.e. {P2, P8, P11} are the beacon nodes and
         require the rigid network structure or any pre                                        P0 is the requesting peer which may receive multiple
         routing informations.                                                                 notifications. The Beacon nodes should be selected
                                                                                               in such a manner that they are distributed in every
         2.      THE CoQUOS SYSTEM OVERVIEW                                                    major region of the network such that every other
                   The CoQUOS system is a lightweight                                          peer in the network can reach them in a very small
         middleware that supports continuous queries and                                       number of hops and they should not be located very
         announcements/advertisements about discovery of                                       close to each other.
         data to the requesting peers in the unstructured
         overlays or simply saying P2P networks. The key                                       2.2      Cluster Resilient Random Walk
         features of this system include Cluster Resilient                                              In P2P networks Random Walk message
         Random Walk (CRW) [3] for forwarding the                                              propagation are more popular than flooding. In this
         messages to other peers in the network and a                                          approach a peer receives and forwards the message
         dynamic probability scheme for the registration of                                    to another neighbouring peer at random if its Time-
         queries in the peers. Continuous query is the means                                   To-Live (TTL) is not expired. Since this message
         of communication through which the peer registers                                     forwarding is done only one at a time so it reduces
         its interest to the network. It can be represented as                                 the message traffic in the network in comparison to
         Q=(SID, Predicate, VTime), which is actually a                                        the flooding. However with the networks with high
         tuple consisting of SourceID(SID) that identifies the                                 degree of clustering of nodes, there is a greater
         requesting peer, a query predicate(Predicate) for                                     chance the message gets trapped within the cluster
         matching condition of the query with the requested                                    and its TTL gets expired before it come outs of the
         data and validity time(VTime) which is the lifetime                                   cluster. To overcome this drawback, CoQUOS
         of interest of the requesting peer.                                                   system suggests a technique called Cluster Resilient
                                                                                               Random Walk (CRW). This technique considers the
         2.1.1    Design                                                                       concept of two peers being in the same cluster if
                  The CoQUOS system maintains each                                             they have the large number of common neighbours.
         continuous query at one or more peers in the                                          So CRW forwards messages to those nodes which
         network. The main objective of this system is to                                      have less neighbours in common by calculating the
         achieve high notification success rate for the query                                  probability of nodes being not in the same cluster.
         individually for the peer as well as overall for the                                  Thus a peer has to compute the overlap between its
         complete network. The figure below shows the                                          neighbours list and those of each of its neighbours,
         design of the CoQUOS system.                                                          and make message forwarding decisions.
                                                                                                        Let NbrList(Pj) denote the list of
                                                            A       Announcement               neighbours of Pj and Pk,Pk+1,Pk+2...,Pk+l denote the
                                                                                               neighbours of the node Pj. UniqueNbrs(Pk+1,Pj)
                                                            N       Notification
                                                                                               denote the set of neighbouring peers of Pk+1 that are
                                                5                                              not the neighbours of Pj. Suppose the node Pj
                                                                A
                                                                                               receives a query message from a neighbouring peer
                          Beacon
                                                                A        1                     Pk. The probability[3] of a neighbour Pk+1 receiving
                                   2                6                    4         A           the message in the next hop can be calculated as
                                                                                                                        UniqueNbrs     P k +1 ,P j
                                                                           A                                                                             λ
                                                                                           1                               NbrsList    P k +1
Source
              0                                                 7                          5   FwdProbability(Pk+1) =




C
                                   3   Beacon           A                          A
                                                                                                                         UniqueNbrs      P l ,P j
                                                                                                                                                     λ
                                                                                                                             NbrList    Pl

                                   N                1           A                              The propagation of query in CRW starts with source
                                                                             A         1
                          4                                                                    peer creating a query message initializing its TTL to
              1                                     1               1                  6
                                                                                 A             a default value. Each peer along the query’s path
                                       Beacon
                                                                    2
                      9                                                                1
                                                                                               forward the message to one of their neighbours
                                           8
                                                 1
                                                                    2                          according to their FwdProbability values. The TTL
                                                                                       3
                    Fig.1. CoQUOS           System
                                                 0              Overview                       is then decremented at each hop until it becomes




E
                                                                                               zero. The Fig. 2. [3] given below illustrates CRW
         If a continuous query Qm is registered at a peer Pi,                                  message forwarding in a single step. The query
         then Pi is called beacon node which implicitly takes                                  message is at the node p4 and λ which controls the
         the responsibility of notifying the source node of                                    extent of the bias is set to 2. The numbers on the
         any matching data items that it might discover                                        edges indicate the probabilities of forwarding the
         through incoming peer advertisements and checks                                       query along that link. It has been observed that
         with the registered query if anything matches to                                      CRW is better than normal random walks and
         provide notification to the requesting node about the                                 flooding techniques in forwarding messages to
         availability of the data. In the figure the peers shown                               various regions of the P2P overlays.



                                                                                                                                         1064 | P a g e
Sameer Tuladhar, L. Sumalatha / International Journal of Engineering Research and
                   Applications (IJERA) ISSN: 2248-9622 www.ijera.com
                   Vol. 2, Issue 5, September- October 2012, pp.1063-1066

                                                           over unstructured network which works well by
                                                           replication of queries with CRW technique.

                                                           4.   FREQUENCY AWARE SEARCH
                                                                    This technique defines a policy for dividing
                                                           the search space in the network and a key replication
                                                           policy.
                                                               The term frequency [6] is defined to be any
                                                           element of a finite and discrete set Φ. We define
                                                           functions fN: N→ Φ and fK: K→ Φ mapping
                                                           respectively the set of nodes (N) and keys (K) in
                                                           frequencies. A pointer is a tuple defined as follows:

2.3       Dynamic Query Registration                            Pointer: <Key,URL>
          This technique is based on the dynamic
probability of the peers to decide the registration of        In a pointer, a key identifies the item and an
queries on their own will. The registration                URL is an unique node address where the query will
probability of a query varies as the query traverses       be replicated. FASE improves search results by
along its path depending on whether the query has          having nodes to forward random walks preferably to
been registered or not at the nodes it visited in the      nodes in the same frequency of the search key. This
recent past. Thus if it has been registered at the node    algorithm assumes that majority of nodes in the
in the recent past the probability of getting              overlay have a constant degree.
registered in the next hop will be low and vice versa.
          The registration probability [3] value of            4.1. Pointer Replication
each message Qm is denoted as (Rp(Qm)). This value                   In order to reduce the impact of churn and
is set to an initial value when a peer issues a query.     properly facilitate item location, nodes replicate
If a peer registers this query, then it resets the value   pointers using replication messages which carry one
of Rp(Qm) to the default initial value, before             or more pointers with keys of the same frequency.
forwarding to its neighbours. However if the peer          For the message MR let fK(MR) be the frequency of
choose not to register the query then it increments        the keys being carried. These replication messages
Rp(Qm) by a pre-specified amount and forwards to           carry a counter that defines the maximum number of
the neighbour. That means the Rp(Qm) value keeps           replicas of each pointer to be stored. Every peer that
on incrementing until it gets registered wherein           decides to store pointer decrements the replica
there will be sudden fall of point to the initial value.   counter and when the counter becomes 0 the
This technique helps in controlling the number of          message is discarded. Replication messages are
beacon nodes where such query registration is done.        forwarded to those neighbours who have not been
                                                           visited previously. Since the replication message is
3. NETWORK OVERLAY CHURN                                   preferably forwarded to nodes labelled with the
          The very dynamic nature of P2P networks          same frequency of the item, only one pointer is
means that there will be number of nodes that will         stored for the whole path that contains number of
be entering and leaving the network at will. This          nodes. This leads to the efficiency in storing the
means besides the resource location, P2P networks          pointer. The main purpose of this replication method
must also cope with the intermittent connectivity of       is to make items well available for searches at any
the peers in the network to ensure the reliability of      point.
the overall network and data transfer. If this churn                 The pointer replication process is
is not handled well it can impact the success of           illustrated in the Fig. 3 given below.
continuous queries and announcements as well.
When a node leaves the system properly, its
responsibilities are well taken care by the
neighbouring peers, but when it happens abruptly,
all the query registrations are lost thus it will hamper
the notification success rates of the respective
queries and the matching announcements will be
dropped. In order to resolve this problem one
solution is the replication of queries on one or more
of its neighbours. For this, the technique called                       Fig.3. Pointer Replication [6]
Frequency- Aware Search (FASE) algorithm can be
implemented which is basically a search protocol                The above figure shows the path of a replication



                                                                                                 1065 | P a g e
Sameer Tuladhar, L. Sumalatha / International Journal of Engineering Research and
                     Applications (IJERA) ISSN: 2248-9622 www.ijera.com
                     Vol. 2, Issue 5, September- October 2012, pp.1063-1066

message MR starting at node S. The dotted circles
are the nodes in the same frequency of the message.
Here node S forwards message to a random
neighbour as it has no neighbour in MR frequency,
fK(MR) and thus the neighbour in the following hop
with fN(n) = fK(MR) will store a pointer. The figure
shows that a replication message is always
forwarded to unvisited nodes of the same frequency.
The nodes labelled with P store the pointer carried
by MR. These pointers are stored once per path and
the forwarding of MR is stopped once the replica
counter reaches 0 or when all the neighbours of the
current node have been visited before by MR.
                                                           Fig.5. Effectiveness of FASE to tackle churn
   5.     EXPERIMENTAL EVALUATION
          This section shows the experimental results            The mean NSRs which were measured
of the simulation of FASE algorithm with CRW            when the churn rate is set to 10%, 20% and 30%
technique. For this we have simulated a network         show that NSRs are high when using FASE than
consisting of 1000 nodes. The simulation created        without using it.
100 unique data items, from a group of data items in
excess of 4000, each advertised by a distinct node      6. CONCLUSION
selected at random to the beacon nodes. For             Maintaining the network reliability and data
evaluation of the algorithm, queries are performed      resources available in a P2P network is a challenge
for items that are present in the network and are       provided its dynamic nature i.e. churns. Although
selected uniformly at random.                           there may not be any perfect solution to tackle this
          We measured the difference in the             problem but the presented Frequency-Aware Search
Notification Success Rates (NSR) of overlay             algorithm helps to reliably search the data item in
network with and without the application of FASE        the unstructured overlays networks to very good
algorithm with CRW. The Fig.4. and Fig.5. shows         extent. Like CoQUOS approach FASE doesn’t
the NSRs of the two approaches for which the            enforce any restriction on the network structure or
registration probability value is set to 0.3.           topology. Our evalution shows that with the use of
                                                        FASE, we can achieve high NSRs even on
                                                        increasing the churn rate. The results suggest that,
                                                        the replication policy like FASW helps to increase
                                                        the availability of searched items.

                                                        REFERENCES
                                                          [1]   Gnutella P2P Network. www.gnutella .com
                                                          [2]   Wikipedia.
                                                                http://en.wikipedia.org/wiki/Peer-to-peer
                                                          [3]   L. Ramaswamy, J. Chen. The CoQUOS
                                                                Approach to Continuous Queries in
Fig.4. Comparison of minimum NSR of CRW with                    Unstructured Overlays. IEEE Transactions
and without use of FASE                                         on Knowledge and Data Engineering,
                                                                2011.
          In this experiment, the minimum NSRs of         [4]   L. Ramaswamy, J. Chen and Piyush Parate.
CRW were set to different values with the use of                CoQUOS: Lightweight Support for
FASE and without FASE and the results show that                 Continuous Queries in Unstructured
there is significant benefit in the NSR with the use            Overlays. IEEE 2007.
of FASE yielding reasonable NSR even at relatively        [5]   J. Chen, L. Ramaswamy and A. Meka.
low initial TTL values.                                         Message Diffusion in Unstructured
          We also checked the effectiveness of the              Overlay Networks. In Proceedings of NCA,
CRW with and without using FASE to evaluate the                 2007
effect of churn. The Fig.5. shows the results of the      [6]   Pedro Fonseca. Search Strategies in
experiment.                                                     Unstructured Overlays




                                                                                            1066 | P a g e

More Related Content

What's hot

Characterization of directed diffusion protocol in wireless sensor network
Characterization of directed diffusion protocol in wireless sensor networkCharacterization of directed diffusion protocol in wireless sensor network
Characterization of directed diffusion protocol in wireless sensor networkijwmn
 
A Novel Approach To Detect Trustworthy Nodes Using Audit Based Scheme For WSN
A Novel Approach To Detect Trustworthy Nodes Using Audit Based Scheme For WSNA Novel Approach To Detect Trustworthy Nodes Using Audit Based Scheme For WSN
A Novel Approach To Detect Trustworthy Nodes Using Audit Based Scheme For WSNIJERDJOURNAL
 
Maximizing P2P File Access Availability in Mobile Ad Hoc Networks though Repl...
Maximizing P2P File Access Availability in Mobile Ad Hoc Networks though Repl...Maximizing P2P File Access Availability in Mobile Ad Hoc Networks though Repl...
Maximizing P2P File Access Availability in Mobile Ad Hoc Networks though Repl...1crore projects
 
International Journal of Engineering and Science Invention (IJESI)
International Journal of Engineering and Science Invention (IJESI) International Journal of Engineering and Science Invention (IJESI)
International Journal of Engineering and Science Invention (IJESI) inventionjournals
 
Defending against collaborative attacks by
Defending against collaborative attacks byDefending against collaborative attacks by
Defending against collaborative attacks byranjith kumar
 
JPN1422 Defending Against Collaborative Attacks by Malicious Nodes in MANETs...
JPN1422  Defending Against Collaborative Attacks by Malicious Nodes in MANETs...JPN1422  Defending Against Collaborative Attacks by Malicious Nodes in MANETs...
JPN1422 Defending Against Collaborative Attacks by Malicious Nodes in MANETs...chennaijp
 
An efficient hybrid peer to-peersystemfordistributeddatasharing
An efficient hybrid peer to-peersystemfordistributeddatasharingAn efficient hybrid peer to-peersystemfordistributeddatasharing
An efficient hybrid peer to-peersystemfordistributeddatasharingambitlick
 
Secure and distributed data discovery and dissemination in wireless sensor ne...
Secure and distributed data discovery and dissemination in wireless sensor ne...Secure and distributed data discovery and dissemination in wireless sensor ne...
Secure and distributed data discovery and dissemination in wireless sensor ne...Pvrtechnologies Nellore
 
“Reducing packet loss in manet”
“Reducing packet loss in manet”“Reducing packet loss in manet”
“Reducing packet loss in manet”Alexander Decker
 
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKS
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSCLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKS
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
 
Behavioral Model to Detect Anomalous Attacks in Packet Transmission
Behavioral Model to Detect Anomalous Attacks in Packet TransmissionBehavioral Model to Detect Anomalous Attacks in Packet Transmission
Behavioral Model to Detect Anomalous Attacks in Packet TransmissionIOSR Journals
 
TAM new report
TAM new reportTAM new report
TAM new reportSuzit Punk
 
Effective Path Identification Protocol for Wireless Mesh Networks
Effective Path Identification Protocol for Wireless Mesh NetworksEffective Path Identification Protocol for Wireless Mesh Networks
Effective Path Identification Protocol for Wireless Mesh NetworksIDES Editor
 
Defending against collaborative attacks by malicious nodes in manets a cooper...
Defending against collaborative attacks by malicious nodes in manets a cooper...Defending against collaborative attacks by malicious nodes in manets a cooper...
Defending against collaborative attacks by malicious nodes in manets a cooper...IISTech2015
 

What's hot (16)

Characterization of directed diffusion protocol in wireless sensor network
Characterization of directed diffusion protocol in wireless sensor networkCharacterization of directed diffusion protocol in wireless sensor network
Characterization of directed diffusion protocol in wireless sensor network
 
A Novel Approach To Detect Trustworthy Nodes Using Audit Based Scheme For WSN
A Novel Approach To Detect Trustworthy Nodes Using Audit Based Scheme For WSNA Novel Approach To Detect Trustworthy Nodes Using Audit Based Scheme For WSN
A Novel Approach To Detect Trustworthy Nodes Using Audit Based Scheme For WSN
 
Maximizing P2P File Access Availability in Mobile Ad Hoc Networks though Repl...
Maximizing P2P File Access Availability in Mobile Ad Hoc Networks though Repl...Maximizing P2P File Access Availability in Mobile Ad Hoc Networks though Repl...
Maximizing P2P File Access Availability in Mobile Ad Hoc Networks though Repl...
 
International Journal of Engineering and Science Invention (IJESI)
International Journal of Engineering and Science Invention (IJESI) International Journal of Engineering and Science Invention (IJESI)
International Journal of Engineering and Science Invention (IJESI)
 
Defending against collaborative attacks by
Defending against collaborative attacks byDefending against collaborative attacks by
Defending against collaborative attacks by
 
Lt2520382043
Lt2520382043Lt2520382043
Lt2520382043
 
JPN1422 Defending Against Collaborative Attacks by Malicious Nodes in MANETs...
JPN1422  Defending Against Collaborative Attacks by Malicious Nodes in MANETs...JPN1422  Defending Against Collaborative Attacks by Malicious Nodes in MANETs...
JPN1422 Defending Against Collaborative Attacks by Malicious Nodes in MANETs...
 
An efficient hybrid peer to-peersystemfordistributeddatasharing
An efficient hybrid peer to-peersystemfordistributeddatasharingAn efficient hybrid peer to-peersystemfordistributeddatasharing
An efficient hybrid peer to-peersystemfordistributeddatasharing
 
Ns2422412247
Ns2422412247Ns2422412247
Ns2422412247
 
Secure and distributed data discovery and dissemination in wireless sensor ne...
Secure and distributed data discovery and dissemination in wireless sensor ne...Secure and distributed data discovery and dissemination in wireless sensor ne...
Secure and distributed data discovery and dissemination in wireless sensor ne...
 
“Reducing packet loss in manet”
“Reducing packet loss in manet”“Reducing packet loss in manet”
“Reducing packet loss in manet”
 
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKS
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSCLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKS
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKS
 
Behavioral Model to Detect Anomalous Attacks in Packet Transmission
Behavioral Model to Detect Anomalous Attacks in Packet TransmissionBehavioral Model to Detect Anomalous Attacks in Packet Transmission
Behavioral Model to Detect Anomalous Attacks in Packet Transmission
 
TAM new report
TAM new reportTAM new report
TAM new report
 
Effective Path Identification Protocol for Wireless Mesh Networks
Effective Path Identification Protocol for Wireless Mesh NetworksEffective Path Identification Protocol for Wireless Mesh Networks
Effective Path Identification Protocol for Wireless Mesh Networks
 
Defending against collaborative attacks by malicious nodes in manets a cooper...
Defending against collaborative attacks by malicious nodes in manets a cooper...Defending against collaborative attacks by malicious nodes in manets a cooper...
Defending against collaborative attacks by malicious nodes in manets a cooper...
 

Viewers also liked (20)

Fs2510501055
Fs2510501055Fs2510501055
Fs2510501055
 
Gy2512651271
Gy2512651271Gy2512651271
Gy2512651271
 
Gb2511071110
Gb2511071110Gb2511071110
Gb2511071110
 
Gv2512441247
Gv2512441247Gv2512441247
Gv2512441247
 
Gs2512261235
Gs2512261235Gs2512261235
Gs2512261235
 
Iu2515661573
Iu2515661573Iu2515661573
Iu2515661573
 
Kh2518061809
Kh2518061809Kh2518061809
Kh2518061809
 
Go2511931200
Go2511931200Go2511931200
Go2511931200
 
Gl2511741181
Gl2511741181Gl2511741181
Gl2511741181
 
Fy2510831089
Fy2510831089Fy2510831089
Fy2510831089
 
Lr2520282033
Lr2520282033Lr2520282033
Lr2520282033
 
Ko2518481855
Ko2518481855Ko2518481855
Ko2518481855
 
Ek25835845
Ek25835845Ek25835845
Ek25835845
 
F25023026
F25023026F25023026
F25023026
 
Ep31931940
Ep31931940Ep31931940
Ep31931940
 
Derecho a la vivienda
Derecho a la viviendaDerecho a la vivienda
Derecho a la vivienda
 
06 colisao final
06 colisao final06 colisao final
06 colisao final
 
Matrizproyecto Aprendizaje
Matrizproyecto AprendizajeMatrizproyecto Aprendizaje
Matrizproyecto Aprendizaje
 
matris
matrismatris
matris
 
Ii2514901494
Ii2514901494Ii2514901494
Ii2514901494
 

Similar to Fu2510631066

SECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATION
SECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATIONSECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATION
SECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATIONIJNSA Journal
 
Flexible bloom for searching textual content
Flexible bloom for searching textual contentFlexible bloom for searching textual content
Flexible bloom for searching textual contentUvaraj Shan
 
Flexible Bloom for Searching Textual Content Based Retrieval System in an Uns...
Flexible Bloom for Searching Textual Content Based Retrieval System in an Uns...Flexible Bloom for Searching Textual Content Based Retrieval System in an Uns...
Flexible Bloom for Searching Textual Content Based Retrieval System in an Uns...Uvaraj Shan
 
Flexible bloom for searching textual content
Flexible bloom for searching textual contentFlexible bloom for searching textual content
Flexible bloom for searching textual contentUvaraj Shan
 
Analyse the performance of mobile peer to Peer network using ant colony optim...
Analyse the performance of mobile peer to Peer network using ant colony optim...Analyse the performance of mobile peer to Peer network using ant colony optim...
Analyse the performance of mobile peer to Peer network using ant colony optim...IJCI JOURNAL
 
Study on security and quality of service implementations in p2 p overlay netw...
Study on security and quality of service implementations in p2 p overlay netw...Study on security and quality of service implementations in p2 p overlay netw...
Study on security and quality of service implementations in p2 p overlay netw...eSAT Publishing House
 
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...ijcsity
 
Application independent based multicast routing protocols in mobile ad hoc ne...
Application independent based multicast routing protocols in mobile ad hoc ne...Application independent based multicast routing protocols in mobile ad hoc ne...
Application independent based multicast routing protocols in mobile ad hoc ne...Alexander Decker
 
Dynamic Layer Management in Super-Peer Architectures
Dynamic Layer Management in Super-Peer ArchitecturesDynamic Layer Management in Super-Peer Architectures
Dynamic Layer Management in Super-Peer ArchitecturesZhenyun Zhuang
 
International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)IJERD Editor
 
The International Journal of Engineering and Science (IJES)
The International Journal of Engineering and Science (IJES)The International Journal of Engineering and Science (IJES)
The International Journal of Engineering and Science (IJES)theijes
 
Privacy Enhancement of Node in Opportunistic Network by Using Virtual-Id
Privacy Enhancement of Node in Opportunistic Network by Using Virtual-Id  Privacy Enhancement of Node in Opportunistic Network by Using Virtual-Id
Privacy Enhancement of Node in Opportunistic Network by Using Virtual-Id ijsc
 
Clustering effects on wireless mobile ad hoc networks performances
Clustering effects on wireless mobile ad hoc networks performancesClustering effects on wireless mobile ad hoc networks performances
Clustering effects on wireless mobile ad hoc networks performancesijcsit
 
International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)ijceronline
 

Similar to Fu2510631066 (20)

84 88
84 8884 88
84 88
 
Cs24613620
Cs24613620Cs24613620
Cs24613620
 
Fa25939942
Fa25939942Fa25939942
Fa25939942
 
Lt2520382043
Lt2520382043Lt2520382043
Lt2520382043
 
SECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATION
SECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATIONSECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATION
SECURITY CONSIDERATION IN PEER-TO-PEER NETWORKS WITH A CASE STUDY APPLICATION
 
Flexible bloom for searching textual content
Flexible bloom for searching textual contentFlexible bloom for searching textual content
Flexible bloom for searching textual content
 
Flexible Bloom for Searching Textual Content Based Retrieval System in an Uns...
Flexible Bloom for Searching Textual Content Based Retrieval System in an Uns...Flexible Bloom for Searching Textual Content Based Retrieval System in an Uns...
Flexible Bloom for Searching Textual Content Based Retrieval System in an Uns...
 
Flexible bloom for searching textual content
Flexible bloom for searching textual contentFlexible bloom for searching textual content
Flexible bloom for searching textual content
 
Analyse the performance of mobile peer to Peer network using ant colony optim...
Analyse the performance of mobile peer to Peer network using ant colony optim...Analyse the performance of mobile peer to Peer network using ant colony optim...
Analyse the performance of mobile peer to Peer network using ant colony optim...
 
Study on security and quality of service implementations in p2 p overlay netw...
Study on security and quality of service implementations in p2 p overlay netw...Study on security and quality of service implementations in p2 p overlay netw...
Study on security and quality of service implementations in p2 p overlay netw...
 
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...
ANALYSE THE PERFORMANCE OF MOBILE PEER TO PEER NETWORK USING ANT COLONY OPTIM...
 
328 334
328 334328 334
328 334
 
E0942531
E0942531E0942531
E0942531
 
Application independent based multicast routing protocols in mobile ad hoc ne...
Application independent based multicast routing protocols in mobile ad hoc ne...Application independent based multicast routing protocols in mobile ad hoc ne...
Application independent based multicast routing protocols in mobile ad hoc ne...
 
Dynamic Layer Management in Super-Peer Architectures
Dynamic Layer Management in Super-Peer ArchitecturesDynamic Layer Management in Super-Peer Architectures
Dynamic Layer Management in Super-Peer Architectures
 
International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)International Journal of Engineering Research and Development (IJERD)
International Journal of Engineering Research and Development (IJERD)
 
The International Journal of Engineering and Science (IJES)
The International Journal of Engineering and Science (IJES)The International Journal of Engineering and Science (IJES)
The International Journal of Engineering and Science (IJES)
 
Privacy Enhancement of Node in Opportunistic Network by Using Virtual-Id
Privacy Enhancement of Node in Opportunistic Network by Using Virtual-Id  Privacy Enhancement of Node in Opportunistic Network by Using Virtual-Id
Privacy Enhancement of Node in Opportunistic Network by Using Virtual-Id
 
Clustering effects on wireless mobile ad hoc networks performances
Clustering effects on wireless mobile ad hoc networks performancesClustering effects on wireless mobile ad hoc networks performances
Clustering effects on wireless mobile ad hoc networks performances
 
International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)International Journal of Computational Engineering Research(IJCER)
International Journal of Computational Engineering Research(IJCER)
 

Recently uploaded

Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1DianaGray10
 
Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024D Cloud Solutions
 
AI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity WebinarAI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity WebinarPrecisely
 
9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding Team9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding TeamAdam Moalla
 
UiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPathCommunity
 
UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7DianaGray10
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UbiTrack UK
 
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...DianaGray10
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...Aggregage
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdfPedro Manuel
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesMd Hossain Ali
 
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfJamie (Taka) Wang
 
Igniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration WorkflowsIgniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration WorkflowsSafe Software
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1DianaGray10
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemAsko Soukka
 
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDEADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDELiveplex
 
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Will Schroeder
 

Recently uploaded (20)

Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1Secure your environment with UiPath and CyberArk technologies - Session 1
Secure your environment with UiPath and CyberArk technologies - Session 1
 
Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024Artificial Intelligence & SEO Trends for 2024
Artificial Intelligence & SEO Trends for 2024
 
AI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity WebinarAI You Can Trust - Ensuring Success with Data Integrity Webinar
AI You Can Trust - Ensuring Success with Data Integrity Webinar
 
9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding Team9 Steps For Building Winning Founding Team
9 Steps For Building Winning Founding Team
 
UiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation DevelopersUiPath Community: AI for UiPath Automation Developers
UiPath Community: AI for UiPath Automation Developers
 
UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7UiPath Studio Web workshop series - Day 7
UiPath Studio Web workshop series - Day 7
 
201610817 - edge part1
201610817 - edge part1201610817 - edge part1
201610817 - edge part1
 
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
UWB Technology for Enhanced Indoor and Outdoor Positioning in Physiological M...
 
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
Connector Corner: Extending LLM automation use cases with UiPath GenAI connec...
 
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
The Data Metaverse: Unpacking the Roles, Use Cases, and Tech Trends in Data a...
 
Nanopower In Semiconductor Industry.pdf
Nanopower  In Semiconductor Industry.pdfNanopower  In Semiconductor Industry.pdf
Nanopower In Semiconductor Industry.pdf
 
20150722 - AGV
20150722 - AGV20150722 - AGV
20150722 - AGV
 
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just MinutesAI Fame Rush Review – Virtual Influencer Creation In Just Minutes
AI Fame Rush Review – Virtual Influencer Creation In Just Minutes
 
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
activity_diagram_combine_v4_20190827.pdfactivity_diagram_combine_v4_20190827.pdf
 
Igniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration WorkflowsIgniting Next Level Productivity with AI-Infused Data Integration Workflows
Igniting Next Level Productivity with AI-Infused Data Integration Workflows
 
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1UiPath Platform: The Backend Engine Powering Your Automation - Session 1
UiPath Platform: The Backend Engine Powering Your Automation - Session 1
 
Bird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystemBird eye's view on Camunda open source ecosystem
Bird eye's view on Camunda open source ecosystem
 
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDEADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
ADOPTING WEB 3 FOR YOUR BUSINESS: A STEP-BY-STEP GUIDE
 
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
Apres-Cyber - The Data Dilemma: Bridging Offensive Operations and Machine Lea...
 
20230104 - machine vision
20230104 - machine vision20230104 - machine vision
20230104 - machine vision
 

Fu2510631066

  • 1. Sameer Tuladhar, L. Sumalatha / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue 5, September- October 2012, pp.1063-1066 Replication of Query Messages in the Unstructured Overlays Peer-to-Peer Network Sameer Tuladhar, L. Sumalatha M.Tech.(Student), JNTUK, Kakinada,AP,India. Assistant Professor, JNTUK, Kakinada, AP,India. Abstract— Unstructured peer–to-peer (P2P) In each of the P2P networks, a search mechanism networks are attractive because they impose few needs to be defined so that resources need to be constraints to the participating peers and have a known to be of importance to be used by users. But low maintenance overhead. It provides high the problem arises because of the dynamic nature of resilience and tolerance to the continuous arrival the P2P network which lacks central directory for and departure of nodes. However the current resource location. Moreover current P2P content P2P networks are mostly constricted by on- distribution systems suffer from limitations such as demand content discovery mechanism. The content discovery mechanism only when requested CoQUOS Approach has been suggested over and have no provision for declarations of data items publish-subscribe systems which can they own to other interested peers. Participating continuously notify the new data items, and a peers in the P2P network discover data by means for the peers to advertise contents. circulating queries which are received by other peers Another point that should be considered is churn and respond back if it has any matching data. But which is the phenomenon of dynamic nature of the shortcoming is that these queries are not cached entry and departure of peers in the P2P network. in the overlays network which results in the network Thus the churn significantly affects the search to forget the query once it completed circulation. mechanism in the P2P networks leading to Besides these limitations P2P networks must also question the effectiveness and reliability of P2P deal with the churn which is the instantaneous networks. In addition to the two novel connectivity of the peers and intentionally or techniques, namely cluster-resilient random walk unintentionally departing from the network at any algorithm for queries propagation and dynamic instance of time. The more the churn is prevailing in probability-based query registration scheme as the network lesser will be the reliability of the suggested in CoQUOS approach, we suggest the network. message replication of query registrations present on a peer to one or more of its 1.1 Paper Contributions neighbouring peers. For this, a technique called In a P2P network, data and other necessary Frequency Aware Search is suggested that resources are stored in a distributed fashion by the defines a policy for partitioning the search space participating peers of the network which has to be of and a replication policy of keys. This paper any interest to others. However to know whether the elaborates the suggested algorithms through data is available or not and also to inform the theoretical analysis and also reports the interested peers that requested data is available, effectiveness proposed schemes through flooding of message seems to be an easy way out. experimental evaluations. But it results in unnecessary traffic in the network. In this paper we discuss about the CoQUOS Keywords— Peer-to-Peer networks, CoQUOS approach for unstructured overlays network which Approach, Random Walks, Churn, Message not only implements the message forwarding replication without flooding to all the peers but also provides best-effort notification service for the registered 1. INTRODUCTION queries from the peers about the discovery of the Unstructured peer-to-peer networks have required data. The main advantage of this approach been use for quite a long time for content sharing or is that it doesn’t enforce any topological constraints file sharing by the participating nodes. Searching in on the underlying network structure and doesn’t these types of networks is very popular these days. require any complex index structures of routing Overlays networks form virtual topologies on top of mechanism. On top of these features, this paper an underlying network as the links in the overlay deals with a search algorithm to improve the networks have no correspondence with links negative impacts of the churn by replicating the established in the underlying network. P2P networks messages to the neighbouring peers. This algorithm are the best example of such overlays network. is Frequency-Aware Search (FASE) which is basically a search space partitioning mechanism, 1063 | P a g e
  • 2. Sameer Tuladhar, L. Sumalatha / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue 5, September- October 2012, pp.1063-1066 combined with a replication policy. It also doesn’t in black i.e. {P2, P8, P11} are the beacon nodes and require the rigid network structure or any pre P0 is the requesting peer which may receive multiple routing informations. notifications. The Beacon nodes should be selected in such a manner that they are distributed in every 2. THE CoQUOS SYSTEM OVERVIEW major region of the network such that every other The CoQUOS system is a lightweight peer in the network can reach them in a very small middleware that supports continuous queries and number of hops and they should not be located very announcements/advertisements about discovery of close to each other. data to the requesting peers in the unstructured overlays or simply saying P2P networks. The key 2.2 Cluster Resilient Random Walk features of this system include Cluster Resilient In P2P networks Random Walk message Random Walk (CRW) [3] for forwarding the propagation are more popular than flooding. In this messages to other peers in the network and a approach a peer receives and forwards the message dynamic probability scheme for the registration of to another neighbouring peer at random if its Time- queries in the peers. Continuous query is the means To-Live (TTL) is not expired. Since this message of communication through which the peer registers forwarding is done only one at a time so it reduces its interest to the network. It can be represented as the message traffic in the network in comparison to Q=(SID, Predicate, VTime), which is actually a the flooding. However with the networks with high tuple consisting of SourceID(SID) that identifies the degree of clustering of nodes, there is a greater requesting peer, a query predicate(Predicate) for chance the message gets trapped within the cluster matching condition of the query with the requested and its TTL gets expired before it come outs of the data and validity time(VTime) which is the lifetime cluster. To overcome this drawback, CoQUOS of interest of the requesting peer. system suggests a technique called Cluster Resilient Random Walk (CRW). This technique considers the 2.1.1 Design concept of two peers being in the same cluster if The CoQUOS system maintains each they have the large number of common neighbours. continuous query at one or more peers in the So CRW forwards messages to those nodes which network. The main objective of this system is to have less neighbours in common by calculating the achieve high notification success rate for the query probability of nodes being not in the same cluster. individually for the peer as well as overall for the Thus a peer has to compute the overlap between its complete network. The figure below shows the neighbours list and those of each of its neighbours, design of the CoQUOS system. and make message forwarding decisions. Let NbrList(Pj) denote the list of A Announcement neighbours of Pj and Pk,Pk+1,Pk+2...,Pk+l denote the neighbours of the node Pj. UniqueNbrs(Pk+1,Pj) N Notification denote the set of neighbouring peers of Pk+1 that are 5 not the neighbours of Pj. Suppose the node Pj A receives a query message from a neighbouring peer Beacon A 1 Pk. The probability[3] of a neighbour Pk+1 receiving 2 6 4 A the message in the next hop can be calculated as UniqueNbrs P k +1 ,P j A λ 1 NbrsList P k +1 Source 0 7 5 FwdProbability(Pk+1) = C 3 Beacon A A UniqueNbrs P l ,P j λ NbrList Pl N 1 A The propagation of query in CRW starts with source A 1 4 peer creating a query message initializing its TTL to 1 1 1 6 A a default value. Each peer along the query’s path Beacon 2 9 1 forward the message to one of their neighbours 8 1 2 according to their FwdProbability values. The TTL 3 Fig.1. CoQUOS System 0 Overview is then decremented at each hop until it becomes E zero. The Fig. 2. [3] given below illustrates CRW If a continuous query Qm is registered at a peer Pi, message forwarding in a single step. The query then Pi is called beacon node which implicitly takes message is at the node p4 and λ which controls the the responsibility of notifying the source node of extent of the bias is set to 2. The numbers on the any matching data items that it might discover edges indicate the probabilities of forwarding the through incoming peer advertisements and checks query along that link. It has been observed that with the registered query if anything matches to CRW is better than normal random walks and provide notification to the requesting node about the flooding techniques in forwarding messages to availability of the data. In the figure the peers shown various regions of the P2P overlays. 1064 | P a g e
  • 3. Sameer Tuladhar, L. Sumalatha / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue 5, September- October 2012, pp.1063-1066 over unstructured network which works well by replication of queries with CRW technique. 4. FREQUENCY AWARE SEARCH This technique defines a policy for dividing the search space in the network and a key replication policy. The term frequency [6] is defined to be any element of a finite and discrete set Φ. We define functions fN: N→ Φ and fK: K→ Φ mapping respectively the set of nodes (N) and keys (K) in frequencies. A pointer is a tuple defined as follows: 2.3 Dynamic Query Registration Pointer: <Key,URL> This technique is based on the dynamic probability of the peers to decide the registration of In a pointer, a key identifies the item and an queries on their own will. The registration URL is an unique node address where the query will probability of a query varies as the query traverses be replicated. FASE improves search results by along its path depending on whether the query has having nodes to forward random walks preferably to been registered or not at the nodes it visited in the nodes in the same frequency of the search key. This recent past. Thus if it has been registered at the node algorithm assumes that majority of nodes in the in the recent past the probability of getting overlay have a constant degree. registered in the next hop will be low and vice versa. The registration probability [3] value of 4.1. Pointer Replication each message Qm is denoted as (Rp(Qm)). This value In order to reduce the impact of churn and is set to an initial value when a peer issues a query. properly facilitate item location, nodes replicate If a peer registers this query, then it resets the value pointers using replication messages which carry one of Rp(Qm) to the default initial value, before or more pointers with keys of the same frequency. forwarding to its neighbours. However if the peer For the message MR let fK(MR) be the frequency of choose not to register the query then it increments the keys being carried. These replication messages Rp(Qm) by a pre-specified amount and forwards to carry a counter that defines the maximum number of the neighbour. That means the Rp(Qm) value keeps replicas of each pointer to be stored. Every peer that on incrementing until it gets registered wherein decides to store pointer decrements the replica there will be sudden fall of point to the initial value. counter and when the counter becomes 0 the This technique helps in controlling the number of message is discarded. Replication messages are beacon nodes where such query registration is done. forwarded to those neighbours who have not been visited previously. Since the replication message is 3. NETWORK OVERLAY CHURN preferably forwarded to nodes labelled with the The very dynamic nature of P2P networks same frequency of the item, only one pointer is means that there will be number of nodes that will stored for the whole path that contains number of be entering and leaving the network at will. This nodes. This leads to the efficiency in storing the means besides the resource location, P2P networks pointer. The main purpose of this replication method must also cope with the intermittent connectivity of is to make items well available for searches at any the peers in the network to ensure the reliability of point. the overall network and data transfer. If this churn The pointer replication process is is not handled well it can impact the success of illustrated in the Fig. 3 given below. continuous queries and announcements as well. When a node leaves the system properly, its responsibilities are well taken care by the neighbouring peers, but when it happens abruptly, all the query registrations are lost thus it will hamper the notification success rates of the respective queries and the matching announcements will be dropped. In order to resolve this problem one solution is the replication of queries on one or more of its neighbours. For this, the technique called Fig.3. Pointer Replication [6] Frequency- Aware Search (FASE) algorithm can be implemented which is basically a search protocol The above figure shows the path of a replication 1065 | P a g e
  • 4. Sameer Tuladhar, L. Sumalatha / International Journal of Engineering Research and Applications (IJERA) ISSN: 2248-9622 www.ijera.com Vol. 2, Issue 5, September- October 2012, pp.1063-1066 message MR starting at node S. The dotted circles are the nodes in the same frequency of the message. Here node S forwards message to a random neighbour as it has no neighbour in MR frequency, fK(MR) and thus the neighbour in the following hop with fN(n) = fK(MR) will store a pointer. The figure shows that a replication message is always forwarded to unvisited nodes of the same frequency. The nodes labelled with P store the pointer carried by MR. These pointers are stored once per path and the forwarding of MR is stopped once the replica counter reaches 0 or when all the neighbours of the current node have been visited before by MR. Fig.5. Effectiveness of FASE to tackle churn 5. EXPERIMENTAL EVALUATION This section shows the experimental results The mean NSRs which were measured of the simulation of FASE algorithm with CRW when the churn rate is set to 10%, 20% and 30% technique. For this we have simulated a network show that NSRs are high when using FASE than consisting of 1000 nodes. The simulation created without using it. 100 unique data items, from a group of data items in excess of 4000, each advertised by a distinct node 6. CONCLUSION selected at random to the beacon nodes. For Maintaining the network reliability and data evaluation of the algorithm, queries are performed resources available in a P2P network is a challenge for items that are present in the network and are provided its dynamic nature i.e. churns. Although selected uniformly at random. there may not be any perfect solution to tackle this We measured the difference in the problem but the presented Frequency-Aware Search Notification Success Rates (NSR) of overlay algorithm helps to reliably search the data item in network with and without the application of FASE the unstructured overlays networks to very good algorithm with CRW. The Fig.4. and Fig.5. shows extent. Like CoQUOS approach FASE doesn’t the NSRs of the two approaches for which the enforce any restriction on the network structure or registration probability value is set to 0.3. topology. Our evalution shows that with the use of FASE, we can achieve high NSRs even on increasing the churn rate. The results suggest that, the replication policy like FASW helps to increase the availability of searched items. REFERENCES [1] Gnutella P2P Network. www.gnutella .com [2] Wikipedia. http://en.wikipedia.org/wiki/Peer-to-peer [3] L. Ramaswamy, J. Chen. The CoQUOS Approach to Continuous Queries in Fig.4. Comparison of minimum NSR of CRW with Unstructured Overlays. IEEE Transactions and without use of FASE on Knowledge and Data Engineering, 2011. In this experiment, the minimum NSRs of [4] L. Ramaswamy, J. Chen and Piyush Parate. CRW were set to different values with the use of CoQUOS: Lightweight Support for FASE and without FASE and the results show that Continuous Queries in Unstructured there is significant benefit in the NSR with the use Overlays. IEEE 2007. of FASE yielding reasonable NSR even at relatively [5] J. Chen, L. Ramaswamy and A. Meka. low initial TTL values. Message Diffusion in Unstructured We also checked the effectiveness of the Overlay Networks. In Proceedings of NCA, CRW with and without using FASE to evaluate the 2007 effect of churn. The Fig.5. shows the results of the [6] Pedro Fonseca. Search Strategies in experiment. Unstructured Overlays 1066 | P a g e