Achieving scalability and expressiveness in an Internet-scale event notification service
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Wide-area cooperative storage with CFS
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Comparing Persistent Computing with Autonomic Computing
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Persistent Computing Systems as Continuously Available, Reliable, and Secure Systems
ARES '06 Proceedings of the First International Conference on Availability, Reliability and Security
A comparative study between soft system bus and traditional middlewares
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
Hi-index | 0.01 |
Large scale computing systems which can run for unlimited time and can evolve over time have a growing demand in this modern information society. Soft System Buses (SSBs) were proposed to provide middleware platform support to such computing systems. This paper proposes a design of SSBs based on Chord -- a distributed hash table protocol for large scale peer to peer systems. Our design fulfills the requirements of SSBs like scalability, automatic recovery from failures, data preservation and incremental runtime upgradeability and maintainability. An assessment of our design from the view point of the requirements of SSBs is also presented.