Skip to main content
SpringerLink
Log in

Implications for QoS Provisioning Based on Traceroute Measurements

  • Conference paper
  • First Online:
From QoS Provisioning to QoS Charging (QofIS 2002, ICQT 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2511))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abramovitz, M. and I.A. Stegun, “Handbook on Mathematical Functions” Dover Publications, Inc., N.Y., 1968.

    Google Scholar 

  2. Bollobas, B., “Random Graphs”, Cambrigde University Press, second edition, 2001.

    Google Scholar 

  3. Burch H. and B. Cheswick. “Mapping the Internet”. In IEEE Computer, April 1999.

    Google Scholar 

  4. Chuang J. and M. Sirbu, “Pricing multicast communication: A cost-based approach,” presented at the INET, 1998.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. Garey, M.R., and D.S. Johnson, “Computers and Intractability: A guide to the Theory of NP-completeness”, Freeman, San Francisco, 1979.

    MATH  Google Scholar 

  7. Govindan R. and H. Tangmunarunkit, “Heuristics for Internet Map Discovery”, In proceedings of IEEE INFOCOM’00, Tel Aviv, Israel, 2000.

    Google Scholar 

  8. 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.

    Article  Google Scholar 

  9. 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.

    Google Scholar 

  10. Labovitz C, A. Ahuja, A. Bose and F. Jahanian, “Delayed Internet Routing Convergence”, IEEE/ACM Transactions on Networking, vol. 9, no. 3, June 2001.

    Google Scholar 

  11. Pansiot J. J. and D. Grad. “On routes and multicast trees in the internet”. In ACM Computer Communication Review, January 1998.

    Google Scholar 

  12. Richard Stevens W., “TCP/IP Illustrated, volume 1, The Protocols”, Addision-Wesley, Reading, Massachusetts, 1994.

    Google Scholar 

  13. RIPE Test Traffic Measurements, http://www.ripe.net/ripencc/mem-services/ttm/

  14. Smythe, R. T. and H. M. Mahmoud, “A Survey of Recursive Trees”, Theor. Probability and Math Statist, No. 51, pp. 1–27, 1995.

    Google Scholar 

  15. Van Mieghem P., G. Hooghiemstra and R. W. van der Hofstad, “Scaling Law for the Hopcount”, Delft University of Technology, report2000125, 2000.

    Google Scholar 

  16. VanMieghem P., H. De Neve and F.A. Kuipers, “Hop-by-hop quality of service routing”, Computer Networks, vol. 37, pp. 407–423, 2001.

    Article  Google Scholar 

  17. 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.

    Google Scholar 

  18. Wang Z. and J. Crowcroft, “QoS Routing for supporting Multimedia Applications”, IEEE J. Select. Areas Commun., 14(7):1188–1234, September 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Technology and Systems, Delft University of Technology, P.O. Box 5031, 2600 GA, Delft, The Netherlands

    Milena Janic, Fernando Kuipers, Xiaoming Zhou & Piet Van Mieghem

Authors
  1. Milena Janic
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fernando Kuipers
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaoming Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Piet Van Mieghem
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Systems Laboratory, IIS, University of Federal Armed Forces Munich, UniBwM, Werner-Heisenberg-Weg 39, 85577, Neubiberg, Germany

    Burkhard Stiller

  2. Computer Engineering and Networks Laboratory, TIK, Swiss Federal Institute of Technology Zurich, ETH Zurich, Gloriastr. 35, 8092, Zurich, Switzerland

    Burkhard Stiller

  3. Fraunhofer Institute FOKUS, Kaiserin-Augusta-Allee 31, 19589, Berlin, Germany

    Michael Smirnow

  4. Multimedia Communications Lab, KOM, Darmstadt University of Technology, Merckstr. 25, 64283, Darmstadt, Germany

    Martin Karsten

  5. Forschungszentrum Wien, FTW, Donau-City-Str. 1, 1220, Wien, Austria

    Peter Reichl

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation