Share Email Print

Proceedings Paper

Hierarchical structure of the logical Internet graph
Author(s): Zihui Ge; Daniel R. Figueiredo; Sharad Jaiswal; Lixin Gao
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

The study of the Internet topology has recently received much attention from the research community. In particular, the observation that the network graph has interesting properties, such as power laws, that might be explored in a myriad of ways. Most of the work in characterizing the Internet graph is based on the physical network graph, i.e., the connectivity graph. In this paper we investigate how logical relationships between nodes of the AS graph can be used to gain insight to its structure. We characterize the logical graph using various metrics and identify the presence of power laws in the number of customers that a provider has. Using these logical relationships we define a structural model of the AS graph. The model highlights the hierarchical nature of logical relationships and the preferential connection to larger providers. We also investigate the consistency of this model over time and observe interesting properties of the hierarchical structure.

Paper Details

Date Published: 25 July 2001
PDF: 15 pages
Proc. SPIE 4526, Scalability and Traffic Control in IP Networks, (25 July 2001); doi: 10.1117/12.434397
Show Author Affiliations
Zihui Ge, Univ. of Massachusetts/Amherst (United States)
Daniel R. Figueiredo, Univ. of Massachusetts/Amherst (United States)
Sharad Jaiswal, Univ. of Massachusetts/Amherst (United States)
Lixin Gao, Univ. of Massachusetts/Amherst (United States)

Published in SPIE Proceedings Vol. 4526:
Scalability and Traffic Control in IP Networks
Sonia Fahmy; Kihong Park, Editor(s)

© SPIE. Terms of Use
Back to Top