Deterministic SkipNet
Nicholas J. A. Harvey, J. Ian Munro
Formats
PDF (46 KBytes)
PostScript (136 KBytes)
Full Version (Draft)
PDF (50 KBytes)
Keywords
Abstract
We present a deterministic scalable overlay network. In contrast, most previous overlays use randomness or hashing (pseudo-randomness) to achieve a uniform distribution of data and routing traffic.
In Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing (PODC '03), Boston, MA. July 2003.