"One donated technology, called the Web Services Invocation Framework, allows Web services to travel across different network protocols. It supports Simple Object Access Protocol (SOAP), a communications format for businesses to link and conduct transactions online, but it also supports other ways of sending messages, including Java Messaging Service, Remote Method Invocation, and even instant-messaging software, Hebner said. For example, the framework will allow simple Web services, such as stock quotes or weather reports, to be sent as instant messages, he said."
international workshop on p2p | http://www.elet.polimi.it/Users/DEI/Sections/CompEng/GianPietro.Picco/ntw02-p2p/
The selected papers have been posted. Another good paper from Vladimir: http://www.hpl.hp.com/techreports/2001/HPL-2001-324.pdf. Includes ideas similar to U-P2P about definining "vocabularies" for resources that can be shared.
[june 17, 2002]
[june 10, 2002]
[june 7, 2002]
Useful links about Web Services and management of Web Services.
[june 3, 2002]
Project that exploits Unix documentation to create Unix documentation. The problem he's aiming to solve is that Unix/Opensource? projects have a lot of documentation but the formatting and access methods are inconsistent.
"If, as asserted above, the documentation is broken, the integration of system metadata is a complete disaster. With sufficient effort, almost any desired piece of metadata can be acquired. The user might have to parse a data file, run a command, or grovel through some source code, but it's all there."
[may 29, 2002]
Paper about "''FASD: A Fault-tolerant, Adaptive, Scalable, Distributed Search Engine''" - approach is to generate a metadata key by analysing frequency of terms when a document is inserted into freenet, metadata key is also inserted into the freenet network, metadata keys are like vectors - use "cosine correlation" between query and metadata key to determine closeness.
p2p network simulators | http://www.neurogrid.net/php/simulation.php
From a message on p2p-hackers (http://zgp.org/pipermail/p2p-hackers/2002-May/000594.html) - "The NeuroGrid? simulator is written in Java and set up so that it can be extended for different p2p architectures. If you want to do low-level simulations for specific networks then both Freenet and LimeWire? (Gnutella) have good simulation code."
p2p survey | http://www.hpl.hp.com/techreports/2002/HPL-2002-57.html
Thorough overview of P2P - from abstract: "This survey reviews the field of P2P systems and applications by summarizing the key concepts and giving an overview of the most important systems. Design and implementation issues of P2P systems are analyzed in general, and then revisited for each of the case studies described in Section 6. This survey will help people understand the potential benefits of P2P in the research community and industry."
The systems discussed in the Case Studies section are Avaki, Seti@home, Groove, Magi, Freenet, Gnutella, JXTA and .NET.
More HP technical reports are here: http://www.hpl.hp.com/techreports/2002/ - some are concerned with P2P but lots of interesting stuff here. (thanks Vladimir)
[may 17, 2002]
Announced: http://zgp.org/pipermail/p2p-hackers/2002-May/000586.html Uses the term "Content-Addressable Web".
Specs are here: http://open-content.net/specs/draft-jchapweske-caw-03.html
Looks like main innovation is that the HTTP reply message would include a list of mirrors that host the same file which could be used in parallel to download the file. Content hashes are used to make sure the files have not been tampered with.
papers | http://www.cs.princeton.edu/~qlv/download/searchp2p_full.pdf
Abstracts on on Qin Lv's pubs page: http://www.cs.princeton.edu/~qlv/research.htm
Strategies for making Gnutella search more scalable: random walks instead of flooding, replication strategies, network building algos (because random graph nets have better properties than power law)
p2p search | http://zgp.org/pipermail/p2p-hackers/2002-May/000587.html
Seminar announcement. Abstract has some interesting stuff about structured vs. unstructured. They present it as a tradeoff between "scope (ability to find infrequent items) and support for partial-match queries". (e.g. I guess put another way, scope refers to the inability of unstructured networks to give a definitive answer as to whether a file exists or not in the system)
Sounds like they're solving it using an unstructured network with better query routing - e.g. increasing the chance that the file of interest is in your TTL?
"Yet, we obtain orders of magnitude improvement in the efficiency of locating rare items. Our approach exploits associations inherent in human selections to steer the search process to peers that are more likely to have an answer to the query."
[may 16, 2002]
Who's deciding those schemas? I guess they are.
[april 27, 2002]
"The Quest for an XML Query Standard", long article from March, 1999 about a 1998 conference on XML query languages.
conference | http://www.bncf.net/dc2002
DC-2002: Metadata for e-Communities: Supporting Diversity and Convergence. Florence, 13-17 October, 2002. Deadline: June 15th, 2002.
[april 24, 2002]
International Workshop on reliable peer-to-peer distributed systems - Osaka, Japan, October 13, 2002 - deadline: May 20, 2002
p2p spam filtering | http://www.newscientist.com/news/news.jsp?id=ns99992141
Article about "Folsom" a spam-filtering program that claims to reduce false positives. The innovations are applying machine learning to improve filtering and P2P sharing of the signatures of files designated as spam.
[april 8, 2002]
(via p2p-hackers) Kind of like a tutorial about implementing trust metrics by the guy who created Advogato. Includes pointers to lots of interesting stuff like Brin, Page et. al's paper on Pagerank and his own about Advogato's trust metrics. Also includes pointers to code. His thesis (http://www.levien.com/thesis/thesis.ps) includes a bit about distributed trust metrics in section 6.4.
Interesting because something like this could be used in U-P2P. We'll have many users with their own meta-data databases. There will be overlapping "wrappers", e.g. users who've submitted their own meta-data descriptions of some common object. Using distributed trust could allow users to determine which meta-data description was most accurate (like distributed bitzi).
[april 5, 2002]
"The design and implementation of an intentional naming system" paper from '99 about a DNS-like system for resolving arbitrary attribute/value pairs.
[april 4, 2002]
"A Measurement Study of Peer-to-Peer File Sharing Systems" by researchers at U. Washington (Stefan Saroiu, Krishna Gummadi and Steven Gribble). PDF version is here: http://www.cs.washington.edu/homes/tzoompy/publications/mmcn/2002/mmcn.pdf
papers | http://web.archive.org/web/20010606114842/http://www.clip2.com/gnutella.html
An archive of the oft-sited but no-longer available paper entitled "Gnutella: To the Bandwidth Barrier and Beyond" from the now defunct Clip2 corporation.
papers | http://www.acm.org/sigcomm/sigcomm2001/p13-ratnasamy.pdf
"A Scalable Content-addressable Network" - the original paper about CAN. Google has it in HTML but its a little mangled: http://220.127.116.11/search?q=cache:05YhsEqzqg0C:www.acm.org/sigcomm/sigcomm2001/p13-ratnasamy.pdf
papers | http://www.google.com/search?q=cache:IuPiE-v3Y98C:conferences.oreillynet.com/presentations/p2pweb2001/Waterhouse_S_1792.ppt+pastry+can+chord&hl=en
Comparison of JXTA to other methods for distributed search including search in CANs.
papers | http://www.research.microsoft.com/~antr/SQUIRREL/
Project based on Past to develop a distributed web cache. URLs are used as keys.
[april 3, 2002]
Presentations from the O'Reilly P2P and Web Services conference have been posted.
Google has some of them in html format here: http://www.google.ca/search?hl=en&as_qdr=all&q=ppt+site%3Aconferences.oreillynet.com
[april 2, 2002]
The P2P workshop requires the use of Springer's template for Lecture Notes in Computer Science, but their site seems to be down. Here's a link to the relevant page from archive.org.
[april 1, 2002]
Article about Teoma (http://www.teoma.com), a search engine that tries to index communities of web pages.
"Teoma's special sauce is its ability to identify, on the fly, "communities" of interlinked web sites, which in turn help categorize results by topic areas rather than just keywords. The idea, sometimes known as "Kleinberg theory", uses a system of "hubs" and "authorities" to identify communities."
[march 28, 2002]
International Workshop on Peer-to-Peer Computing - A workshop co-located with Networking 2002 - May 19-24, 2002 - Pisa, Italy.
[march 22, 2002]
Notes on the state of the art in scalable p2p search with a good bibliography and links to lots of p2p sites. Provides some context for current p2p research: e.g. where did these ideas come from.
"Hypercube, butterfly, and Plaxton tree architectures for highly parallel computers have re-emerged in the P2P space in CAN, Chord, Pastry, Tapestry, Past, etc.. These P2P architectures don't flood queries but devise mapping methods between object id spaces and sets of nodes."
news | http://agents.umbc.edu/new.html
Recent stories of interest to the Agent research community - lots of semantic web stuff.
[march 20, 2002]
How to write a tech report.
[march 19, 2002]
"The JXTA Bridge project is designed to allow SOAP communication over the JXTA P2P network."
The best I can figure the point of this is to allow JXTA applications to be easily turned into web services.
[march 18, 2002]
Morpheus is implementing some dopey scheme to erase downloaded songs after a certain number of listens - but only for those companies which do business with them. Sounds like blackmail to me.
papers | http://www.cs.rice.edu/Conferences/IPTPS02/
All the papers from IPTPS '02 have been posted.
papers | http://www.pdos.lcs.mit.edu/chord
Chord project: research on filesystems based around a hashtable distributed over a network of peers. Includes some papers that were accepted at IPTPS '02.
news | http://www.recordare.com/xml.html
(via http://www.oreillynet.com/weblogs) An XML format for representing music. Of relevance:
"It would be possible to build an XSLT stylesheet to convert MusicXML? into a web-readable format, and a proof of concept for this was done by one MusicXML? user. But making something of professional quality is much harder. Since there are already so many music display programs on the market, our focus is on building translators between them, rather than creating our own native display program."
[march 15, 2002]
Mailing list for conference announcements/calls for papers relevant to Software Eng. community. Instructions for subscribe/contribute, etc. are here: http://www.cs.colorado.edu/serl/seworld/index.html
conferences | http://icdcs2002.di.fc.ul.pt/travel_grants.html
Link to instructions on how to apply for a travel grant for ICDCS-2002. What's required: justifying letter from applicant, affiliated institution, cost of ticket, justifying letter from prof. This page also has instructions for registration in the sidebar.
conferences | /Resh02Feedback?
Our submission to RESH '02 was accepted. Here's the paper (in Word format) http://www.boing.org/~alokem/up2p/up2p-resh-2.doc. the conference details are here: http://www.dvs1.informatik.tu-darmstadt.de/DVS1/research/resh02/. RESH '02 will be held in Vienna on July 2, 2002 in conjunction with the 22nd International Conference on Distributed Computing Systems (ICDCS-2002).
papers | http://www.computer.org/internet/ic2002/w1toc.htm
Latest issue of IEEE Internet Computing has a few interesting papers on P2P. Requires IEEE yadda yadda to access though.