A proxy placement algorithm for the adaptive multimedia server

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Multimedia services are becoming widespread, while the network capacity can not keep up with the growth of user demands. Usually proxies are used to overcome the QoS degradation. One of the fundamental problems of applying proxies is to recognize the relevant set of proxy placement criteria, and to find a good algorithm. In this paper we propose a greedy algorithm variant, ams-greedy, that aims at taking into account the different property preferences of the proxy-server and the proxy-client links. We also analyse the consequences of the initial results. Keywords: Greedy algorithm, optimization, proxies, distributed multimedia. © Springer-Verlag 2003.

Cite

CITATION STYLE

APA

Goldschmidt, B., & László, Z. (2004). A proxy placement algorithm for the adaptive multimedia server. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2790, 1199–1206. https://doi.org/10.1007/978-3-540-45209-6_161

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free