Willow: DHT, Aggregation, and Publish/Subscribe in One Protocol

van Renesse and Bozdog

distributed hashtable dht publish/subscribe pub/sub

@inproceedings{van-renesse:p2p-2005,
  title={{Willow}: {DHT}, Aggregation, and Publish/Subscribe in One Protocol},
  author={van Renesse, R. and Bozdog, A.},
  booktitle={International Workshop on Peer-to-Peer Systems},
  year={2004},
  publisher={Springer-Verlag}
}

Attach:VanRenesse-P2P2004.pdf

Bounds: log N memory, log N latency, log^2 N aggregation

Proximity aware, preferring short hops over long ones

 key

is associated with each multicast group, and one or more trees are build on a per-key basis, and these trees follow the DHT routes for those keys. queries that do not lend themselves well to aggregation. For example, the agent with the median load would be impossible to determine in the way described above.

Of note:

• Bayeux
• SplitStream