A server allocation and placement algorithm for content distribution

Proceedings of the 2002 IEEE Information Theory Workshop, ITW 2002

Volumn , Issue , 2002, Pages 26-28

  Cameron, Craig ^a   Low, Steven H ^a   Wei, David X ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; INFORMATION THEORY; LOCATION; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; VECTOR QUANTIZATION;

APPROXIMATE MODEL; CONTENT DISTRIBUTION; PLACEMENT ALGORITHM; PROBABILITY DENSITIES; SERVER LOCATION; SERVER PLACEMENTS; SOURCE-CODING; TIME COMPLEXITY;

ALGORITHMS;

EID: 37149048664     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2002.1115407     Document Type: Conference Paper

References (6)

1. Craig W. Carneron, Steven H. Low, and David X. Wei, "High-density model for server allocation and placement," In Proceedings of A CM Sigrnetrics, Marina del Rey, CA, June 2002.
2. J. Kangasharju, K. W. Ross, and J.W. Roberts, "Locating copies of objects using the domain name system," In Proceedings of the 4th International Caching Workshop, March 1999.
3. O. Kariv and S. L. Hakimi, "An algorithmic approach to network location problems. II: the p-medians," SIAM J. Appl. Math., 37(3):539-560, December 1979.
4. Balachander Kríshnamurthy and Jía Wang, "On network-aware clustering of web clients," In Proceedings of ACM SIGCOMM 2000, August 2000.
5. C. Papadimitriou, "Worst-case and probabilistic analysis of a geometric location problem," SIAM J. Comput., 10:542-557, 1981.
6. A. Shaikh, R. Tewari, and M. Agrawal, "On the effectiveness of DNS-based server selection," In Proceedings of IEEE Infocom, April 2001.