Distributed code assignments for CDMA Packet Radio Network
IEEE/ACM Transactions on Networking (TON)
Code assignment for hidden terminal interference avoidance in multihop packet radio networks
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for facility location problems (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Reductions among high dimensional proximity problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
A constant-factor approximation algorithm for the k-median problem
Journal of Computer and System Sciences - STOC 1999
Distributed, Self-Stabilizing Placement of Replicated Resources in Emerging Networks
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Object replication strategies in content distribution networks
Computer Communications
Proceedings of the international workshop on Workshop on multimedia information retrieval
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
ISWC '09 Proceedings of the 8th International Semantic Web Conference
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
An overview of Channel Assignment methods for multi-radio multi-channel wireless mesh networks
Journal of Parallel and Distributed Computing
Coloring spatial point processes with applications to peer discovery in large wireless networks
Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Coloring spatial point processes with applications to peer discovery in large wireless networks
IEEE/ACM Transactions on Networking (TON)
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
A content replication scheme for wireless mesh networks
Proceedings of the 22nd international workshop on Network and Operating System Support for Digital Audio and Video
Self-stabilizing local k-placement of replicas with minimal variance
SSS'12 Proceedings of the 14th international conference on Stabilization, Safety, and Security of Distributed Systems
Exploiting graph partitioning for hierarchical replica placement in WMNs
Proceedings of the 16th ACM international conference on Modeling, analysis & simulation of wireless and mobile systems
A divide-and-conquer approach for content replication in WMNs
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.02 |
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 that it 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.