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.
Abstract. Increased Internet speeds together with new possibilities for tailor-made television services have spurred the interest in providing television via the Internet. Several television services are readily available and both IP-layer and application-layer (P2P) technologies are used. When disregarding commercial influences, customers will choose for IPTV or P2PTV based on the Quality of Experience (QoE). In this paper, we investigate one important QoE measure, namely the content blocking probability.
SUMMARYIn the last several years we witnessed the proliferation of multimedia applications on the Internet. One of the unavoidable techniques to support this type of communication is multicasting. However, even a decade after its initial proposal, multicast is still not widely deployed. One of the reasons is the lack of a solid business model. If the gain and the cost of multicast could be predicted, network operators might be encouraged to deploy multicast on a larger scale. In this paper we propose analytical expressions that could be used to estimate the gain of network-layer multicast. We show that the theoretical model matches extensive simulation and Internet measurement results remarkably well.Furthermore, we examine the reliability of traceroute data and of traceroutes-based conclusions. We investigate the node degree distributions in the Internet maps obtained from CAIDA and RIPE and we show the divergency of our results with those obtained by other researchers. We further focus on the analysis of multicast trees based on traceroute data. Only few results have been available on the node degree distribution of multicast routing trees which provided contradictory conclusions. Our results seem to indicate that the node degrees follow power laws only for a large number of multicast users.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.