Ramasubramanian:2009:TIL:1555349.1555357
Summary
Ramasubramanian, V., Malkhi, D., Kuhn, F., Balakrishnan, M., Gupta, A. and Akella, A. (2009) On the treeness of internet latency and bandwidth. In Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems. New York, NY, USA. ACM, pages 61-72. ((URL))
Abstract
Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Internet measures--latency and bandwidth--approximate tree metrics. We evaluate our ability to model end-to-end measures using tree embeddings by actually building tree representations. In addition to being simple and intuitive models, these trees provide a range of commonly-required functionality beyond serving as an analytical tool. The contributions of our study are twofold. First, we investigate the ability to portray the inherent hierarchical structure of the Internet using the most pure and compact topology, trees. Second, we evaluate the ability of our compact representation to facilitate many natural tasks, such as the selection of servers with short latency or high bandwidth from a client. Experiments show that these tasks can be done with high degree of success and modest overhead.
Bibtex entry
@INPROCEEDINGS { Ramasubramanian:2009:TIL:1555349.1555357,
AUTHOR = { Ramasubramanian, V. and Malkhi, D. and Kuhn, F. and Balakrishnan, M. and Gupta, A. and Akella, A. },
TITLE = { On the treeness of internet latency and bandwidth },
BOOKTITLE = { Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems },
SERIES = { SIGMETRICS '09 },
YEAR = { 2009 },
ISBN = { 978-1-60558-511-6 },
LOCATION = { Seattle, WA, USA },
PAGES = { 61--72 },
NUMPAGES = { 12 },
URL = { http://doi.acm.org/10.1145/1555349.1555357 },
DOI = { http://doi.acm.org/10.1145/1555349.1555357 },
ACMID = { 1555357 },
PUBLISHER = { ACM },
ADDRESS = { New York, NY, USA },
KEYWORDS = { bandwidth, internet topology, latency, sequoia, tree embedding },
ABSTRACT = { Existing empirical studies of Internet structure and path properties indicate that the Internet is tree-like. This work quantifies the degree to which at least two important Internet measures--latency and bandwidth--approximate tree metrics. We evaluate our ability to model end-to-end measures using tree embeddings by actually building tree representations. In addition to being simple and intuitive models, these trees provide a range of commonly-required functionality beyond serving as an analytical tool. The contributions of our study are twofold. First, we investigate the ability to portray the inherent hierarchical structure of the Internet using the most pure and compact topology, trees. Second, we evaluate the ability of our compact representation to facilitate many natural tasks, such as the selection of servers with short latency or high bandwidth from a client. Experiments show that these tasks can be done with high degree of success and modest overhead. },
}