Aarhus Universitets segl

Self-organizing weights for Internet AS-graphs and surprisingly simple routing metrics

Publikation: Working paper/Preprint Working paperForskning


The transport capacity of Internet-like communication networks and hence their efficiency may be improved by a factor of 5-10 through the use of highly optimized routing metrics, as demonstrated previously. Numerical determination of such routing metrics can be computationally demanding to an extent, that prohibits both investigation of and application to very large networks. In an attempt to find a numerically less expensive way of constructing a metric with a comparable performance increase, we propose a local, self-organizing iteration scheme and find two surprisingly simple and efficient metrics. The new metrics have negligible computational cost and result in an approximately 5-fold performance increase, providing distinguished competitiveness with the computationally costly counterparts. They are applicable to very large networks and easy to implement in today's Internet routing protocol on the AS-level.
UdgiverThiele Centre, Institut for Matematiske Fag, Aarhus Universitet
Antal sider13
StatusUdgivet - 7 mar. 2011

Se relationer på Aarhus Universitet Citationsformater


Ingen data tilgængelig

ID: 44177651