Venugopalan Ramasubramanian, Dahlia Malkhi, Fabian Kuhn, Mahesh Balakrishnan, and Aditya Akella
Describing a complex and large network such as the Internet in a concise way, that brings out its fundamental properties, is a task that has challenged researchers for many years. Existing work on internet structure – and empirical reasoning -- indicates that it is tree-like. This works 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 path attributes using a tree embedding by actually building tree representations. In addition to being simple and intuitive models, these trees provide a range of commonly required functionality beyond simple attribute modeling.
The benefits of our study are twofold. First, we investigate
the ability to portray the inherent hierarchical structure of
internets using the most pure and compact topology, trees.
Second, trees obviate many natural tasks, such as shortest path
routing and selection of multicast spanners. Our study shows
that these tasks can be done with high degree of success and
|Published in||ACM SIGMETRICS|
|Publisher||Association for Computing Machinery, Inc.|
Copyright © 2007 by the Association for Computing Machinery, Inc. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept, ACM Inc., fax +1 (212) 869-0481, or firstname.lastname@example.org. The definitive version of this paper can be found at ACM’s Digital Library --http://www.acm.org/dl/.