Abstract
Multimedia services typically need not only huge resources but also a fairly stable level of Quality of Services. This requires server architectures that enable continuous adaptation. The Adaptive Distributed Multimedia Server (ADMS) of the University Klagenfurt is able to dynamically add and remove nodes to the actual configuration, thus realizing the offensive adaptation approach.
This paper focuses on the optimal placement of nodes for hosting certain ADMS components (the so-called data collectors, collecting and streaming stripe units of a video) in the network. We propose four different algorithms for host recommendation and compare the results gained by running their implementations on different test networks. The greedy algorithm seems to be a clear looser. Among the three other algorithms (particle swarm, linear programming and incremental) there is no single winner of the comparison, they can be applied in a smart combination.
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
Apple Computer, Inc. QuickTime Streaming Server: Darwin Streaming Server: Administrator’s Guide (2002), http://developer.apple.com/darwin/projects/streaming/
Helix Community: Helix Universal Server Administration Guide (2002), https://www.helixcommunity.org/2002/intro/platform
Tusch, R.: Towards an adaptive distributed multimedia streaming server architecture based on service-oriented components. In: Böszörményi, L., Schojer, P. (eds.) JMLC 2003. LNCS, vol. 2789, pp. 78–87. Springer, Heidelberg (2003)
Tusch, R., Böszörményi, L., Goldschmidt, B., Hellwagner, H., Schojer, P.: Offensive and Defensive Adaptation in Distributed Multimedia Systems. Computer Science and Information Systems (ComSIS) 1, 49–77 (2004)
Goldschmidt, B., Szkaliczki, T., Böszörményi, L.: Placement of Nodes in an Adaptive Distributed Multimedia Server. Technical Report TR/ITEC/04/2.06, Institute of Information Technology, Klagenfurt University, Klagenfurt, Austria (2004)
Steen, M., Homburg, P., Tannenbaum, A.S.: Globe: A wide-area distributed system. IEEE Concurrency (1999)
Li, B., Golin, M., Italiano, G., Deng, X., Sohraby, K.: On the optimal placement of web proxies in the internet. In: Proceedings of the Conference on Computer Communications, IEEE Infocom (1999)
Qiu, L., Padmanabhan, V.N., Voelker, G.M.: On the placement of web server replicas. In: INFOCOM, pp. 1587–1596 (2001)
Cornuejols, G., Nemhauser, G.L., Wolsey, L.A.: The uncapacitated facility location problem. In: Mirchandani, P., Francis, R. (eds.) Discrete Location Theory, pp. 119–171. John Wiley and Sons, New York (1990)
Shmoys, D., Tardos, E., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the 29th ACM Symposium on Theory of Computing, pp. 265–274 (1997)
Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: IEEE Symposium on Foundations of Computer Science, pp. 378–388 (1999)
Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Proceedings of 5th International Workshop on Approximation Algorithms for Combinatorial Optimization (2002)
Dvorett, J.: Compatibility-based genetic algorithm: A new approach to the pmedian problem. In: Informs Fall 1999 Meeting (1999)
Kennedy, J., Eberhardt, R.C.: Swarm Intelligence. Morgan Kaufmann, San Francisco (2001)
Goldschmidt, B., Tusch, R., Böszörményi, L.: A corba-based middleware for an adaptive streaming server. Parallel and Distributed Computing Practices, Special issue on Dapsys 2002 (2003)
Goldschmidt, B., Tusch, R., Böszörményi, L.: A mobile agent-based infrastructure for an adaptive multimedia server. In: 4th DAPSYS, Austrian-Hungarian Workshop on Distributed and Parallel Systems, pp. 141–148. Kluwer Academic Publishers, Dordrecht (2002)
Goldschmidt, B., László, Z.: A proxy placement algorithm for the adaptive multimedia server. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 1199–1206. Springer, Heidelberg (2003)
Davis, L. (ed.): Handbook of Genetic Algorithms. Van Nostrand Reinhold (1991)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goldschmidt, B., Szkaliczki, T., Böszörményi, L. (2004). Placement of Nodes in an Adaptive Distributed Multimedia Server. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds) Euro-Par 2004 Parallel Processing. Euro-Par 2004. Lecture Notes in Computer Science, vol 3149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27866-5_102
Download citation
DOI: https://doi.org/10.1007/978-3-540-27866-5_102
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22924-7
Online ISBN: 978-3-540-27866-5
eBook Packages: Springer Book Archive