<?xml version="1.0" standalone="no"?>
                    <!DOCTYPE div SYSTEM "/www/backend/www-xml-443/dtd/caidaML.dtd">
                    <!-- do NOT ERASE the DOCTYPE declaration! --><div>


<tr bgcolor="#f4f4f4">
  <td>
<font face="helvetica,arial" size="2">
<b>URL:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">
<a href="http://www.caida.org/publications/papers/2001/OSD/">http://www.caida.org/publications/papers/2001/OSD/</a>
</font>
  </td>
</tr>


<tr bgcolor="#e9e9e9">
  <td>
<font face="helvetica,arial" size="2">
<b>Entry Date:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">
2003-01-30


</font>
  </td>
</tr>


<tr bgcolor="#f4f4f4">
  <td>
<font face="helvetica,arial" size="2">
<b>Abstract:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">
<p>
In this paper we introduce a framework for analyzing
local properties of Internet connectivity. We compare BGP
and probed topology data, finding that currently probed
topology data yields much denser coverage of AS-level connectivity.
We describe data acquisition and construction of
several IP-level graphs derived from a collection of 220M
skitter traceroutes. We find that a graph consisting of IP
nodes and links contains 90.5% of its 629K nodes in the
<i>acyclic subgraph</i>. In particular, 55% of the IP nodes are in
trees. Full bidirectional connectivity is observed for a <i>giant
component</i> containing 8.3%of IP nodes.
</p>
<p>
We analyze the same structures (trees, acyclic part, core,
giant component) for other combinatorial models of Internet
(IP-level) topology, including arc graphs and place-holder
graphs. We also show that Weibull distrbution
<i>N</i>{<i>X</i>&nbsp;&gt;<i>x</i>}&nbsp;=&nbsp;<i>a</i>&nbsp;exp(-(<i>x</i>/<i>b</i>)<i><sup>c</sup></i>
approximates outdegree distribution
with 10-15% relative accuracy in the region of
generic object sizes, spanning two to three orders of magnitude
up to the point where sizes become unique.
</p>
<p>
The extended version of this paper includes dynamic
and functorial properties of Internet topology, including
properties of and diffusion on aggregated graphs,
invariance of a reachability function's shape regardless of
node choice or aggregation level, analysis of topological resilience
under wide range of scenarios. We also demonstrate
that the Weibull distribution provides a good fit to a
variety of local object sizes.
</p>


</font>
  </td>
</tr>


<tr bgcolor="#e9e9e9">
  <td>
<font face="helvetica,arial" size="2">
<b>Datasets:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">
<p>
Skitter data from all available monitors in Spring 2001
</p>


</font>
  </td>
</tr>


<tr bgcolor="#f4f4f4">
  <td>
<font face="helvetica,arial" size="2">
<b>Experiments:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">

<p>
Iffinder probing to identify interfaces on the routers.
Out of 638 K IP addresses probed, an identification
with at least one other IP was found for 76 K nodes, 
which make up about 30 K connected components. 
Most of these components consist of only two nodes.
While many of the components can be interpreted 
as groups of addresses on the same router, some
of them contain long chains of redirections and even loops,
which makes unlikely their interpretation as routers.
</p>



</font>
  </td>
</tr>


<tr bgcolor="#e9e9e9">
  <td>
<font face="helvetica,arial" size="2">
<b>Results:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">



</font>
  </td>
</tr>


<tr bgcolor="#f4f4f4">
  <td>
<font face="helvetica,arial" size="2">
<b>References:</b>
</font>
</td>
  <td>
<font face="helvetica,arial" size="2">

<p>
A.Broder e.a., Graph structure in the Web.
Computer Networks 33, 2000.
</p>



</font>
  </td>
</tr>
</div>

