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
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
GoCast: Gossip-Enhanced Overlay Multicast for Fast and Dependable Group Communication
DSN '05 Proceedings of the 2005 International Conference on Dependable Systems and Networks
Dynamic placement for clustered web applications
Proceedings of the 15th international conference on World Wide Web
Overlay Network Topology Reconfiguration in Byzantine Settings
PRDC '07 Proceedings of the 13th Pacific Rim International Symposium on Dependable Computing
An ontology-driven semantic bus for autonomic communication elements
MACE'10 Proceedings of the 5th IEEE international conference on Modelling autonomic communication environments
| Hi-index | 0.00 |
Due to overprovisioning of infrastructure nodes in overlay networks, many nodes remain idle at times of low network load. Some of these nodes could be temporary removed from the overlay topology and could then be used for other purposes or alternatively be temporarily shut down, to save energy.In this paper we present several algorithms to select the subset of overlay nodes that should be part of the overlay topology. This decision is made based on the current and (estimated) future network load and the locality of the clients and servers connected to the overlay network. As network load or conditions change, additional nodes can be dynamically (de)activated. Our algorithms can be used in conjunction with existing overlay topology construction protocols.Through extensive simulations, we have evaluated and compared the performance of our algorithms.