高连通性和小距离镜像服务器的定位方法

2009 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2009-11-04 DOI:10.1109/INCOS.2009.53

Ryota Nakamura, Akito Hashimoto, H. Miwa

{"title":"高连通性和小距离镜像服务器的定位方法","authors":"Ryota Nakamura, Akito Hashimoto, H. Miwa","doi":"10.1109/INCOS.2009.53","DOIUrl":null,"url":null,"abstract":"The server mirroring method has extensively used as the technology for contents delivery networks. Several mirror servers that serve same contents are located in a network, and an access is navigated to one of the mirror servers based on the delay time and the load balance. The location of the mirror servers with high reliability against a failure and small delay times of accesses is important.In this paper, we deal with the server location problem, which determines the location of the mirror servers that satisfies the following two constraints: the reachability to at least one server is guaranteed even if a link fails, and the maximum of the sum of the distances to the servers is restricted. We propose two heuristic algorithms for the problem and evaluate the algorithms by applying to some real networks. The results show that the algorithms perform well.","PeriodicalId":145328,"journal":{"name":"2009 International Conference on Intelligent Networking and Collaborative Systems","volume":"236 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Methods of Locating Mirror Servers with High Connectivity and Small Distances\",\"authors\":\"Ryota Nakamura, Akito Hashimoto, H. Miwa\",\"doi\":\"10.1109/INCOS.2009.53\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The server mirroring method has extensively used as the technology for contents delivery networks. Several mirror servers that serve same contents are located in a network, and an access is navigated to one of the mirror servers based on the delay time and the load balance. The location of the mirror servers with high reliability against a failure and small delay times of accesses is important.In this paper, we deal with the server location problem, which determines the location of the mirror servers that satisfies the following two constraints: the reachability to at least one server is guaranteed even if a link fails, and the maximum of the sum of the distances to the servers is restricted. We propose two heuristic algorithms for the problem and evaluate the algorithms by applying to some real networks. The results show that the algorithms perform well.\",\"PeriodicalId\":145328,\"journal\":{\"name\":\"2009 International Conference on Intelligent Networking and Collaborative Systems\",\"volume\":\"236 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Intelligent Networking and Collaborative Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INCOS.2009.53\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Intelligent Networking and Collaborative Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INCOS.2009.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

服务器镜像技术作为内容分发网络的技术被广泛使用。提供相同内容的多个镜像服务器位于网络中，根据延迟时间和负载平衡将访问导航到其中一个镜像服务器。镜像服务器的位置对故障具有高可靠性，并且访问延迟时间短，这一点很重要。在本文中，我们处理了服务器位置问题，该问题确定了镜像服务器的位置，该位置满足以下两个约束:即使链路故障也保证至少有一个服务器可达，并且限制到服务器的距离总和的最大值。针对该问题提出了两种启发式算法，并通过实际网络对算法进行了评价。结果表明，该算法具有良好的性能。

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

查看原文本刊更多论文

Methods of Locating Mirror Servers with High Connectivity and Small Distances

The server mirroring method has extensively used as the technology for contents delivery networks. Several mirror servers that serve same contents are located in a network, and an access is navigated to one of the mirror servers based on the delay time and the load balance. The location of the mirror servers with high reliability against a failure and small delay times of accesses is important.In this paper, we deal with the server location problem, which determines the location of the mirror servers that satisfies the following two constraints: the reachability to at least one server is guaranteed even if a link fails, and the maximum of the sum of the distances to the servers is restricted. We propose two heuristic algorithms for the problem and evaluate the algorithms by applying to some real networks. The results show that the algorithms perform well.

求助全文

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

来源期刊

2009 International Conference on Intelligent Networking and Collaborative Systems

自引率

0.00%

发文量