Distributed server replication in large scale networks
NOSSDAV '04 Proceedings of the 14th international workshop on Network and operating systems support for digital audio and video
Selfish caching in distributed systems: a game-theoretic analysis
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Distributed self-stabilizing placement of replicated resources in emerging networks
IEEE/ACM Transactions on Networking (TON)
Content and service replication strategies in multi-hop wireless mesh networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Adaptive strategies for efficiently locating internet-based servers in MANETs
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Bounded-Latency Content Distribution: Feasibility and Evaluation
IEEE Transactions on Computers
Design and analysis of adaptive strategies for locating internet-based servers in MANETs
Performance Evaluation
IEEE Transactions on Signal Processing
Content management in a mobile ad hoc network: beyond opportunistic strategy
International Journal of Communication Networks and Distributed Systems
Hi-index | 0.01 |
Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoc wireless networks, require replication of content, functionality, or configuration to enact or optimize communication tasks. The placement of these replicated resources can significantly impact performance. We present a novel self-stabilizing, fully distributed, asynchronous, scalable protocol that can be used to place replicated resources such that each node is "close" to some copy of any object. We describe our protocol in the context of a graph with colored nodes, where a node's color indicates the replica/task thatit is assigned. Our combination of theoretical results and simulation prove stabilization of the protocol, and evaluate its performance in the context of convergence time, message transmissions, and color distance. Our results show that the protocol generates colorings that are close to the optimal under a set of metrics, making such a protocol ideal for emerging networking systems.