Topologically-aware overlay construction and server selection

DMCA

Topologically-aware overlay construction and server selection (2002)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Sylvia Ratnasamy , Mark Handley , Richard Karp , Scott Shenker

Citations:

341 - 3 self

BibTeX

@INPROCEEDINGS{Ratnasamy02topologically-awareoverlay,
    author = {Sylvia Ratnasamy and Mark Handley and Richard Karp and Scott Shenker},
    title = {Topologically-aware overlay construction and server selection},
    booktitle = {},
    year = {2002},
    publisher = {}
}

OpenURL

Abstract

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 nodes that fall within a given bin are relatively close to one another in terms of network latency. Our binning strategy is simple (requiring minimal support from any measurement infrastructure), scalable (requiring no form of global knowledge, each node only needs knowledge of a small number of well-known landmark nodes) and completely distributed (requiring no communication or cooperation between the nodes being binned). We apply this binning strategy to the two applications mentioned above: overlay network construction and server selection. We test our binning strategy and its application using simulation and Internet measurement traces. Our results indicate that the performance of these applications can be significantly improved by even the rather coarse-grained knowledge of topology offered by our binning scheme.

Keyphrases

server selection topologically-aware overlay construction binning strategy optimal solution node partition large-scale distributed internet application informative hint web content host node client node large overlay network multiple available server significant practical benefit relative proximity internet measurement trace coarse-grained knowledge binning scheme overlay network construction well-known landmark node measurement infrastructure relative position global knowledge exact topological information small number application-level connectivity minimal support topological information network latency ip-level topology internet host

DMCA