Describing and simulating internet routes

DOI10.1016/J.COMNET.2006.10.008zbMATH Open1111.68321arXivcs/0411051OpenAlexW2030758576MaRDI QIDQ878729FDOQ878729

Authors: Jérémie Leguay, Matthieu Latapy, Timur Friedman, Kavé Salamatian 

Publication date: 26 April 2007

Published in: Computer Networks (Search for Journal in Brave)

Abstract: This paper introduces relevant statistics for the description of routes in the internet, seen as a graph at the interface level. Based on the observed properties, we propose and evaluate methods for generating artificial routes suitable for simulation purposes. The work in this paper is based upon a study of over seven million route traces produced by CAIDA's skitter infrastructure.

Full work available at URL: https://arxiv.org/abs/cs/0411051

Recommendations

• Internet packet routing: application of a \(K\)-quickest path algorithm
• Efficient large-scale BGP simulations
• scientific article; zbMATH DE number 2088545
• Detection, understanding, and prevention of traceroute measurement artifacts
• About some self-similar telecommunication traffic models used in traffic simulation

zbMATH Keywords

measurementgraphsmodelingcomplex networksroutinginternetroutes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

This page was built for publication: Describing and simulating internet routes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878729)