Scribd Logo
Upload

Welcome to Scribd!

  • 51 views

    The CoQUOS Approach To Continuous Final

    Uploaded by

    Anonymous iCFJ73OMpD
    The document proposes a system called CoQUOS that supports continuous queries in unstructured peer-to-peer networks. CoQUOS aims to provide long-term interest registration and content notification capabilities without requiring complex indexing and routing schemes. It does this through a best-effort continuous query model rather than a full-fledged publish-subscribe system. The key techniques used in CoQUOS include cluster-resilient random walks for query propagation, dynamic probability-based registration to distribute queries, and passive replication to improve resilience to network churn. The document evaluates the performance and costs of the CoQUOS system through theoretical analysis and simulation experiments.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    The CoQUOS Approach To Continuous Final

    Uploaded by

    Anonymous iCFJ73OMpD
    51 views20 pages
    The document proposes a system called CoQUOS that supports continuous queries in unstructured peer-to-peer networks. CoQUOS aims to provide long-term interest registration and content notification capabilities without requiring complex indexing and routing schemes. It does this through a best-effort continuous query model rather than a full-fledged publish-subscribe system. The key techniques used in CoQUOS include cluster-resilient random walks for query propagation, dynamic probability-based registration to distribute queries, and passive replication to improve resilience to network churn. The document evaluates the performance and costs of the CoQUOS system through theoretical analysis and simulation experiments.

    Original Description:

    djfng

    Original Title

    The CoQUOS Approach to Continuous Final (1)

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document proposes a system called CoQUOS that supports continuous queries in unstructured peer-to-peer networks. CoQUOS aims to provide long-term interest registration and content notification capabilities without requiring complex indexing and routing schemes. It does this through a best-effort continuous query model rather than a full-fledged publish-subscribe system. The key techniques used in CoQUOS include cluster-resilient random walks for query propagation, dynamic probability-based registration to distribute queries, and passive replication to improve resilience to network churn. The document evaluates the performance and costs of the CoQUOS system through theoretical analysis and simulation experiments.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    51 views20 pages

    The CoQUOS Approach To Continuous Final

    Uploaded by

    Anonymous iCFJ73OMpD
    The document proposes a system called CoQUOS that supports continuous queries in unstructured peer-to-peer networks. CoQUOS aims to provide long-term interest registration and content notification capabilities without requiring complex indexing and routing schemes. It does this through a best-effort continuous query model rather than a full-fledged publish-subscribe system. The key techniques used in CoQUOS include cluster-resilient random walks for query propagation, dynamic probability-based registration to distribute queries, and passive replication to improve resilience to network churn. The document evaluates the performance and costs of the CoQUOS system through theoretical analysis and simulation experiments.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    You are on page 1of 20

    The CoQUOS Approach to

    Continuous Queries in
    Unstructured Overlays

    ABSTRACT
    The current peer-to-peer (P2P) content distribution systems are

    constricted by their simple on-demand content discovery mechanism.


    The utility of these systems can be greatly enhanced by incorporating
    two capabilities, namely a mechanism through which peers can register
    their long term interests with the network so that they can be
    continuously notified of new data items, and a means for the peers to
    advertise their contents. Although researchers have proposed a few
    unstructured overlay-based publish-subscribe systems that provide the
    above capabilities, most of these systems require intricate indexing and
    routing schemes, which not only make them highly complex but also
    render the overlay network less flexible toward transient peers.

    This paper argues that for many P2P applications, implementing full-

    fledged publish-subscribe systems is an overkill. For these applications,


    we study the alternate continuous query paradigm, which is a best-effort
    service providing the above two capabilities. We present a scalable and
    effective middleware, called CoQUOS, for supporting continuous queries
    in unstructured overlay networks. Besides being independent of the
    overlay topology, CoQUOS preserves the simplicity and flexibility of the
    unstructured P2P network. Our design of the CoQUOS system is
    characterized by two novel techniques, namely cluster-resilient random
    walk algorithm for propagating the queries to various regions of the
    network and dynamic probability-based query registration scheme to
    ensure that the registrations are well distributed in the overlay. Further,
    we also develop effective and efficient schemes for providing resilience to
    the churn of the P2P network and for ensuring a fair distribution of the
    notification load among the peers. This paper studies the properties of
    our algorithms through theoretical analysis. We also report series of
    experiments evaluating the effectiveness and the costs of the proposed
    schemes

    EXISTING SYSTEM
    Despite their popularity, most of the current unstructured P2P content

    distribution systems suffer from certain serious limitations. One such


    limitation is their simple, on demand mechanism for content discovery.
    Peers in these systems discover data items by circulating queries within
    the overlay network. A peer receiving a query responds back to the
    initiating node if it has any matching content. Upon processing a query,
    the recipient node removes it from its local buffers1. Thus, a query
    expires after it completes its circulation within the network. In other
    words, the network forgets the queries once they have completed their
    circulation. For clarity purposes, we call this the ad hoc query model,
    and we refer to the queries as ad hoc queries.

    PROPOSED SYSTEM
    We focus on an alternate notification paradigm called the continuous query

    model. Similar to content-based pub-sub systems this model provides a


    mechanism through which peers can register their queries, which are
    maintained in the network for extended durations of time. However, in contrast
    to traditional pub-sub model, a system implementing the continuous query
    model provides a best-effort notification service for the registered queries
    informing their initiating nodes of new content that may have been added in
    the recent past.

    Peers in these systems discover data items by circulating queries within the
    overlay network. A peer receiving a query responds back to the initiating node if
    it has any matching content. Upon processing a query, the recipient node
    removes it from its local buffers1. Thus, a query expires after it completes its
    circulation within the network. In other words, the network forgets the queries
    once they have completed their circulation. For clarity purposes, we call this the
    ad hoc query model, and we refer to the queries as ad hoc queries.

    MODULES
    Cluster Resilient Random Walk
    Dynamic Probability Scheme
    Passive Replication
    Overlay Churn

    SYSTEM REQUIREMENT SPECIFICATIONS


    Hardware Requirements
    Processor
    : Pentium IV
    RAM
    : 256 MB
    Hard Disk
    : 40 GB
    Software Requirements
    Operating System
    : Windows XP
    Application Server : Tomcat5.5
    Front End
    : Java
    Database
    : Mysql

    USE CASE DIAGRAM

    Registration

    Login

    Server

    Search

    Authorize

    Give data

    Peer

    SEQUENCE DIAGRAM
    Server

    Peer1

    Peer2

    Query Send to Server


    Query Send to Server
    Query Send to Server
    Query Send to Server

    Send Matching Query to Peer


    Send Matching Query to Peer
    Send Matching Query to Peer
    Send Matching Query to Peer

    Peer3

    Peer4

    CLASS DIAGRAM
    Peer1
    Query Recive: String
    Search any query : String
    Query Send: String
    Response Server: String
    Accept()
    Readline()
    Buffer String()

    Peer2
    Query Recive: String
    Search any query : String
    Query Send: String
    Response Server: String
    Server
    Query Receive: String

    Accept()
    Readline()
    Buffer String()

    Query Search Neighbor: String


    Peer3
    Accept()
    Readline()

    Query Recive: String


    Search any query : String
    Query Send: String
    Response Server: String

    Buffer String()
    Accept()
    Readline()
    Buffer String()

    Peer4
    Query Recive: String
    Search any query : String
    Query Send: String
    Response Server: String
    Accept()
    Readline()
    Buffer String()

    ACTIVITY DIAGRAM

    Server Sening matching Query

    Peer1

    Search Query

    Continuous Process
    Peer2

    Search Query

    Search Query

    Peer4

    Peer3
    Search Query

    STATE CHART DIAGRAM


    Start

    Query Processing

    Peer Send Request

    Server Response

    Peers get exact information from server

    Continuous Process
    Final

    SCREENS

    SERVER REGISTRATION

    SERVER LOGIN

    PEER REGISTRATION

    PEER STATUS

    BOOK REGISTRATION

    CONCLUSION
    Mechanisms that enable individual peers of unstructured P2P content sharing

    networks to register longstanding queries and receive notification when new


    matching items appear can significantly improve their utility and effectiveness.
    While the pub-sub paradigm can provide this capability, implementing pub-sub
    systems on unstructured overlays is often a very complex endeavor. The
    continuous query paradigm studied in this paper is similar to pub-sub, but it
    provides best effort notification service. We presented the design and
    evaluation of a lightweight system, called CoQUOS, which supports continuous
    queries in unstructured P2P networks. The CoQUOS system incorporates
    several novel features such as cluster resilient random walk for query
    propagation, dynamic probability scheme for query registration, and a lazy
    replication technique for countering network churn. The proposed techniques
    have been evaluated through theoretical analysis and simulation-based
    experiments.

    THANK YOU

    You might also like