作者
Sylvia Ratnasamy, Mark Handley, Richard Karp, Scott Shenker
发表日期
2002/6/23
研讨会论文
Proceedings. Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
卷号
3
页码范围
1190-1199
出版商
IEEE
简介
A number of large-scale distributed Internet applications could potentially benefit from some level of knowledge about the relative proximity between its participating host nodes. For example, the performance of large overlay networks could be improved if the application-level connectivity between the nodes in these networks is congruent with the underlying IP-level topology. Similarly, in the case of replicated Web content, client nodes could use topological information in selecting one of multiple available servers. For such applications, one need not find the optimal solution in order to achieve significant practical benefits. Thus, these applications, and presumably others like them, do not require exact topological information and can instead use sufficiently informative hints about the relative positions of Internet hosts. In this paper, we present a binning scheme whereby nodes partition themselves into bins such that …
引用总数
2002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202423851031311091221031159668565231311920147210342
学术搜索中的文章
S Ratnasamy, M Handley, R Karp, S Shenker - Proceedings. Twenty-First Annual Joint Conference of …, 2002