Referenced Items are not available for this document.
In this paper we consider several problems regarding the optimal placement of storage servers in content delivery networks with tree-like topologies (paths, trees and cacti). We present several novel algorithmic solutions for locating (k+p)-centers and connected k-centers (and k-medians) in these networks, both in the continuous and the discrete cases. We comment both on the theoretical and the practical efficiency of the proposed algorithms.
Published in:
EUROCON 2009, EUROCON '09. IEEE
Date of Conference: 18-23 May 2009
- Page(s):
- 1901 - 1908
- E-ISBN :
- 978-1-4244-3861-7
- Print ISBN:
- 978-1-4244-3860-0
- INSPEC Accession Number:
- 10798931
- Conference Location :
- St.-Petersburg
- Digital Object Identifier :
- 10.1109/EURCON.2009.5167906
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
