Abstract
Content Distribution has to date been addressed by a mix of centralized and uncoordinated distributed processes, such as server replication and traditional node caching mechanisms, respectively. It is an inherently distributed process that is also increasingly relying on entities that are not only increasingly distributed but also increasingly autonomous. Consequently, centralized – and typically targeting the “socially optimal” – decisions are rather unrealistic for a distributed environment of autonomic entities. Instead, a distributed management of the engaged autonomic entities, which take decisions dynamically, should be key to efficient content distribution. The latter is advocated in this paper in which two entities that are central to content distribution – specifically the content and the node storage – are considered and it is discussed how their autonomic behavior drives the operation of a content distribution network. In the first case, it is the content that manages itself by dynamically generating duplicate copies and pushing them to (seizing) the appropriate storage. In the second one, it is the node storage that is in charge, deciding on the content to be locally stored. The decisions taken by the distributed and autonomic entities may – in the extreme case – be driven by self-awareness and self-interest only, without any network state information and co-operativeness. Or, they may use (some) network information and take decisions in a more cooperative manner, despite their autonomic and self-interest-driven nature. An example is presented on the later case, showing the potential both social and individual benefits.
This work and its dissemination efforts have been supported in part by the IST Program of the European Union under contract IST-6475 (ACCA) and by the project entitled “Always Best Connected Provision in Heterogeneous Mobile Networks” funded by the Greek Ministy of Education under the framework “Pythagoras”.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Antoniadis, P., Courcoubetis, C., Mason, R.: Comparing economic insentives in peer-to-peer networks. Computer Networks 46(1), 1–146 (2004)
Baev, I.D., Rajaraman, R.: Approximation algorithms for data placement in arbitrary networks. In: Proceedings of the 12th Annual Symposium on Discrete Algorithms (ACM-SIAM SODA), pp. 661–670 (January 2001)
Chun, B.-G., Chaudhuri, K., Wee, H., Barreno, M., Papadimitriou, C.H., Kubiatowicz, J.: Selfish caching in distributed systems: A game-theoretic analysis. In: Proc. ACM Symposium on Principles of Distributed Computing (ACM PODC), Newfoundland, Canada (July 2004)
Cronin, E., Jamin, S., Jin, C., Kurc, A.R., Raz, D., Shavitt, Y.: Constraint mirror placement on the internet. IEEE Journal on Selected Areas in Communications 20(7) (2002)
Fan, L., Cao, P., Almeida, J., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE/ACM Transactions on Networking 8(3), 281–293 (2000)
Gibson, G.A., Van Meter, R.: Network attached storage architecture. Communications of the ACM 43(11), 37–45 (2000)
Hadjiefthymiades, S., Georgiadis, Y., Merakos, L.: A game theoretic approach to web caching. In: Proceedings of IFIP Networking 2004, Athens, Greece (May 2004)
IBM Corp. Autonomic Computing initiative (2002), http://www.research.ibm.com/autonomic/
Kangasharju, J., Roberts, J., Ross, K.W.: Object replication strategies in content distribution networks. Computer Communications 25(4), 376–383 (2002)
Korupolu, M.R., Plaxton, C.G., Rajaraman, R.: Placement algorithms for hierarchical cooperative caching. In: Proceedings of the 10th Annual Symposium on Discrete Algorithms (ACM-SIAM SODA), pp. 586–595 (1999)
Laoutaris, N., Zissimopoulos, V., Stavrakakis, I.: Distributed selfish replication (2004) [submitted]
Laoutaris, N., Zissimopoulos, V., Stavrakakis, I.: Joint object placement and node dimensioning for internet content distribution. Information Processing Letters 89(6), 273–279 (2004)
Laoutaris, N., Zissimopoulos, V., Stavrakakis, I.: On the optimization of storage capacity allocation for content distribution. Computer Networks (2005) [to appear]
Leff, A., Wolf, L., Yu, P.S.: Replication algorithms in a remote caching architecture. IEEE Transactions on Parallel and Distributed Systems 4(11), 1185–1204 (1993)
Li, B., Golin, M.J., Italiano, G.F., Deng, X., Sohraby, K.: On the optimal placement of web proxies in the internet. In: Proceedings of the Conference on Computer Communications (IEEE Infocom), New York (March 1999)
Li, J., Reiher, P.L., Popek, G.J.: Resilient self-organizing overlay networks for security update deliver. IEEE Journal on Selected Areas in Communications 22(1), 189–202 (2004)
Pan, J., Hou, Y.T., Li, B.: An overview DNS-based server selection in content distribution networks. Computer Networks 43(6) (December 2003)
Qiu, L., Padmanabhan, V., Voelker, G.: On the placement of web server replicas. In: Proceedings of the Conference on Computer Communications (IEEE Infocom), Anchorage, Alaska (April 2001)
Saroiu, S., Gummadi, K.P., Dunn, R.J., Gribble, S.D., Levy, H.M.: An analysis of internet content delivery systems. In: Proceedings of the 5th Symposium on Operating Systems Design and Implementation (OSDI 2002) (December 2002)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)
Turner, D.A., Ross, K.W.: A lightweight currency paradigm for the P2P reseource market (2003) [submitted work]
Wessels, D., Claffy, K.: ICP and the Squid web cache. IEEE Journal on Selected Areas in Communications 16(3) (April 1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laoutaris, N., Panagakis, A., Stavrakakis, I. (2005). Content Distribution Through Autonomic Content and Storage Management. In: Smirnov, M. (eds) Autonomic Communication. WAC 2004. Lecture Notes in Computer Science, vol 3457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11520184_6
Download citation
DOI: https://doi.org/10.1007/11520184_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27417-9
Online ISBN: 978-3-540-32009-8
eBook Packages: Computer ScienceComputer Science (R0)