Hi all, Overlay Weaver 0.8.3 is available now.
Overlay Weaver: An Overlay Construction Toolkit http://overlayweaver.sf.net/ This version implements a new idea "collective routing" in which multiple routing requests are processed collectively. It can reduce the number of messages and time for routing. Multiple requests across multiple routes can be bundled in a single message in case the targets of the requests are identical. I have started having positive results in experiments. I am not very sure what we should call the technique. I appreciate your suggestion about a proper name. May 3, 2008 Version 0.8.3 released. * DHT#put() uses the TTL value and the hashed secret which have been set by prior DHT#setTTL() and DHT#setHashedSecret() calls. DHT shell has now "setttl" and "setsecret" command to set them for following "put" commands. * DHT#put() and DHT#remove() accept multiple values for a single key. * DHT#put() and DHT#remove() bundles multiple put/remove requests to a single message if the targets of the requests are the same node. This change reduces the number of messages. April 28, 2008 Version 0.8.2 released. * Collective routing was implemented. * Put, get and remove commands of a DHT shell accept multiple key-value pairs once. * Bugs in recursive routing (driver) were fixed. * Routing success rate in Pastry was improved. When the Pastry implementation merges a node into a routing table and leaf sets, it merges the node into other tables. A loop in routing got fewer. * Berkeley DB Java Edition was updated from 3.2.74 to 3.2.76. > Message-Id: <[EMAIL PROTECTED]> > 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, _______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
