<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xml:base="http://www.bibsonomy.org/user/boehr/p2p"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /user/boehr/p2p</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/29f01d742806201e42a05a38cbf6696ee/boehr"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/29f01d742806201e42a05a38cbf6696ee/boehr"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://www.usenix.org/events/iptps09/tech/"/><swrc:date>Thu Apr 23 08:08:52 CEST 2009</swrc:date><swrc:booktitle>8th International Workshop on Peer-to-Peer Systems (IPTPS &#039;09) April 21, 2009, Boston, MA</swrc:booktitle><swrc:title>Birds of a FETHR: Open, Decentralized Micropublishing</swrc:title><swrc:year>2009</swrc:year><swrc:keywords>microblogging p2p </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Daniel R. Sandler"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Dan S. Wallach"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/273439fe689edc935dcdfe303f88ded4b/boehr"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/273439fe689edc935dcdfe303f88ded4b/boehr"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dx.doi.org/10.1007/11558989_13"/><swrc:date>Tue Mar 31 14:29:06 CEST 2009</swrc:date><swrc:journal>Peer-to-Peer Systems IV</swrc:journal><swrc:pages>141-151</swrc:pages><swrc:title>FeedTree: Sharing Web Micronews with Peer-to-Peer Event Notification</swrc:title><swrc:year>2005</swrc:year><swrc:keywords>architecture network p2p pub-sub reference rss </swrc:keywords><swrc:abstract>Syndication of micronews, frequently-updated content on the Web, is currently accomplished with RSS feeds and client applications that poll those feeds. However, providers of RSS content have recently become concerned about the escalating bandwidth demand of RSS readers. Current efforts to address this problem by optimizing the polling behavior of clients sacrifice timeliness without fundamentally improving the scalability of the system. In this paper, we argue for a micronews distribution system called FeedTree, which uses a peer-to-peer overlay network to distribute RSS feed data to subscribers promptly and efficiently. Peers in the network share the bandwidth costs, which reduces the load on the provider, and updated content is delivered to clients as soon as it is available.
ER  -</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Daniel Sandler"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Alan Mislove"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Ansley Post"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Peter Druschel"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2574c3b703a6f110747deac11bc01a0fc/boehr"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2574c3b703a6f110747deac11bc01a0fc/boehr"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://portal.acm.org/citation.cfm?id=1135799"/><swrc:date>Tue Mar 31 14:20:52 CEST 2009</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:booktitle>WWW &#039;06: Proceedings of the 15th international conference on World Wide Web</swrc:booktitle><swrc:pages>113-122</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>FeedEx: collaborative exchange of news feeds</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>caching feed network p2p </swrc:keywords><swrc:abstract>As most blogs and traditional media support RSS or Atom feeds, the news feed technology becomes increasingly prevalent. Taking advantage of ubiquitous news feeds, we design FeedEx, a news feed exchange system. Forming a distribution overlay network, nodes in FeedEx not only fetch feed documents from the servers but also exchange them with neighbors. Among many benefits of collaborative feed exchange, we focus on the low-overhead, scalable delivery mechanism that increases the availability of news feeds. Our design of FeedEx is incentive-compatible so that nodes are encouraged into cooperating rather than free riding. In addition, for a better design of FeedEx, we analyze the data collected from 245 feeds for 10 days and present relevant statistics about news feed publishing, including the distributions of feed size, entry lifetime, and publishing rate.Our experimental evaluation using 189 PlanetLab machines, which fetch from real-world feed servers, shows that FeedEx is an efficient system in many respects. Even when a node fetches feed documents as infrequently as every 16 hours, it captures more than 90% of the total entries published, and those captured entries are available within 22 minutes on average after published at the servers. By contrast, stand-alone applications in the same condition show 36% of entry coverage and 5.7 hours of time lag. The efficient delivery of FeedEx is achieved with low communication overhead as each node receives only 0.9 document exchange calls and 6.3 document checking calls per minute on average.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="Edinburgh, Scotland" swrc:key="location"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1-59593-323-9" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://doi.acm.org/10.1145/1135777.1135799" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Seung Jun"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Mustaque Ahamad"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2e366cd3534b2c06124e5a7657b960b15/boehr"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2e366cd3534b2c06124e5a7657b960b15/boehr"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dx.doi.org/10.1007/3-540-45546-9_3"/><swrc:date>Wed Mar 25 14:25:24 CET 2009</swrc:date><swrc:journal>Networked Group Communication</swrc:journal><swrc:pages>30-43</swrc:pages><swrc:title>Scribe: The Design of a Large-Scale Event Notification Infrastructure</swrc:title><swrc:year>2001</swrc:year><swrc:keywords>feed p2p subscription technical </swrc:keywords><swrc:abstract>This paper presents Scribe, a large-scale event notification infrastructure for topic-based publish-subscribe applications.
Scribe supports large numbers of topics, with a potentiallylarge number of subscribers per topic. Scribe is built on top ofPastry, a generic peer-topeer object location and routing substrate overlayed on the Internet, and leverages Pastry’s reliability,self-organization and locality properties. Pastryi s used to create a topic (group) and to build an efficient multicast treefor the dissemination of events to the topic’s subscribers (members). Scribe provides weak reliabilitygu arantees, but weoutline how an application can extend Scribe to provide stronger ones.</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Antony Rowstron"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Anne-Marie Kermarrec"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Miguel Castro"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Peter Druschel"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description></rdf:RDF>
