RE: Advertisement Discovery Performance
<[email protected]> Fri, 9 Sep 2005 16:24:56 +0100
| Newsgroups | gmane.comp.java.jxta.user |
|---|---|
| Message-ID | <5EAF119D9E35554484DB46D1AC1AFCD90294C121@i2km96-ukbr.domain1.systemhost.net> |
When your App initialises - it can get the current list from the rendevous By registering a Listener the rendevous will signal your App about any RendevousEvents This way you don't build in a Timer/sleep/query Rendevous Instead you get signalled when something happens Obviously you will have to monitor for complete/temporary loss of the rendevous itself Stefan Maric | IT & Professional Services | BT Global Services | Phone: E: [email protected] | www.bt.com/globalservices -----Original Message----- From: Rajes Akkineni [mailto:[email protected]] Sent: Friday, September 09, 2005 4:02 PM To: [email protected] Subject: Re: [JXTA user] Advertisement Discovery Performance Hi, Can you please explain how the specified process will help us find the other peers fastly? thanks Rajesh Akkineni On Fri, 09 Sep 2005 19:32:06 +0530, <[email protected]> wrote: > If you look at the net.jxta.rendezvous API > > There is a getConnectedPeers() > Returns an Enumeration of PeerID of the peers that are currently > connected > > > You can also register as RendezvousListener using addListener() > > As a RendezvousListener you must implement > void rendezvousEvent(RendezvousEvent event) > > > From the RendezvousEvent you can monitor client connections etc > > > > So as your App initialises it should query the Rendevous to find out who > is already known and also establish a listener to be informed of new > arrivals (and leavers etc) > > > -----Original Message----- > From: GEOFFREY DIX [mailto:[email protected]] > Sent: Friday, September 09, 2005 2:49 PM > To: [email protected] > Subject: [JXTA user] Advertisement Discovery Performance > > Hello, > > I am currently trying to run performance tests on an application I have > written using the Java JXTA implementation (v 2.3.x). I begin by > starting > up 12 peers on different nodes of a linux cluster. Each peer creates > and > advertises a bidi pipe and all peers are members of the same group. I > discover the pipe advertisements by name (all advertisement names are > built > using <PeerGroupName>:<PeerName>) by making a call to > getRemoteAdvertisements > using 15 as the number of advertisements I would like to retrieve. I > wait > about 10 seconds before sending the next getRemoteAdvertisements request > (I > have tried many different combinations - 1sec, 30secs, 60 secs) to give > my > discovery listener time to parse the advertisements and attempt to > connect > to the pipes. Currently it takes about 5-10 minutes for all the peers > to > discover and connect to each other peer (though sometimes the discovery > does > not succeed for all peers). My problem (finally) is that since I am > still > in the process of making changes to my software baseline I would like to > find a way to improve the speed at which peers are discovered and wonder > if there is a more efficient method for discovery that I am not aware > of? > > Thanks in advance for any help/suggestions you can offer. > > Geoff > --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]