Abstract
It is generally recognized that the current routing scheme of Internet
suffers from serious scalability problems. In this paper, we work with the
abstract but 'Internet-like' network model consisting of an
infinite-variance power-law random graph (IVPLRG) and adopt the idea of a
routing scheme proposed by Carmi, Cohen and Dolev (C-C-D). The scheme fits
very naturally to the spontaneously emerging 'soft hierarchy' architecture
on an IVPLRG. The use of multiple addresses is studied as a solution to the
inflexibility of the pure C-C-D scheme. A new mean-field methodology is
introduced for the efficient computation of relevant quantitative
characteristics. (10 refs.)
| Original language | English |
|---|---|
| Title of host publication | Proceedings |
| Subtitle of host publication | Next Generation Internet Networks, NGI 2009 |
| Place of Publication | Piscataway, NJ, USA |
| Publisher | IEEE Institute of Electrical and Electronic Engineers |
| Number of pages | 8 |
| ISBN (Print) | 978-1-4244-4244-7, 978-1-4244-4245-4 |
| DOIs | |
| Publication status | Published - 2009 |
| MoE publication type | A4 Article in a conference publication |
| Event | Next Generation Internet Networks, NGI 2009 - Aveiro, Portugal Duration: 1 Jul 2009 → 3 Jul 2009 |
Conference
| Conference | Next Generation Internet Networks, NGI 2009 |
|---|---|
| Abbreviated title | NGI 2009 |
| Country/Territory | Portugal |
| City | Aveiro |
| Period | 1/07/09 → 3/07/09 |
Keywords
- Internet
- graph theory
- network theory (graphs)
- random processes
- telecommunication network routing
- telecommunication network topology