2005/10/11 by Victor Grishchenko, Victor S. Grishchenko, Grishchenko, Victor S.
Computer Science · #C.2.5 #Data Management and Algorithms #FOS: Computer and information sciences #Graph Theory and Algorithms #Network Traffic and Congestion Control #Networking and Internet Architecture (cs.NI) #cs.NI
paper · pdf · doi:10.48550/arxiv.cs/0510028
6 pages
arxiv created 2005/10/11 · openalex publication_date 2005/10/11 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
This 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.