FORNT APGES

7/28/2019 FORNT APGES

1/10

The CoQouS Approach to Continuous Queries in

Unstructured Overlays

A Thesis Report

Submitted in partial fulfillment of

Requirement for the award of the degree of

MASTER OF TECHNOLOGY

IN

COMPUTER SCIENCE AND ENGINEERING

(COMPUTER NETWORKS)Under the esteemed guidance of

Mr. M.Vijaya Bhaskar, Associate.prof

Submitted by

D.V.S.DeepakReg.No:10H91D8801

ISO 9001-2000 Certified Institute

GOKULINSTITUTE OF TECHNOLOGY AND

SCIENCES(Affiliated to Jawaharlal Nehru Technological University, Kakinada)PIRIDI,

BOBBILI, VIZIANAGARAM, A.P.

i


2/10

2010-2012

DECLARATION

I Mr.D.V.S.Deepak, bearing Reg.No: 10H91D8801, hereby

declare that the project work entitled THE COQOUS APPROACH TO

CONTINUOUS QUERIES IN UNSTRUCTURED OVERLAYS is an

original work done by me and in partial fulfillment for the award of

Master of Technology in Computer Science And Engineering

(Computer Networks) (CSCN) under the guidance ofMr.M.Vijaya

Bhaskar, Associate Professor, Dept of CSE, Gokul Institute of

Technology & Sciences.

This is a record of bonafide work carried out by me and the

results embodied in this project have not been reproduced or copied

from any source.

D.V.S.Deepak

(10H91D8801)

ii


3/10

GOKULINSTITUTE OF TECHNOLOGY AND

SCIENCES(Affiliated to Jawaharlal Nehru Technological University, Kakinada)

PIRIDI, BOBBILI, VIZIANAGARAM, Andhra Pradesh.(An ISO 9001-2000 Certified Institution)

CERTIFICATE

This is to certify that it is a bonafied record of project

entitled The CoQuous Approach to Continuous Queries in

Unstructured Overlays done by Mr. D.V.S.Deepakbearing Reg .No:

10H91D880 1 during the years 2010-2012 in partial fulfillment of the

requirements for the award of degree of Master of Technology in

Computer Science & Engineering (Computer Networks) in GOKUL

INSTITUTE OF TECHNOLOGY AND SCIENCES, Bobbili Affiliated

to J.N.T. University, Kakinada.

PROJECT GUIDE HEAD OF THE DEPARTMENT

iii


4/10

EXTERNAL EXAMINER

ACKNOWLEDGEMENT

I feel to render our thankful acknowledgement to the following distinguished

personalities, who stretched their helping hand to me, in completing my project work.

I am very grateful and our sincere thanks to ourSecretary Mrs. B. JAYASHREE of

GOKUL INSTITUE OF TECHNOLOGYAND SCIENCES giving this opportunity.

I hereby express my regards and extend my gratitude to our Principal Dr.

S.SRINIVASAN, for giving this opportunity to do the project as a part of M.Techcourse.

I consider it our privilege to express our deepest gratitude to Mr. M.VJAYA

BHASKAR, Head of the department for his valuable suggestions and constant

motivation that greatly helped the project work to get successfully completed.

And I am thankful to our Project guide Mr. M.VIJAYA BHASKAR, who has

channeled our thoughts and timely suggestions. I would also like to express my sincere

thanks to all the staff members of Dept of CSE, GITAS for their kind cooperation and

timely help during my academic career.

Finally I thank each and everyone who helped us to complete our project

with their support.

iv


5/10

D.V.S.Deepak

(10H91D8801)

ABSTRACT

v


6/10

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 loadamong the peers. This paper studies the properties of our algorithms through theoretical

vi


7/10

analysis. We also report series of experiments evaluating the effectiveness and the costs

of the proposed schemes.

INDEX

CONENTS PAGE No1.INTRODUCTION------------------------------------------------------- 1

2.LITERATURE SURVEY --------------------------------------------- 3

3. SYSTEM ANALYSIS--------------------------------------------------- 4

3.1 EXISTING SYSTEM-------------------------------------------------- 4

3.2 PROPOSED SYSTEM------------------------------------------------- 5

3.3 MODULE DESCRIPTION-------------------------------------------- 6

4. SYSTEM SPECIFICATIONS-------------------------------------- 10

5. SYSTEM STUDY----------------------------------------------------- 11

5.1FEASIBILITY STUDY------------------------------------------------

11

6. SOFTWARE ENVIRONMENT---------------------------------- 12

vii


8/10

7. NETWORKING------------------------------------------------------ 22

INDEXCONENTS PAGE No

8. SYSTEM DESIGN----------------------------------------------------- 30

8.1 INTRODUCTION------------------------------------------------------- 30

8.2 DATAFLOW DIAGRAMS-------------------------------------------- 30

9. UML DIAGRAMS--------------------------------------------------------------- 38

9.1 INTRODUCTION------------------------------------------------------- 38

9.2 THINGS IN UML---------------------------------------------------- 38

10. SCREEN SHOTS----------------------------------------------------- 51

11. CODING---------------------------------------------------------------- 56

11 .1 SAMPLE CODE------------------------------------------------------- 56

12. SYSTEM TESTING ------------------------------------------------- 83

12.1 UNIT TESTING----------------------------------------------------------- 83

12.2 FUNCTIONAL TEST--------------------------------------------------- 85

12.3TEST CASES------------------------------------------------------------- 87

viii


9/10

13. CONCLUSION------------------------------------------------------- 88

14. BIBLOGRAPHY----------------------------------------------------- 89

ix


10/10

x

Documents

FORNT APGES