Abstract

Based on RIPE NCC traceroute measurement data, we attempt to model the Internet graph with the graph G1, which is the union of the most frequently occurring paths in the RIPE traceroute database. After analyzing the topological properties of this graph, a striking agreement with the properties of the uniform recursive tree has been found. This similarity allows us to compute the efficiency of multicast. After assigning polynomially distributed link weights to the edges of the graph G1 and comparing the simulated shortest paths with the traceroutes, no clear conclusions on the link weight structure could be deduced. Finally, possible implications of the measurement data on the provisioning of Quality of Service are suggested.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.