On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Exploiting IP multicast in content-based publish-subscribe systems
IFIP/ACM International Conference on Distributed systems platforms
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
| Hi-index | 0.00 |
Content dissemination systems comprise a large number of nodes that organize themselves into different topologies. In this paper, we explore the role of topologies in autonomously coping with failures. The topologies we consider are based on regular, random, small-world, and power law graphs. Connections within these topologies can account for network proximity and are suitable for real-time communications. We explore specific attributes of a topology that contribute to its failure resiliency. The metrics that we use to profile this resilience include: communication path lengths, network partitions, migration of workloads, and the impact on system throughput. This research will allow designers to choose topologies or configure metrics for a specific topology to achieve their performance objectives.