End-to-End Loss Probabilities in Different Internet-like Networks with a Given Average Hop Count

Realistic networks generators are necessary for simulation and performance evaluation of data communication systems. Such an aspect has driven the collection and the analysis of data on the Internet large-scale structure. The evidence of a power-law behavior of real networks has stimulated the introduction of new procedures to generate Internet-like topologies. Assuming a simple loss model for the links, this paper analyses how the prediction of the loss probabilities during communications obtained by simulation can be influenced by the adoption of a specific topological model for the Internet graph (here, the Waxman or the Barabasi-Albert model), given a average node distance in terms of hops.