[p2p-hackers] Overlay Weaver: An Overlay Construction Toolkit

[Michael Liu]

It seems a great toolkit , .I think Overlay Weaver will greatly speed the developing of p2p applications.

I have one question, is Overlay Weaver similar to the Jxta ? or it's more powerful than Jxta ?

thanks

----- Original Message ----- 
From: <shudo at computer.org>
To: <p2p-hackers at zgp.org>
Sent: Monday, January 16, 2006 11:21 PM
Subject: [p2p-hackers] Overlay Weaver: An Overlay Construction Toolkit


> I'm pleased to announce the initial release of Overlay Weaver.
> 
>   Overlay Weaver: An Overlay Construction Toolkit
>   http://overlayweaver.sf.net/
> 
> It supports overlay algorithm designers in addition to application
> developers.
> 
> For application developers, the toolkit provides a common API for
> higher-level services such as distributed hashtable (DHT) and
> multicast.  Applications relying on the common API depend no specific
> transport protocol, database implementation and routing algorithm.
> 
> The toolkit provides multiple routing algorithms, Chord, Kademlia,
> Pastry and Tapestry. These algorithms could be implemented only in
> hundreds lines of code because of routing layer decomposition. Routing
> layer under the higher-level services has been decomposed into
> multiple components, routing driver, routing algorithm and messaging
> service. The decomposition also facilitates implementation of a new
> algorithm. A newly implemented algorithm can be tested, evaluated and
> compared on emulator, which can host thousands of virtual nodes It
> enables large-scale emulation and fair comparison between algorithms.
> 
> Features:
> 
> - Implemented in Java 5.
>   (except part of IPv4 multicast router which is in C.)
> 
> - Provides multiple routing algorithms, Chord, Kademlia, Pastry and Tapestry.
> 
> - Two routing drivers respectively performing iterative and recursive routing
>   work with all routing algorithm (except recursive routing with Kademlia).
> 
> - Provides a distributed environment emulator. It has demonstrated
>   that it can host 4000 (virtual) nodes on a single 32 bit computer
>   with 1 GB memory.
> 
> - There are multiple implementations of communication layer,
>   with UDP, TCP and emulated messaging layer.
>   Note that the UDP implementation does UDP hole punching.
> 
> - A visualization tool, Messaging Visualizer provided.
>   It shows nodes and communications just in time
>   and works both on the emulator and a real network.
> 
> There are screenshots and a demonstration provided on the web site.
> Please take a look.
> 
> We have written a paper but now it's in Japanese. I will prepare an
> English paper in few months.
> 
> We'd appreciate activities utilizing this toolkit such as application
> development, algorithm researches, testbed construction and operation.
> We'll support them. Please contact us or subscribe a mailing list.
> 
> Thanks,
> 
>   Kazuyuki Shudo, Ph.D. shudo at ni.aist.go.jp, http://www.shudo.net/
>   Grid Technology Research Center
>   National Institute of Advanced Industrial Science and Technology (AIST)
> 
> _______________________________________________
> p2p-hackers mailing list
> p2p-hackers at zgp.org
> http://zgp.org/mailman/listinfo/p2p-hackers
> _______________________________________________
> Here is a web page listing P2P Conferences:
> http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences