Hi all, Overlay Weaver 0.7.4 is available now.
Overlay Weaver: An Overlay Construction Toolkit http://overlayweaver.sf.net/ Nobember 4, 2007 Version 0.7.4 released. * With version 0.7.3, put and remove requests to a DHT node with a secret do not work. Fixed. * In a specific case, DHT#get returns no value though values exist. Fixed. * Each node on the route records time in a routing result (RoutingResult instance), and web interface of DHT shell (owdhtshell -x) shows them. * Invokes an independent thread to perform a reverse lookup of a hostname to avoid an execution block on the lookup. * Overlay Visualizer (owviz) and Message Counter (owmsgcounter) accept --no-upnp option as well as DHT shell (owdhtshell) and Mcast shell (owmcastshell). An attachment is a captured image of (part of) the web interface. You can find a DHT working on PlanetLab by searching "Overlay Weaver Node": http://www.google.com/search?hl=ja&q=%22Overlay+Weaver+Node%22&filter=0 Enjoy! Kazuyuki Shudo [EMAIL PROTECTED] http://www.shudo.net/ > Subject: [p2p-hackers] Overlay Weaver: An Overlay Construction Toolkit > From: [EMAIL PROTECTED] > Date: Tue, 17 Jan 2006 00:21:10 +0900 (JST) > 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,
<<inline: ow-web-intf.png>>
_______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
