Abstract
In content networks, a replication group refers to a set of nodes that cooperate with each other to retrieve information objects from a distant server. Each node locally replicates a subset of the server objects, and can access objects stored by other nodes at a smaller cost. In a network with autonomous nodes, the problem is to construct efficient distributed algorithms for content replication that decrease the access cost for all nodes. Such a network also has to deal with churn, i.e. random “join” and “leave” events of nodes in the group. Churn induces instability and has a major impact on cooperation efficiency. Given a probability estimate of each node being active that is common knowledge between all nodes, we propose in this paper a distributed churn-aware object placement algorithm. We show that in most cases it has better performance than its churn unaware counterpart, increases fairness and incites all nodes to cooperate.
This work has been supported in part by the following projects funded by the IST FET Program of the European Commission: CASCADAS (Component-ware for Autonomic Situation-aware Communications, and Dynamically Adaptable Services) under contract FP6-027807, BIONETS (BIOlogically-inspired autonomic NETworks and Services) under contract FP6-027748, and NoE CONTENT (IST-384239).
Chapter PDF
Similar content being viewed by others
References
Leff, A., Wolff, J., Yu, P.: Replication algorithms in a remote caching architecture. IEEE Trans. Par. and Distr. Systems 4(11), 1185–1204 (1993)
Laoutaris, N., Telelis, O., Zissimopoulos, V., Stavrakakis, I.: Distributed selfish replication. IEEE Trans. Par. Distr. Systems 17(12), 1401–1413 (2006)
Jaho, E., Jaho, I., Stavrakakis, I.: Distributed selfish replication under node churn. In: Proc. Med-Hoc-Net (2007) Poster session
Basar, T., Olsder, G.: Dynamic noncooperative game theory, 2nd edn. Society for Industrial and Applied Mathematics (SIAM) (1999)
Avrachenkov, K., Nemirovsky, D., Pham, K.S.: A survey on distributed approaches to graph based reputation measures. In: Proc. of International Workshop on Tools for solving Structured Markov Chains (SMCtools) (2007)
Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and Zipf-like distributions: Evidence and implications. In: Proc. IEEE INFOCOM (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 IFIP International Federation for Information Processing
About this paper
Cite this paper
Jaho, E., Koukoutsidis, I., Stavrakakis, I., Jaho, I. (2008). Cooperative Replication in Content Networks with Nodes under Churn. In: Das, A., Pung, H.K., Lee, F.B.S., Wong, L.W.C. (eds) NETWORKING 2008 Ad Hoc and Sensor Networks, Wireless Networks, Next Generation Internet. NETWORKING 2008. Lecture Notes in Computer Science, vol 4982. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-79549-0_40
Download citation
DOI: https://doi.org/10.1007/978-3-540-79549-0_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-79548-3
Online ISBN: 978-3-540-79549-0
eBook Packages: Computer ScienceComputer Science (R0)