.png){kind=icon}
返回
Using name-based mappings to increase hit rates
.png){kind=icon}
PRE
AI
DOI：10.1109/90.663936.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Clusters of identical intermediate servers are often created to improve availability and robustness in many domains, The use of proxy servers for the World Wide Web (WWW) and of rendezvous points in multicast routing are two such situations, However, this approach can be inefficient if identical requests are received and processed by multiple servers, We present an analysis of this problem, and develop a method called the highest random weight (HRW) mapping that eliminates these difficulties, Given an object name and a set of servers, HRW maps a request to a server using the object name, rather than any a priori knowledge of server states, Since HRW always maps a given object name to the same server within a given cluster, it may be used locally at client sites to achieve consensus on object-server mappings. We present an analysis of HRW and validate it with simulation results showing that it gives faster service times than traditional request allocation schemes such as round-robin or least-loaded, and adapts well to changes in the set of servers, HRW is particularly applicable to domains in which there are a large number of requestable objects, there is a significant probability that a requested object will be requested again, and the CPU load due to any single object can be handled by a single server, HRW has now been adopted by the multicast routing protocols PIMv2 and CBTv2 as its mechanism for routers to identify rendezvous points/cores.
Keyword:
caching
client-server systems
computer networks
distributed agreement
multicast routing
proxies
World Wide Web
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
3.6
论文数:
4.4K
被引数:
9.5K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏
查看更多内容