Implications for QoS provisioning based on traceroute measurements

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2511, Issue , 2002, Pages 3-14

  Janic, Milena ^a   Kuipers, Fernando ^a   Zhou, Xiaoming ^a   Van Mieghem, Piet ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

TOPOLOGY; TREES (MATHEMATICS); WEB SERVICES;

INTERNET GRAPHS; LINK WEIGHT STRUCTURE; LINK WEIGHTS; MEASUREMENT DATA; QOS PROVISIONING; SHORTEST PATH; TOPOLOGICAL PROPERTIES; UNIFORM RECURSIVE TREES;

QUALITY OF SERVICE;

EID: 84889874290     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45859-x_1     Document Type: Conference Paper

References (18)

1. Abramovitz, M. and I.A. Stegun,.Handbook on Mathematical Functions. Dover Publications, Inc., N.Y.,1968.
2. Bollobas, B. Random. Graphs., Cambrigde University Press, second edition, 2001.
3. Burch H. and B. Cheswick..Mapping the Internet.. In IEEE Computer, April 1999.
4. Chuang J. and M. Sirbu,.Pricing multicast communication: A cost-based approach,. presented at the INET, 1998.
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.
6. Garey, M.R., and D.S. Johnson,.Computers and Intractability: A guide to the Theory of NPcompleteness., Freeman, San Francisco, 1979.
7. Govindan R. and H. Tangmunarunkit,.Heuristics for Internet Map Discovery., In proceedings of IEEE INFOCOM.00, Tel Aviv, Israel, 2000.
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.
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.
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.
11. Pansiot J. J. and D. Grad..On routes and multicast trees in the internet.. In ACM Computer Communication Review, January 1998.
12. Richard Stevens W.,.TCP/IP Illustrated, volume 1, The Protocols., Addision-Wesley, Reading, Massachusetts, 1994.
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.
15. Van Mieghem P., G. Hooghiemstra and R. W. van der Hofstad, "Scaling Law for the Hopcount", Delft University of Technology, report2000125, 2000.
16. Van Mieghem P., H. De Neve and F.A. Kuipers,.Hop-by-hop quality of service routing., Computer Networks, vol. 37, pp. 407-423, 2001.
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.
18. Wang Z. and J. Crowcroft,.QoS Routing for supporting Multimedia Applications., IEEE J. Select. Areas Commun., 14(7):1188-1234, September 1996.