Institut for Matematik

Aarhus Universitets segl
Du er her: Institut for Matematik » Forskning » Publikationer » Self-organizing weights for Internet AS-graphs and surpri...

Forskning

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

Publikation: Working paper/Preprint › Working paper › Forskning

Standard

Self-organizing weights for Internet AS-graphs and surprisingly simple routing metrics. / Scholz, Jan Carsten; Greiner, Martin.

Thiele Centre, Institut for Matematiske Fag, Aarhus Universitet, 2011.

Publikation: Working paper/Preprint › Working paper › Forskning

Harvard

Scholz, JC & Greiner, M 2011 'Self-organizing weights for Internet AS-graphs and surprisingly simple routing metrics' Thiele Centre, Institut for Matematiske Fag, Aarhus Universitet.

APA

Scholz, J. C., & Greiner, M. (2011). Self-organizing weights for Internet AS-graphs and surprisingly simple routing metrics. Thiele Centre, Institut for Matematiske Fag, Aarhus Universitet.

CBE

Scholz JC, Greiner M. 2011. Self-organizing weights for Internet AS-graphs and surprisingly simple routing metrics. Thiele Centre, Institut for Matematiske Fag, Aarhus Universitet.

MLA

Scholz, Jan Carsten og Martin Greiner Self-organizing weights for Internet AS-graphs and surprisingly simple routing metrics. Thiele Centre, Institut for Matematiske Fag, Aarhus Universitet. 2011., 13 s.

Vancouver

Scholz JC, Greiner M. Self-organizing weights for Internet AS-graphs and surprisingly simple routing metrics. Thiele Centre, Institut for Matematiske Fag, Aarhus Universitet. 2011 mar. 7.

Author

Scholz, Jan Carsten ; Greiner, Martin. / Self-organizing weights for Internet AS-graphs and surprisingly simple routing metrics. Thiele Centre, Institut for Matematiske Fag, Aarhus Universitet, 2011.

Bibtex

@techreport{55b08d4909d1410791b52e3b3b3f241c,
title = "Self-organizing weights for Internet AS-graphs and surprisingly simple routing metrics",
abstract = "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.",
author = "Scholz, {Jan Carsten} and Martin Greiner",
note = "Published in Europhysics Letters. 2011;94(2):28008: p1-p6.",
year = "2011",
month = mar,
day = "7",
language = "English",
publisher = "Thiele Centre, Institut for Matematiske Fag, Aarhus Universitet",
type = "WorkingPaper",
institution = "Thiele Centre, Institut for Matematiske Fag, Aarhus Universitet",

}

RIS

TY - UNPB

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

AU - Scholz, Jan Carsten

AU - Greiner, Martin

N1 - Published in Europhysics Letters. 2011;94(2):28008: p1-p6.

PY - 2011/3/7

Y1 - 2011/3/7

N2 - 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.

AB - 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.

M3 - Working paper

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

PB - Thiele Centre, Institut for Matematiske Fag, Aarhus Universitet

ER -