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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abramovitz, M. and I.A. Stegun, “Handbook on Mathematical Functions” Dover Publications, Inc., N.Y., 1968.
Bollobas, B., “Random Graphs”, Cambrigde University Press, second edition, 2001.
Burch H. and B. Cheswick. “Mapping the Internet”. In IEEE Computer, April 1999.
Chuang J. and M. Sirbu, “Pricing multicast communication: A cost-based approach,” presented at the INET, 1998.
Faloutsos, M. and P. Faloutsos and C. Faloutsos, “On power-law relationships of the Internet Topology”, Proceedings of ACM SIGCOMM’99, Cambridge, Massachusetts, pp. 251–262, 1999.
Garey, M.R., and D.S. Johnson, “Computers and Intractability: A guide to the Theory of NP-completeness”, Freeman, San Francisco, 1979.
Govindan R. and H. Tangmunarunkit, “Heuristics for Internet Map Discovery”, In proceedings of IEEE INFOCOM’00, Tel Aviv, Israel, 2000.
Griffin T. G., F. B. Shepherd and G. Wilfong, ”The stable paths problem and Inter domain Routing”, IEEE/ACM Transactions on Networking, vol. 10, No. 2, pp. 232–243, April 2002.
Kuipers F.A. and P. Van Mieghem, “QoS routing: Average Complexity and Hopcount in m Dimensions”, Proc. Of 2nd COST 263 International Workshop, QofIS 2001, Coimbra, Portugal, pp. 110–126, September 24-26, 2001.
Labovitz C, A. Ahuja, A. Bose and F. Jahanian, “Delayed Internet Routing Convergence”, IEEE/ACM Transactions on Networking, vol. 9, no. 3, June 2001.
Pansiot J. J. and D. Grad. “On routes and multicast trees in the internet”. In ACM Computer Communication Review, January 1998.
Richard Stevens W., “TCP/IP Illustrated, volume 1, The Protocols”, Addision-Wesley, Reading, Massachusetts, 1994.
RIPE Test Traffic Measurements, http://www.ripe.net/ripencc/mem-services/ttm/
Smythe, R. T. and H. M. Mahmoud, “A Survey of Recursive Trees”, Theor. Probability and Math Statist, No. 51, pp. 1–27, 1995.
Van Mieghem P., G. Hooghiemstra and R. W. van der Hofstad, “Scaling Law for the Hopcount”, Delft University of Technology, report2000125, 2000.
VanMieghem P., H. De Neve and F.A. Kuipers, “Hop-by-hop quality of service routing”, Computer Networks, vol. 37, pp. 407–423, 2001.
Van Mieghem, P., G. Hooghiemstra and R. W. van der Hofstad, “On the Efficiency of Multicast”, IEEE/ACM Transactions On Networking, vol. 9, pp., 2001.
Wang Z. and J. Crowcroft, “QoS Routing for supporting Multimedia Applications”, IEEE J. Select. Areas Commun., 14(7):1188–1234, September 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Janic, M., Kuipers, F., Zhou, X., Van Mieghem, P. (2002). Implications for QoS Provisioning Based on Traceroute Measurements. In: Stiller, B., Smirnow, M., Karsten, M., Reichl, P. (eds) From QoS Provisioning to QoS Charging. QofIS ICQT 2002 2002. Lecture Notes in Computer Science, vol 2511. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45859-X_1
Download citation
DOI: https://doi.org/10.1007/3-540-45859-X_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44356-8
Online ISBN: 978-3-540-45859-3
eBook Packages: Springer Book Archive