2004/04/30 by P. M. Echenique, Pablo Echenique, Jesús Gómez‐Gardeñes +2 · 4 citations
Computer Science · Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #Computer network #Computer science #Cooperative Communication and Network Coding #Distributed computing #Equal-cost multi-path routing #IP forwarding #Internet traffic #Internet traffic engineering #Mathematics #Network Traffic and Congestion Control #Network packet #Network traffic control #Policy-based routing #Routing (electronic design automation) #Routing protocol #Scheme (mathematics) #Simple (philosophy) #Static routing #The Internet #World Wide Web #cond-mat.other #cond-mat.stat-mech
paper · pdf · doi:10.1103/physreve.70.056105
published as Phys. Rev. E 70, 056105 (2004) · Final version
openalex publication_date 2004/11/15 · arxiv created 2004/11/23 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We analyze different strategies aimed at optimizing routing policies in the Internet. We first show that for a simple deterministic algorithm the local properties of the network deeply influence the time needed for packet delivery between two arbitrarily chosen nodes. We next rely on a real Internet map at the autonomous system level and introduce a score function that allows us to examine different routing protocols and their efficiency in traffic handling and packet delivery. Our results suggest that actual mechanisms are not the most efficient and that they can be integrated in a more general, though not too complex, scheme.