UsenetDHT: A Low Overhead Usenet Server

UsenetDHT is a system that reduces the storage and bandwidth resources required to run a Usenet server by spreading the burden of data storage across participants. UsenetDHT distributes data using a distributed hash table. The amount of data that must be stored on each node participating in UsenetDHT scales inversely with the number of participating nodes. Each node’s bandwidth requirements are proportional to the fraction of articles read rather than to the total number posted.

[1]  M. Frans Kaashoek,et al.  Embedded Inodes and Explicit Grouping: Exploiting Disk Bandwidth for Small Files , 1997, USENIX Annual Technical Conference.

[2]  Manfred Hauswirth,et al.  NewsCache - A High-Performance Cache Implementation for Usenet News , 1999, USENIX Annual Technical Conference, General Track.

[3]  Rodrigo Rodrigues,et al.  Proceedings of Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems Hotos Ix: the 9th Workshop on Hot Topics in Operating Systems High Availability, Scalable Storage, Dynamic Peer Networks: Pick Two , 2022 .

[4]  Carsten Bormann,et al.  The Newscaster Experiment — Distributing Usenet News via Many-to-More Multicast , 1999 .

[5]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[6]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[7]  Brian Kantor,et al.  Network News Transfer Protocol , 1986, RFC.

[8]  David R. Karger,et al.  Diminished Chord: A Protocol for Heterogeneous Subgroup Formation in Peer-to-Peer Networks , 2004, IPTPS.

[9]  David R. Karger,et al.  Wide-area cooperative storage with CFS , 2001, SOSP.

[10]  Stan Barber,et al.  Common NNTP Extensions , 2000, RFC.

[11]  Robert Tappan Morris,et al.  Designing a DHT for Low Latency and High Throughput , 2004, NSDI.

[12]  Robert Morris,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.