Implications For Qos Provisioning Based On Traceroute Measurements

Based on RIPE NCC traceroute measurement data, we attempt to model the Internet graph with the graph G(1), 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 G(1) 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.