Project of Vtu

Dynamic Search Algorithm in unstructured peer-to-peer network
DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED PEER-TO-PEER NETWORK ABSTRACT:

Designing efficient search algorithms is a key challenge in unstructured peer-topeer networks. Flooding and random walk (RW) are two typical search algorithms. Flooding searches aggressi ely and co ers the most nodes. !owe er" it generates a large amount of #uery messages and" thus" does not scale. RW searches conser ati ely. RW only generates a fi$ed amount of #uery messages at each hop %ut would take longer search time. &he Dynamic Search Algorithm" which is a generali'ation of flooding and RW. DS takes ad antage of arious conte$ts under which each pre ious search algorithm performs well. (t resem%les flooding for short-term search and RW for long-term search. Analy'e the performance of DS %ased on some performance metrics including the success rate" search time" #uery hits. )umerical results show that DS pro ides a good tradeoff %etween search performance and cost. DS performs %etter than flooding and RW in simulation work.
VTU, BELGAUM
Page 1
PROJECT SYNOPSIS
AIM:
&he main aim of this pro*ect is the Dynamic search (DS) algorithm" which is a generali'ation of flooding and RW. DS takes ad antage of arious conte$ts under which each pre ious search algorithm performs well. (t resem%les flooding for short-term search and RW for long-term search.
Presen T!e"r#:
(n this pro*ect e$isting systems are two different algorithms those are" +. Flooding Algorithm ,. Random Walk (RW) Algorithm
Flooding Algorithm:
-y this method" the #uery source sends its #uery messages to all of its neigh%ors. When a node recei es a #uery message" it first checks if it has the #ueried resource. (f yes" it sends a response %ack to the #uery source to indicate a #uery hit .therwise" it sends the #uery messages to all of its neigh%ors" e$cept for the one the #uery message comes from.
D$sa%&an age '(""%$ng A(g"r$ !):

&he draw%ack of flooding is the search cost.
VTU, BELGAUM
Page *

Flooding searches aggressi ely and co ers the most nodes. Flooding %elongs to -est First Search algorithm. (t generates a large amount of #uery messages %ut would take short term search. &he search is especially inefficient when the target is far from the #uery source %ecause the num%er of #uery messages would grow e$ponentially with the hop counts.
Ran%") Wa(+ ,RW- A(g"r$ !):

-y RW" the #uery source *ust sends one #uery message (walker) to one of its neigh%ors. (f this neigh%or does not own the #ueried resource" it keeps on sending the walker to one of its neigh%ors" e$cept for the one the #uery message comes from" and thus" the search cost is reduced.
D$sa%&an age RW A(g"r$ !):

&he main draw%ack of RW is the long search time. RW only isits one node for each hop" the co erage of RW /01 grows linearly with hop counts" which is slow compared with the e$ponential growth of the co erage of flooding.
1.* Pr"/"se% W"r+:

(n this pro*ect propose the dynamic search (DS) algorithm" which is a
generali'ation of flooding and RW. DS o ercomes the disad antages of flooding and RW and takes ad antage of different conte$ts under which each search algorithm performs well. &he operation of DS resem%les flooding for the short-term search and RW for the long-term search
A%&an age DS A(g"r$ !):

VTU, BELGAUM
Page 0

DS performs a%out ,2 times %etter than flooding and 23 times %etter than RW in power-law graphs. DS performs a%out +34 times %etter than flooding and +,5 times %etter than RW in %imodal topologies DS reduces search cost" time and impro es performance.
C!a/ er 1 INTRODUCTION
An unstructured 6,6 network is formed when the o erlay links are esta%lished ar%itrarily. Such networks can %e easily constructed as a new peer that wants to *oin the network can copy e$isting links of another node and then form its own links o er time. (n an unstructured 6,6 network" if a peer wants to find a desired piece of data in the network" the #uery has to %e flooded through the network to find as many peers as possi%le that share the data. 6opular content is likely to %e a aila%le at se eral peers and any peer searching for it is likely to find the same thing. -ut if a peer is looking for rare data shared %y only a few other peers" then it is highly unlikely that search will %e successful. Since there is no correlation %etween a peer and the content managed %y it" there is no guarantee that flooding will find a peer that has the desired data. Flooding also causes a high amount of signaling traffic in the network and hence such networks typically ha e ery poor search efficiency. 7any of the popular 6,6 networks are unstructured.
VTU, BELGAUM
Page 1

(n pure 6,6 networks8 6eers act as e#uals" merging the roles of clients and ser er. (n such networks" there is no central ser er managing the network" neither is there a central router. Some e$amples of pure 6,6 Application 9ayer networks designed for file sharing are :nutella (pre 5.0) and Freenet. &here also e$ist hy%rid 6,6 systems" which distri%ute their clients into two groups8 client nodes and o erlay nodes. &ypically" each client is a%le to act according to the momentary need of the network and can %ecome part of the respecti e o erlay network used to coordinate the 6,6 structure. &his di ision %etween normal and ;%etter; nodes is done in order to address the scaling pro%lems on early pure 6,6 networks. <$amples for such networks are for e$ample :nutella (after 5.0) or :,. Another type of hy%rid 6,6 network are networks using on the one hand central ser er(s) or %ootstrapping mechanisms" on the other hand 6,6 for their data transfers.
C!a/ er * LITERATURE SUR2EY

D. S 3 45a6!7 R. Re8a$e7 N. D399$e(%7 S. Sen7 an% W. W$(($nger =Sampling &echni#ues for 9arge" Dynamic :raphs>-, A/r. *::;.(n this paper" addresses the common pro%lem of selecting representati e samples of peer properties such as peer degree" link %andwidth" or the num%er of files shared. A good sampling techni#ue will select any of the peers present with e#ual pro%a%ility. !owe er" common sampling techni#ues introduce %ias in two ways. First" the dynamic nature of peers can %ias results towards short-li ed peers" much as nai ely sampling flows in a router can lead to %ias towards short-li ed flows second" the heterogeneous o erlay topology can lead to %ias towards high-degree peers. 6resent preliminary e idence suggesting that applying a degree-correction method to random walk-%ased peer selection leads to un%iased sampling" at the e$pense of a loss of efficiency. C!r$s "s G+an s$%$s7 M$(ena M$!a$( 7=!y%rid Search Schemes for ?nstructured
VTU, BELGAUM
Page <

6eer- to-6eer )etworks>-,*::0(n &his paper study hy%rid search schemes for unstructured peer-to-peer networks. We #uantify performance in terms of num%er of hits" network o erhead" and response time. .ur schemes com%ine flooding and random walks" look ahead and replication. @onsider %oth regular topologies and topologies with super nodes. (ntroduce a general search scheme" of which flooding and random walks are special instances" and show how to use locally maintained network information to impro e the performance of searching. .ur main findings are8 (a)A small num%er of super nodes in an otherwise regular topology can offer sharp sa ings in the performance of search" %oth in the case of search %y flooding and search %y random walk" particularly when it is com%ined with +step replication. (%)&here is a generali'ation of search" of which flooding and random walk are special instances" which may take further ad antage of locally maintained network information" and yield %etter performance than %oth flooding and random walk in clustered topologies. &he method determines edge criticality and is reminiscent of fundamental heuristics from the area of appro$imation algorithms. Na5!en%ra B$sn$+ an% A(!3sse$n A5"34e$%7 =7odeling and Analysis of Random Walk Search Algorithms in 6,6 )etworks>-,*::1(n this paper de elop a model for random walk search mechanism in unstructured 6,6 networks. ?sing the model we o%tain analytical e$pressions for the performance metrics of random walk search in terms of the popularity of the resource %eing searched for and the parameters of random walk. 6ropose an e#uation %ased adapti e search mechanism that uses estimate of popularity of a resource in order to choose the parameters of random walk such that a targeted performance le el is achie ed %y the search. 6ropose a low-o erhead method for maintaining an estimate of popularity that utili'es feed%ack (or lack there-off) o%tained from pre ious searches. Simulation results show that the performance of e#uation %ased adapti e search is significantly %etter than the non-adapti e random walk. Pe$ Ca"7 =$n L&7 E%$ ! C"!en =Search and Replication in ?nstructured 6eer-to-peer )etworks>-,*::<VTU, BELGAUM
Page ;

(n this paper" were proposed propose a #uery algorithm %ased on multiple random walks that resol e #ueries almost as #uickly as :nutella;s flooding method while reducing the network e$tract %y two orders of magnitude in many cases.6resent simulation results on a distri%uted replication strategy proposed. Finally" in this paper find that among the arious network topologies" uniform random graphs yield the %est performance.
Jere)# Br"?n7 @$a"8$ang D37 Ken%a(( N#gar%7 =9ightFlood8 7inimi'ing Redundant 7essages and 7a$imi'ing the Scope of 6eer-to-6eer Search>-,*::A) (n the scheme" each peer keeps track of the connecti ityAs of e ery immediate and ne$t indirect neigh%or peers" which can %e ac#uired locally. 9ightFlood identifies the neigh%or with the highest connecti ity and uses the link to that neigh%or to form a su%o erlay within the e$isting 6,6 o erlay. (n 9ightFlood" flooding is di ided into two stages. &he first stage is a standard flooding with a limited num%er of &&9 hops" where a message can spread to a sufficiently large scope with a small num%er of redundant messages. (n the second stage" message propagating is only conducted along the su% o erlay" significantly reducing the num%er of redundant messages. .ur analysis and simulation e$periments show that the 9ightFlood scheme pro ides a low-o erhead %roadcast facility that can %e effecti ely used in 6,6 search.
D$)$ r$"s Ts"3)a+"s7 N$6+ R"3ss"/"3("s7 =Analysis and @omparison of 6,6 Search 7ethods>-,*::A(n this paper popularity and %andwidth consumption attri%uted to current 6eer-to6eer file-sharing applications makes the operation of these distri%uted systems ery important for the (nternet community. <fficient o%*ect disco ery is the first step towards the reali'ation of distri%uted resource-sharing. (n this work" we present a detailed o er iew of recent and e$isting search methods for unstructured 6eer-to-6eer networks.
VTU, BELGAUM
Page A

(n this paper analy'e the performance of the algorithms relati e to arious metrics" gi ing emphasis on the success rate" %andwidth-efficiency and adaptation to dynamic network conditions. Simulation results are used to empirically e aluate the %eha ior of nine representati e schemes under a ariety of different en ironments. Ka"!s$3ng7 Ta$?an7 =!y%rid 6eriodical Flooding in ?nstructured 6eer-to-6eer )etworks>-,*::0-lind flooding is a popular search mechanism used in current commercial 6,6 systems %ecause of its simplicity. !owe er" %lind flooding among peers or super-peers causes large olume of unnecessary traffic although the response time is short. Some impro ed statistics-%ased search mechanisms can reduce the traffic olume %ut also significantly shrink the #uery co erage range. (n some search mechanisms" not all peers may %e reacha%le creating the so-called partial co erage pro%lem. Aiming at alle iating the partial co erage pro%lem and reducing the unnecessary traffic" we propose an efficient and adapti e search mechanism" !y%rid 6eriodical Flooding (!6F). !6F retains the ad antages of statistics-%ased search mechanisms" alle iates the partial co erage pro%lem" and pro ides the fle$i%ility to adapti ely ad*ust different parameters to meet different performance re#uirements. &he effecti eness of !6F is demonstrated through simulation studies. @$a"8$ang D37 Hs$a"-H?a C!en7 Yang @$a"7 M"!sen G3$4an$ " =Search with 6ro%a%ilistic :uarantees in ?nstructured 6eer-to-6eer )etworks>-,*::;(n this paper" present a simple %ut highly effecti e protocol for o%*ect location that gi es pro%a%ilistic guarantees of finding e en rare o%*ects independently of the network topology. &he protocol relies on randomi'ed techni#ues for replication of o%*ects (or their references) and for #uery propagation. (n this paper pro e analytically" and demonstrate e$perimentally" that our scheme pro ides high pro%a%ilistic guarantees of success" while incurring minimal o erhead. &he #uantify the performance of our scheme in terms of network messages" pro%a%ility of success" and response time. < aluate the ro%ustness of our protocol in the presence of node failures (departures).
VTU, BELGAUM
Page B
N$)a Sars!ar7 P. Os6ar B"#+$n7 =7odels and languages for o erlay networks>-,*::B(n &his paper presents . er79" a high-le el o erlay specification language that is independent of specific frameworks. &he underlying system model" named B)ode CiewsB" a%stracts from low-le el issues such as (D. and message handling and instead mo es ranking nodes and selecting neigh%ors into the heart of the o erlay software de elopment process. &he a%straction decouples maintenance components in o erlay software" considera%ly reduces their need for framework dependent source code and ena%les their generic" configura%le implementation in plugga%le <DS7 frameworks. N$)a Sars!ar7 P. Os6ar B"#+$n7 =6ercolation Search in 6ower 9aw )etworks8 7aking ?nstructured 6eer-&o-6eer )etworks Scala%le>-,*::<&he proposed algorithm is capa%le of finding any content in the network with pro%a%ility one in time .(log))" with a total traffic that pro a%ly scales su%-linearly with the network si'e" ). ?nlike other proposed solutions" there is no need to assume that the network has multiple copies of contentsE the protocol finds all contents relia%ly" e en if e ery node in the network starts with a uni#ue content. &he scaling %eha ior of the si'e of the giant connected component of a random graph with hea y tailed degree distri%utions under %ond percolation is at the heart of our results .
VTU, BELGAUM
Page C
C!a/ er 0
VTU, BELGAUM
Page 1:
PRESENTED THEORY AND PRACTICE

0.1 ED$s $ng S#s e)
(n this pro*ect e$isting systems are two different algorithms those are" +. Flooding Algorithm ,. Random Walk (RW) Algorithm 0.1.1 '(""%$ng A(g"r$ !): -y this method" the #uery source sends its #uery messages to all of its neigh%ors. When a node recei es a #uery message" it first checks if it has the #ueried resource. (f yes" it sends a response %ack to the #uery source to indicate a #uery hit .therwise" it sends the #uery messages to all of its neigh%ors" e$cept for the one the #uery message comes from. 0.1.* D$sa%&an age '(""%$ng A(g"r$ !): &he draw%ack of flooding is the search cost. Flooding searches aggressi ely and co ers the most nodes. Flooding %elongs to -est First Search algorithm. (t generates a large amount of #uery messages %ut would take short term search. &he search is especially inefficient when the target is far from the #uery source %ecause the num%er of #uery messages would grow e$ponentially with the hop counts. 0.1.0 Ran%") Wa(+ ,RW- A(g"r$ !): -y RW" the #uery source *ust sends one #uery message (walker) to one of its neigh%ors. (f this neigh%or does not own the #ueried resource" it keeps on sending the walker to one of its neigh%ors" e$cept for the one the #uery message comes from" and thus" the search cost is reduced.
VTU, BELGAUM
Page 11
0.1.1 D$sa%&an age RW A(g"r$ !): &he main draw%ack of RW is the long search time. RW only isits one node for each hop" the co erage of RW/01 grows linearly with hop counts" which is slow compared with the e$ponential growth of the co erage of flooding.
0.* Pr"/"se% W"r+:

(n this pro*ect propose the dynamic search (DS) algorithm" which is a
generali'ation of flooding and RW. DS o ercomes the disad antages of flooding and RW and takes ad antage of different conte$ts under which each search algorithm performs well. &he operation of DS resem%les flooding for the short-term search and RW for the long-term search
0.*.1 A%&an age DS A(g"r$ !):

DS reduces search cost" time and impro es performance. DS performs a%out ,2 times %etter than flooding and 23 times %etter than RW in power-law graphs. DS performs a%out +34 times %etter than flooding and +,5 times %etter than RW in %imodal topologies
VTU, BELGAUM
Page 1*
C!a/ er 1 PROBLEM DE'INITION 1.1 Pr"5(e) Des6r$/ $"n:

&he main o%*ecti e of this system is to focus on the implementation of dynamic search (DS) algorithm" which is a generali'ation of flooding and RW. DS o ercomes the disad antages of flooding and RW and takes ad antage of different conte$ts under which each search algorithm performs well. &he operation of DS resem%les flooding for the short-term search and RW for the long-term search
1.* O58e6 $&es:

T!e 9"(("?$ng "58e6 $&es are %e9$ne% " )ee !e a$): 6ro iding the efficient search algorithm to route the destination node. (ts work on %ased on flooding and random search takes the ad antage of %oth. )umerical results show that DS pro ides a good tradeoff %etween search performance and cost.
1.0 Har%?are ReE3$re)en :

6R.@<SS.R RA7 7.)(&.R !ARD D(SF F9.66G DR(C< @DDR(C< 8 8 8 8 8 8 6<)&(?7 (C ,.4 :!' 2+, 7- DD RA7 +2> @.9.R ,5 :+.00 79: 2,H
VTU, BELGAUM
Page 10

F<G-.ARD 7.?S< 8 8 S&A)DARD +5, F<GS I -?&&.)S
1.1 S"9 ?are ReE3$re)en s:

Front end &ools ?sed .perating System 8 8 8 @JJ )S, 9inu$
VTU, BELGAUM
Page 11
<. METHODS USED

(n this section pro ide the details of the proposed DS algorithm . Which is generali'ation of flooding and RW. &here are two phases in DS. <ach phase has a different searching strategy. &he choice of search strategy at each phase depends on the relationship %etween the hop count ! of #uery messages and the network si'e n of DS.
<.1 P!ase 1. W!en ! F n At this phase" DS acts as flooding. &he num%er of neigh%ors that a #uery source sends the #uery messages to depends on the predefined transmission pro%a%ility p. (f the link degree of this #uery source is d" it would only send the #uery messages to d.p neigh%ors. When p is e#ual to +" DS resem%les flooding. <.* P!ase *. W!en ! G n At this phase" the search strategy switches to RW. <ach node that recei es the #uery message would send the #uery message to one of its neigh%ors if it does not ha e the #ueried resource. Assume that the num%er of nodes isited %y DS at hop h K n is the co erage c(n)" and then the operation of DS at that time can %e regarded as RW with c(n) walkers. !owe er" there are some differences %etween DS and RW when we consider the whole operation.
VTU, BELGAUM
Page 1<
VTU, BELGAUM
Page 1;
;. TECHNOLOGY USED
;.1 NS*: )S or the network simulator (also popularly called ns-," in reference to its current generation) is a discrete e ent network simulator. ns is popularly used in the simulation of routing and multicast protocols" among others" and is hea ily used in ad-hoc networking research. )S, supports an array of popular network protocols" offering simulation results for wired and wireless networks alike. (t can %e also used as limited-functionality network emulator. (t is popular in academia for its e$tensi%ility (due to its open source model) and plentiful online documentation. ns is licensed for use under ersion , of the :)? :eneral 6u%lic 9icense. ;.* Des$gn: )S, was %uilt in @JJ and pro ides a simulation interface through .&cl" an o%*ect-oriented dialect of &cl. &he user descri%es a network topology %y writing .&cl scripts" and then the main )S program simulates that topology with specified parameters. ;.0 H$s "r#: )S %egan de elopment in +L3L as a ariant of the R<A9 network simulator. -y +LL2" ns had gained support from DAR6A" the C()& (Cirtual (nter )etwork &est%ed) pro*ect at 9-9" Hero$ 6AR@" ?@-" and ?S@D(S(./+1. )S, is now de eloped in colla%oration %etween a num%er of different researchers and institutions" including SA7A) (supported %y DAR6A)" @.)S<R (@olla%orati e Simulation for <ducation and Research)(through the )SF)" and (@(R (formerly A@(R(). (t is currently maintained %y olunteers. 9ong-running contri%utions ha e also come from Sun 7icrosystems and the ?@- Daedelus and @arnegie 7ellon 7onarch pro*ects" cited %y the ns homepage for wireless code additions. ;.1 'ea 3res "9 NS*: 6rotocols8 &@6" ?D6" !&&6" Routing algorithms" 7A@ etc &raffic 7odels8 @-R" C-R" We% etc <rror 7odels8 ?niform" %ursty etc 7isc8 Radio propagation" 7o%ility models " <nergy 7odels
VTU, BELGAUM
Page 1A

&opology :eneration tools Cisuali'ation tools ()A7)" &racin ;.< NS S r36 3re: )S is an o%*ect oriented discrete e ent simulator Simulator maintains list of e ents and e$ecutes one e ent after another Single thread of control8 no locking or race conditions -ack end is @JJ e ent scheduler 6rotocols mostly Fast to run" more control Front end is o &@9 @reating scenarios" e$tensions to @JJ protocols fast to write and change
VTU, BELGAUM
Page 1B
A. SYSTEM DESIGN
Design and &esting is the actual process of producing a solution according to the specification deri ed from the analysis stage.
A.1 S#s e) Pre($)$nar# Des$gn:
Peer Req.
Checks with sub peer
Peer Req.
Super Peer response And send Req to neighbor peer

Re q ue s
If, not means
Peer Req. Check for A !ot the IP Port no of file A
Peer Req.
to
IP Port no of file A
p Re ly
fA
Peer Req. A
Super Peer response And send Req to neighbor peer
Peer Req.
VTU, BELGAUM
Page 1C

Fig 2.+ 6reliminary design of the proposed model '3n6 $"na($ #: (nitially a source peer send re#uest to all of it neigh%oring peers until reach the destination depends on the network si'e. Depend on the network si'e the proposed model switches to the re#uired algorithm.
A.* Da a '("? D$agra):

A %a a-9("? %$agra) (D'D) is a graphical representation of the BflowB of data through an information system. DFDs can also %e used for the isuali'ation of data processing (structured design). .n a DFD" data items flow from an e$ternal data source or an internal data store to an internal data store or an e$ternal data sink" ia an internal process DFD pro ides no information a%out the timing of processes" or a%out whether processes will operate in se#uence or in parallel.
VTU, BELGAUM
Page *:
Query Peer A Check with peer Super Peer 1 Peer B
If it not Rely Query
Peer D
Super Peer 2 Peer E
Peer C
Upd te Pro! !ility " !le
If found Re#pon#e with IP
Peer F
Fig 2., Data flow diagram.
A.0 Use Case D$agra):
VTU, BELGAUM
Page *1

A use case diagram in the ?nified 7odeling 9anguage (?79) is a type of %eha ioral diagram defined %y and created from a ?se-case analysis. (ts purpose is to present a graphical o er iew of the functionality pro ided %y a system in terms of actors" their goals (represented as use cases)" and any dependencies %etween those use cases. &he main purpose of a use case diagram is to show what system functions are performed for which actor. Roles of the actors in the system can %e depicted. ?se @ase diagrams are formally included in two modeling languages defined %y the .7:8 the ?nified 7odeling 9anguage (?79) and the Systems 7odeling 9anguage (Sys79).
"ogin
#ile upload
Asking for query Peer
Response for super peer
Send request for super peer
Fig8 2.I ?se case diagram(for peer).
VTU, BELGAUM
Page **
"ogin check for peer
SuperPeer
$onitoring
Answering the query
Fig8 2.I.+ ?se case diagram(for super peer).
A.1 SeE3en6e D$agra):

A se#uence diagram in ?nified 7odeling 9anguage (?79) is a kind of interaction diagram that shows how processes operate with one another and in what order and at a specific time. (t is a construct of a 7essage Se#uence @hart. Se#uence diagrams are sometimes called e ent diagrams" e ent scenarios" and timing diagrams.
VTU, BELGAUM
Page *0
Peer "ogin % #ile (pload % &Peer "ogin' &#ile (pload' +ust upload
)uerying % &)uerying'
*ownload % &*ownload'
Asking for query
After getting the port no contact the peer
Fig 2.0 Se#uence diagram(for peer).

$onitoring % &$onitoring' Peer login check % &Peer login check' #or ,stablishing the connection Asking for )uery Answering for the query
Fig 2.0 Se#uence diagram (for super peer).
VTU, BELGAUM
Page *1
A.< C"((a5"ra $"n D$agra):

A colla%oration diagram" also called a communication diagram or interaction diagram" is an illustration of the relationships and interactions among software o%*ects in the ?nified 7odeling 9anguage (?79). &he concept is more than a decade old although it has %een refined as modeling paradigms ha e e ol ed. A colla%oration diagram resem%les a flowchart that portrays the roles" functionality and %eha ior of indi idual o%*ects as well as the o erall operation of the system in real time.
-ork as a ser.er for other peer
#ile (pload /% +ust upload Peer "ogin 0% Asking for query
)uerying
*ownload 1% After getting the port no contact the peer
"ike a client
Fig8 2.2 @olla%oration Diagram(For 6eer)

/% #or ,stablishing the connection Peer login check $onitoring 0% Asking for )uery Answering for the query
Fig8 2.2 @olla%oration Diagram(For Super 6eer)

VTU, BELGAUM
Page *<
A.; A6 $&$ # D$agra):
Peer "ogin
#or e2tablishing connection
#ile upload
3ust to inform the file what it has
)uerying
Reply the )uery
Fig8 M.4.+ Acti ity diagram (For 6eer)
VTU, BELGAUM
Page *;
Peer "ogin check
$onitoring
+ust "isten the peer request and other superpeer too
)uery check with own database
Reply the )uery
Checking for other superpeer
$onitoring
Answering for query
$onitoring
Fig8 M.4., Acti ity Diagram(For Super 6eer)
VTU, BELGAUM
Page *A
A.A S a e Ma6!$ne D$agra):

A state machine diagram models the %eha ior of a single o%*ect" specifying the se#uence of e ents that an o%*ect goes through during its lifetime in response to e ents.
VTU, BELGAUM
Page *B
Peer "ogin
#ile upload
+ust inform to ser.er 4ere Superpeer
Client
Ser.er
Asking for )uery
Answering for query
#ile download
Sharing
VTU, BELGAUM
Page *C

Fig8 M.M.+ State Diagram(For 6eer).
Peer "ogin check
$onitoring
+ust "isten the peer request and other superpeer too
Client
Ser.er
Asking for )uery
Answering for query
5ransfer the IP port address
#orward the IP Port no.
Fig8 M.M., State diagram (For super peer).
VTU, BELGAUM
Page 0:
C!a/ er B SYSTEM IMPLEMENTATION

M"%3(ar $)/(e)en a $"n:
&he pro*ect mainly has %een di ided in to four modules. &hey areE @reation of ?nstructured 6eer-to-6eer )etwork Flooding Algorithm Random Walk (RW) Algorithm Dynamic Search Algorithm (DSA)
B.1 Crea $"n "9 Uns r36 3re% Peer- "-Peer Ne ?"r+:
(n this module pro ide the details of unstructured peer-to-peer network. (t means e ery node(peer) acts like as ser er as well as client. (n this network peer has capa%le of send the data at same time recei ing data" centrali'ed administration is not there.
VTU, BELGAUM
Page 01
Fig 4.+ ?nstructured 6eer-to-6eer network (n unstructured peer-to-peer networks" each node does not ha e glo%al information a%out the whole topology and the location of #ueried resources. -ecause of the dynamic property of unstructured 6,6 networks" correctly capturing glo%al %eha ior is also difficult. Search algorithms pro ide the capa%ilities to locate the #ueried resources and to route the message to the target node. &hus" the efficiency of search algorithms is critical to the performance of unstructured 6,6 networks.
B.* '(""%$ng A(g"r$ !):

(n this module pro ide the details of flooding algorithm in small unstructured peer to peer network. -y this method" the #uery source sends its #uery messages to all of its neigh%ors. When a node recei es a #uery message" it first checks if it has the #ueried resource. (f yes" it sends a response %ack to the #uery source to indicate a #uery hit .therwise" it sends the #uery messages to all of its neigh%ors" e$cept for the one the #uery message comes from.
VTU, BELGAUM
Page 0*
B.0 Ran%") Wa(+ A(g"r$ !):

(n this module pro ide the details of the RW algorithm in large unstructured peer to peer network. -y RW" the #uery source *ust sends one #uery message (walker) to one of its neigh%ors. (f this neigh%or does not own the #ueried resource" it keeps on sending the walker to one of its neigh%ors" e$cept for the one the #uery message comes from" and thus" the search cost is reduced.
B.1 D#na)$6 Sear6! A(g"r$ !):

(n this module pro ide the details of the proposed DS algorithm . Which is generali'ation of flooding and RW. &here are two phases in DS. <ach phase has a different searching strategy. &he choice of search strategy at each phase depends on the relationship %etween the hop count ! of #uery messages and the network si'e n of DS.
B.1.1 P!ase 1. W!en ! F n At this phase" DS acts as flooding. &he num%er of neigh%ors that a #uery source sends the #uery messages to depends on the predefined transmission pro%a%ility p. (f the link degree of this #uery source is d" it would only send the #uery messages to d.p neigh%ors. When p is e#ual to +" DS resem%les flooding. B.1.* P!ase *. W!en ! G n At this phase" the search strategy switches to RW. <ach node that recei es the #uery message would send the #uery message to one of its neigh%ors if it does not ha e the #ueried resource. Assume that the num%er of nodes isited %y DS at hop h K n is the co erage c(n)" and then the operation of DS at that time can %e regarded as RW with c(n) walkers. !owe er" there are some differences %etween DS and RW when we consider the whole operation.
VTU, BELGAUM
Page 00
CHAPTER C SYSTEM TESTING

C.1 TYPES O' TESTING:
(n a software de elopment pro*ect" errors can %e in*ected at any stage during de elopment. &he de elopment of software in ol es a series of production acti ities where opportunities for in*ection of human falli%ilityAs are enormous. -ecause of human ina%ility to perform and communicate with perfection" software de elopment is accomplished %y a #uality assurance acti ity. Software testing is a critical element of software #uality assurance and represents the ultimate re iew of specification" design and coding. &esting presents an interesting anomaly for the software engineer. &he engineer creates a series of test cases that are intended to demolish the software engineer process that could %e iewed as destructi e rather than constructi e.
C.* Tes $ng O58e6 $&e:

&esting is a process of e$ecuting a program with the intent of finding an error. A good test case is one that has a high pro%a%ility of finding an as yet undisco ered error. A successful test one that unco ers an as Nyet undisco ered error. &he a%o e o%*ecti es imply a dramatic change in iewpoint. &hey mo e counter to the commonly held iew that a successful test is one in which no errors are found. &esting cannot show the a%sence of detects" it can only show that software errors are present.
C.0Tes A//r"a6!es:
Any engineered can %e tested in one of the two ways.
VTU, BELGAUM
Page 01

+. knowing the specified function that a product has %een designed to perform tests can %e conducted that demonstrate each function is fully operational at the sa e time searching for errors in each function. ,. Fnowing the internal working of a product" test can %e conducted to ensure that =all gears mesh>" &hat is that internal operation performs according to the specification and all internal components ha e %een ade#uately e$ercised. &he first test approach is called -lack %o$ testing and the second approach is called White %o$ testing.
C.1 S r36 3ra( Tes $ng ,W!$ e B"D Tes $ng(ntroduction White %o$ testing" sometimes called :lass %o$ testing design method that uses the control method of the procedural design to deri e test cases. ?sing white %o$ testing methods" the software engineer can deri e test cases that8 +. :uarantee that all independent paths with in a module ha e %een e$ercised at least once. ,. <$ercise all logical decisions on their true and false sides. I. <$ecute all loops at their %oundaries and with in their alidity. 0. 9ogical errors and incorrect assumptions are in ersely proportional to the pro%a%ility that a program path will %e e$ecuted. 2. .ften %elie e that logical path not likely to e$ecute when" in fact" it may %e e$ecuted on regular %asis. 4. &ypographical errors are random.
VTU, BELGAUM
Page 0<

<ach of these reasons pro ides an argument for conducting white %o$ tests. -lack %o$ testing" no matters how through" may miss the kinds of errors a%o e. =-ugs lurk in corners and congregate>. White-%o$ testing is far more likely to unco er them. &he design of test cases for software and other engineered products can %e as challenging as initial design of the product itself. &he tests that ha e the highest likelihood of finding the most errors with a minimum amount of time and effort should %e designed.
C.< Tes Case S/e6$9$6a $"n

A realistic goal for testing is to select a set of test cases. (n the functional testing" the test cases are decided solely on the %asis of re#uirements. (n the structural testing" they are generated %ased on the actual code of the program or module to %e tested. (n the test case specification we specify all the test cases that are used for the system testing. First the different conditions that need to %e test" along with the test cases used for testing are gi en. &he test cases ha e %een selected using the functional approach. &he goal is to test the different functional re#uirements as specified in the re#uirements documents. &est cases ha e %een selected for %oth alid and in alid inputs. A rich ariety of test case design methods ha e e ol ed for software. &hese methods pro ide the de eloper with a systematic approach to testing. Any engineered product can %e tested in one of two ways. +. Fnowing the specified function that a product has %een designed to perform. ,. Fnowing the internal working of the pro*ect. &he first test approach is known as %lack %o$ testing and the second is white %o$ &esting.
VTU, BELGAUM
Page 0;
C.; '3n6 $"na( Tes $ng ,B(a6+ B"D Tes $ng-:

(ntroduction -lack %o$ testing focuses on the functional re#uirements of the software. &hat is %lack-%o$ testing ena%les the software engineer to dri e set of input conditions that will fully e$ercise all functional re#uirements of a program. -lack-%o$ testing attempts to find errors in the following categories. +. (ntroduction or missing function ,. (nterface errors. I. <rrors in data structures or e$ternal data access 0. (nitiali'ing and termination errors.
C.A EE3$&a(en6e Par $ $"n$ng:

<#ui alence partitioning is a %lack-%o$ testing method that deri es the input domain of program into classes of data from which test cases can %e deri ed. An ideal test case single handedly unco ers a class of errors (e.g. incorrect processing of all incorrect data) that might otherwise re#uire many cases to %e e$ecuted %efore the general errors are o%ser er. <#ui alence partitioning stri es to define a test that unco ers the class of errors" there%y reducing the total num%er of test cases that unco ers classes of errors" there%y reducing the total num%er of test that unco ers classes of errors" there%y reducing the total num%er of test cases that must %e de eloped. &esting case testing for e#ui alence partitioning is %ased on a e aluation of e#ui alence class for an input condition if a set of o%*ects can %e linked %y relationship that are symmetric" transiti e and refle$i e" an e#ui alence is present. An e#ui alence class represents a set of alid or in alid states for input condition. &ypically an input condition is a specific numeric alue" a range of alues" a set of related alues" or a condition.
VTU, BELGAUM
Page 0A
C.B S#s e) Tes P(an

System &esting checks the product as a whole. o &esting is done for user login o &esting is done for the security o &esting is done for the ser ices pro ided %y the %ank. o &esting is done on the performance of the system. o Allows usa%ility testing. o &his system is thoroughly tested for all the possi%le conditions.
C.C Le&e(s "9 Tes $ng:

&he different le els of testing that are to %e conducted are @ode &esting 6rogram &esting System &esting @ode &esting8 &he code test has %een conducted to test the logic of the program. !ere" we ha e tested with all possi%le com%inations of data to find out logical errors. &he code testing is done thoroughly with all possi%le data a aila%le with li%rary. 6rogram &esting8 6rogram testing is also called unit testing. &he modules in the system are integrated to perform the specific function. &he modules ha e %een tested independently" later Assem%led and tested thoroughly for integration %etween different modules.
VTU, BELGAUM
Page 0B

System &esting8 System testing has %een conducted to test the integration of each module in the system .(t is used to find discrepancies %etween the system and its original o%*ecti e. (t is found that there is an agreement %etween current specifications and system documentation. Software &esting is carried out in three steps
&he first step includes unit testing where in each module is tested to pro ide his correctness" alidity and also determine any missing operations. <rrors are noted down and corrected immediately. ?nit testing is the import and ma*or part of the pro*ect. So errors are rectified easily in particular module and program clarity is increased. (n this pro*ect entire system is di ided into se eral modules and is de eloped indi idually. So unit testing is conducted to indi idual modules. &he second step includes integration testing. (t need not %e the case" the software whose modules when run indi idually and showing perfect results" will also show perfect results when run as a whole. &he indi idual modules are clipped under this ma*or module and tested again and the results are erified. &he final step in ol es alidation and testing which determines the software functions as the user e$pected. !ere also there may %e some modifications. (n the completion of the pro*ect it is satisfied fully %y the user.
C.1: In egra $"n Tes P(an:

Data can %e lost across an interface" one module can ha e an ad erse effort on the other su% functions" when com%ined" may not produce the desired ma*or functions. (ntegrated testing is the systematic testing for constructing the unco er errors within the interface. &he testing was done with sample data. &he de eloped system has run successfully for this sample data. &he need for integrated test is to find the o erall system performance
VTU, BELGAUM
Page 0C
C.11 Un$ Tes

(n the unit testing we test each module indi idually and integrate with the o erall system. ?nit testing focuses erification efforts on the smallest unit of software design in the module. &his is also known as module testing. &he module of the system is tested separately. &his testing is carried out during programming stage itself. (n the testing step each module is found to work satisfactorily as regard to e$pected output from the module. &here are some alidation checks for fields also. For e$ample the alidation check is done for arying the user input gi en %y the user which alidity of the data entered. (t is ery easy to find error de%ut the system.
C.1* OUTPUT TESTING:

After performance of the alidation testing" the ne$t step is output testing. &he output displayed or generated %y the system under consideration is tested %y asking the user a%out the format re#uired %y system.
VTU, BELGAUM
Page 1:
CHAPTER 1: SIMULATION ANALYSIS

1:.1 '(""%$ng A(g"r$ !):
-y using )S, simulator ,2 nodes are created in the form of unstructured peer to peer network to descri%e flooding algorithm. (n the a%o e figure" %lue colored node is source node" remaining nodes are neigh%or nodes.
VTU, BELGAUM
Page 11
&he a%o e fig shows implementation of the flooding algorithm in the network. &he source node(%lue) send re#uest to all of its neigh%oring nodes until reach the destination node.
VTU, BELGAUM
Page 1*

&he a%o e fig shows neigh%ors nodes %eha ior" the neigh%or nodes recei e the re#uest and check whether it matches or not. (f does not ha e re#uired resources" its forward re#uest to all its neigh%or nodes.
&he a%o e fig shows that the destination node is indentified and is displayed in red color.
VTU, BELGAUM
Page 10
(n the a%o e fig descri%es the estimated calculations after finding the destination node for instance node 4 is the destination node.
1:.* RW A(g"r$ !):
VTU, BELGAUM
Page 11

&he a%o e figure descri%es implementation of the RW algorithm. &he source node(%lue) send re#uest to the one of its neigh%or node. &he neigh%or node checks whether itAs re#uired resource or not. (f does not ha e re#uired resource it sends re#uest to one of its neigh%or node until reach the destination node.
&he a%o e fig shows that destination node is indentified and is displayed in red color.
VTU, BELGAUM
Page 1<
&he a%o e fig descri%es estimated calculations after finding the destination node for instance node +M is the destination node.
VTU, BELGAUM
Page 1;
1:. DS A(g"r$ !):
&he a%o e figure descri%es implementation of the DS algorithm and this algorithm depends on the network si'e whether to perform flooding or RW algorithm. !ere the network si'e is small" So DS algorithm acts like flooding algorithm.
VTU, BELGAUM
Page 1A
&he a%o e figure shows DS acts like flooding and it reaches the destination node(red)
VTU, BELGAUM
Page 1B

&he a%o e figure descri%es DS acts as RW algorithm %ecause of increased network si'e
&he a%o e figure descri%es DS acts like RW and it reach the destination node ,5 (%lue). Figure descri%es the estimated calculations after finding the destination node for instance node ,5 is the destination node.
VTU, BELGAUM
Page 1C
Sear6! $)e
N3)5er "9 n"%es &he a%o e graph descri%es the performance comparison of the e$isting system and dynamic search algorithm. (n the a%o e $-a$es represents num%er of nodes and y-a$es represent the search time. Red color shows the flooding" %lue color shows random and green color shows dynamic search algorithm.
VTU, BELGAUM
Page <:
CHAPTER 11 E@PERMENT RESULTS

(n this section %y using ns, simulator construct the unstructured p,p network" frist ) is set as ,2 peers (nodes). Analy'e the performance of DS" RW and Flooding %ased on some performance metrics including the success rate" search time" #uery messages. 11.1 =3er# Messages ,=M-: (t is also called as Search cost. &he calculation of #uery messages for Algorithm depends on ! and n. &he #uery messages h generated at hop h for Algorithm can %e written as
11.* Sear6! T$)e ,ST-: &o represent the capa%ility of one search algorithm to find the #ueried resource in time with a gi en pro%a%ility" define the search time as the time it takes to guarantee the #uery success with success rate re#uirement re#uest. 11.0 S366ess Ra e ,SR-: &he success rate (SR) is the pro%a%ility that a #uery is successful" i.e." there is at least one #uery hit. Assume that the #ueried resources are uniformly distri%uted in the network with a replication ratio R. SR can %e calculated as SR K +-(+-@)" @--O is a co erage
VTU, BELGAUM
Page <1
11. 1 Res3( s
Al$orith%
&per tion# Query 'e## $e#(Q')
Re#ult# 21 *+, -+./
floodin$
Se rch "i%e(S") Succe## R te(SR)
&a%le ++.0.+ Flooding algorithm
Al$orith%
Re#ult# 10 0+0 -+*0
R ndo% w lk
&a%le ++.0., Random Walk algorithm
Al$orith%
Re#ult# 11 *+2 -+20
R ndo% w lk
&a%le ++.0.I Dynamic Search algorithm
VTU, BELGAUM
Page <*
VTU, BELGAUM
Page <0
1*. LIMITATIONS
)owadays DSA algorithm had %een used in unstructured p,p network and itAs %een one of the most successful search algorithms. Some knowledge-%ased search algorithms" including A6S" %iased RW" R(" local indices" and intelligent search" are applica%le to com%ine with our DS algorithm and any training or caching operations are %enefit from our DS algorithm as well. &he generic scheme to incorporate these knowledge-%ased search algorithms with our DS algorithm. @onstruct the pro%a%ilistic function %ased on the information learned from the past e$periences" with respect to each search target" search time" and local topology information. &hus" a node has more information to intelligently decide how many #uery messages to send and to which peers these messages should %e forwarded.
VTU, BELGAUM
Page <1
10. APPLICATIONS
)owadays DSA algorithm had %een used in unstructured p,p network and itAs %een one of the most successful search algorithms. Some knowledge-%ased search algorithms" including A6S" %iased RW" R(" local indices" and intelligent search" are applica%le to com%ine with our DS algorithm and any training or caching operations are %enefit from our DS algorithm as well. &he generic scheme to incorporate these knowledge-%ased search algorithms with our DS algorithm. @onstruct the pro%a%ilistic function %ased on the information learned from the past e$periences" with respect to each search target" search time" and local topology information. &hus" a node has more information to intelligently decide how many #uery messages to send and to which peers these messages should %e forwarded.
VTU, BELGAUM
Page <<
11. C"n6(3s$"n
&his pro*ect implemented the DS algorithm" which is a generali'ation of the flooding and RW. DS o ercomes the disad antages of flooding and RW" and takes ad antage of arious conte$ts under which each search algorithm performs well. (t resem%les flooding for the short-term search and RW for the long-term search. Analy'e the performance of DS %ased on some metrics including the success rate" search time" num%er of #uery hits" num%er of #uery messages. )umerical results show that proper setting of the parameters of DS can o%tain short search time and pro ide a good tradeoff %etween the search time and cost.
1<. 'UTURE SCOPE

When com%ined with knowledge-%ased search algorithms" Dynamic Search algorithm search performances could %e further impro ed.
VTU, BELGAUM
Page <;
REFERENCES
/+1 D. Stut'%ach" R. Re*aie" ). Duffield" S. Sen" and W. Willinger" =Sampling &echni#ues for 9arge" Dynamic :raphs"> 6roc. )inth (<<< :lo%al (nternet Symp. (:lo%al (nternet A54)" Apr. ,554 /,1 D. 7ilo*icic" C. Falogeraki" R. 9ukose" F. )agara*a" P. 6ruyne" -. Richard" S. Rollins" and Q. Hu" =6eer-to-6eer @omputing"> &echnical Report !69-,55,-2M" !6" ,55,. /I1. -. Gang and !. :arcia-7olina" =(mpro ing Search in 6eer-to-6eer )etworks"> 6roc. ,,nd (ntAl @onf. Distri%uted @omputing Systems ((@D@S A5,)" pp. 2-+0" Puly ,55,. /01 /L1 @. :kantsidis" 7. 7ihail" and A. Sa%eri" =Random Walks in 6eer-to-6eer )etworks"> 6roc. (<<< ()F.@.7 A50" pp. +,5-+I5" ,550. /21 @. :kantsidis" 7. 7ihail" and A. Sa%eri" =!y%rid Search Schemes for ?nstructured 6eer-to-6eer )etworks"> 6roc. (<<< ()F.@.7 A52" pp. +2,4-+2IM" ,552. /41 R. 9 " 6. @ao" <. @ohen" F. 9i" and S. Shenker" =Search and Replication in ?nstructured 6eer-to-6eer )etworks"> 6roc. +4th Ann. (ntAl @onf. Supercomputing ((@S A5,)" pp. 30-L2" Pune ,55,. /M1 Q. :e" D.R. Figueiredo" S. Paiswal" P. Furose" and D. &owsley" =7odeling 6eer-6eer File Sharing Systems"> 6roc. (<<< ()F.@.7 A5I" pp. ,+33-,+L3" ,55I. /31 S. Saroiu" 6.F. :ummadi" and S.D. :ri%%le" =A 7easurement Study of 6eer-to-6eer File Sharing Systems>. 77@)" Pan. ,55,. /L1 S. Piang" 9. :uo" H. Qhang" and !. Wang" =9ightFlood8 7inimi'ing Redundant 7essages and 7a$imi'ing Scope of 6eer-to-6eer Search"> (<<< &rans. 6arallel and Distri%uted Systems" ol. +L" no. 2" pp. 45+-4+0" 7ay ,553. /+51 D. &soumakos and ). Roussopoulos" =Adapti e 6ro%a%ilistic Search for 6eer-to6eer )etworks"> 6roc. &hird (ntAl @onf. 6eer-to- 6eer @omputing (6,6 A5I)" pp. +5,-+5L" Sept. ,55I.
VTU, BELGAUM
Page <A

/++1 -. Gang and !. :arcia-7olina" =(mpro ing Search in 6eer-to-6eer )etworks"> 6roc. ,,nd (ntAl @onf. Distri%uted @omputing Systems ((@D@S A5,)" pp. 2-+0" Puly ,55,.
VTU, BELGAUM
Page <B

Project of Vtu

Hochgeladen von

Dokumentinformationen

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Project of Vtu

Hochgeladen von

Copyright:

Verfügbare Formate

Dynamic Search Algorithm in unstructured peer-to-peer network

DYNAMIC SEARCH ALGORITHM IN UNSTRUCTURED PEER-TO-PEER NETWORK ABSTRACT:

Dynamic Search Algorithm in unstructured peer-to-peer network

D$sa%&an age '(""%$ng A(g"r$ !):

Dynamic Search Algorithm in unstructured peer-to-peer network

Ran%") Wa(+ ,RW- A(g"r$ !):

D$sa%&an age RW A(g"r$ !):

1.* Pr"/"se% W"r+:

A%&an age DS A(g"r$ !):

Dynamic Search Algorithm in unstructured peer-to-peer network

Dynamic Search Algorithm in unstructured peer-to-peer network

C!a/ er * LITERATURE SUR2EY

Dynamic Search Algorithm in unstructured peer-to-peer network

Dynamic Search Algorithm in unstructured peer-to-peer network

Dynamic Search Algorithm in unstructured peer-to-peer network

Dynamic Search Algorithm in unstructured peer-to-peer network

Dynamic Search Algorithm in unstructured peer-to-peer network

Dynamic Search Algorithm in unstructured peer-to-peer network

PRESENTED THEORY AND PRACTICE

Dynamic Search Algorithm in unstructured peer-to-peer network

0.* Pr"/"se% W"r+:

0.*.1 A%&an age DS A(g"r$ !):

Dynamic Search Algorithm in unstructured peer-to-peer network

C!a/ er 1 PROBLEM DE'INITION 1.1 Pr"5(e) Des6r$/ $"n:

1.* O58e6 $&es:

1.0 Har%?are ReE3$re)en :

Dynamic Search Algorithm in unstructured peer-to-peer network

1.1 S"9 ?are ReE3$re)en s:

Dynamic Search Algorithm in unstructured peer-to-peer network

<. METHODS USED

Dynamic Search Algorithm in unstructured peer-to-peer network

Dynamic Search Algorithm in unstructured peer-to-peer network

Dynamic Search Algorithm in unstructured peer-to-peer network

Dynamic Search Algorithm in unstructured peer-to-peer network

A.1 S#s e) Pre($)$nar# Des$gn:

Checks with sub peer

Super Peer response And send Req to neighbor peer

If, not means

Peer Req. Check for A !ot the IP Port no of file A

Super Peer response And send Req to neighbor peer

Dynamic Search Algorithm in unstructured peer-to-peer network

A.* Da a '("? D$agra):

Dynamic Search Algorithm in unstructured peer-to-peer network

Query Peer A Check with peer Super Peer 1 Peer B

If it not Rely Query

Super Peer 2 Peer E

Upd te Pro! !ility " !le

If found Re#pon#e with IP

Fig 2., Data flow diagram.

A.0 Use Case D$agra):

Dynamic Search Algorithm in unstructured peer-to-peer network

Asking for query Peer

Response for super peer

Send request for super peer

Fig8 2.I ?se case diagram(for peer).

Dynamic Search Algorithm in unstructured peer-to-peer network

"ogin check for peer

Answering the query

Fig8 2.I.+ ?se case diagram(for super peer).

A.1 SeE3en6e D$agra):

Dynamic Search Algorithm in unstructured peer-to-peer network

Asking for query

After getting the port no contact the peer