在树状内容交付网络中集中放置存储服务器

IEEE EUROCON 2009 Pub Date : 2009-05-18 DOI:10.1109/EURCON.2009.5167906

M. Andreica, N. Tapus

{"title":"在树状内容交付网络中集中放置存储服务器","authors":"M. Andreica, N. Tapus","doi":"10.1109/EURCON.2009.5167906","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":256285,"journal":{"name":"IEEE EUROCON 2009","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Central placement of storage servers in tree-like content delivery networks\",\"authors\":\"M. Andreica, N. Tapus\",\"doi\":\"10.1109/EURCON.2009.5167906\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":256285,\"journal\":{\"name\":\"IEEE EUROCON 2009\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE EUROCON 2009\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EURCON.2009.5167906\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE EUROCON 2009","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EURCON.2009.5167906","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 7

摘要

在本文中，我们考虑了几个关于在树形拓扑(路径，树和仙人掌)的内容交付网络中存储服务器的最佳放置的问题。我们提出了在这些网络中定位(k+p)中心和连接k中心(和k中值)的几个新的算法解决方案，无论是在连续情况下还是在离散情况下。我们对所提出的算法的理论和实际效率进行了评论。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Central placement of storage servers in tree-like content delivery networks

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE EUROCON 2009

自引率

0.00%

发文量