Measuring the effectiveness of hierarchical address assignment

Yinfang Zhuang, Kenneth L. Calvert

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations


Hierarchical, topology-based addressing has long been considered crucial to routing and forwarding scalability. Recently, however, a number of research efforts are considering alternatives to this traditional approach. With the goal of informing such research, we investigated the efficiency of address assignment in the existing (IPv4) Internet-that is, the assignment of prefixes to ASes. In particular, we ask the question: "Exactly how much does addressing hierarchy help us at the interdomain level?" To do so, we first define a notion of efficiency or locality based on the total number of bit-hops required to advertise all prefixes in the Internet in BGP, and compute this quantity for the current Internet using RouteViews data. In order to quantify how far from "optimal" the current Internet is, we assign prefixes to ASes "from scratch" in a manner that preserves observed semantics, using three increasingly strict definitions of equivalence. These results provide an indication of the efficiency of addressing at the interdomain level in the current Internet.

Original languageEnglish
Title of host publication2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
StatePublished - 2010
Event53rd IEEE Global Communications Conference, GLOBECOM 2010 - Miami, FL, United States
Duration: Dec 6 2010Dec 10 2010

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference


Conference53rd IEEE Global Communications Conference, GLOBECOM 2010
Country/TerritoryUnited States
CityMiami, FL

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Measuring the effectiveness of hierarchical address assignment'. Together they form a unique fingerprint.

Cite this