Geo-aggregation permits low stretch and routing tables of logarithmical size

Simple item page
dc.creatorGrishchenko, Victor S.
dc.date2005-10-11
dc.date.accessioned2026-07-07T06:46:14Z
dc.date.available2026-07-07T06:46:14Z
dc.descriptionThis article first addresses applicability of Euclidean models to the domain of Internet routing. Those models are found (limitedly) applicable. Then a simplistic model of routing is constructed for Euclidean plane densely covered with points-routers. The model guarantees low stretch and logarithmical size of routing tables at any node. The paper concludes with a discussion on applicability of the model to real-world Internet routing.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/cs/0510028
dc.identifierhttp://arxiv.org/abs/cs/0510028
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/103272
dc.subjectNetworking and Internet Architecture
dc.subjectC.2.5
dc.titleGeo-aggregation permits low stretch and routing tables of logarithmical size
dc.typetext

Files

Collections

arXiv