A quantitative comparison of graph-based models for internet topology

IEEE/ACM Transactions on Networking

Volumn 5, Issue 6, 1997, Pages 770-783

  Zegura, Ellen W ^a,b   Calvert, Kenneth L ^a,b   Donahoo, Michael J ^b  

^a IEEE   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Internetworking; Multicast; Network modeling; Scalability

Indexed keywords

COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); GRAPH THEORY;

INTERNETWORKING;

WIDE AREA NETWORKS;

EID: 0031334402     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.650138     Document Type: Review

References (24)

1. J. Behrens and J. J. Garcia-Luna-Aceves, "Distributed, scalable routing based on link-state vectors," in Proc. ACM SIGCOMM'94, 1994, pp. 136-147.
2. J. Bellamy, Digital Telephony. New York: Wiley, 1991.
3. S. Bhattacharjee, K. Calvert, and E. Zegura, "Extending random graph theory to topologies with hierarchy and locality (in preparation)," College of Computing, Georgia Tech., Tech. Rep., 1997.
4. B. Bollobás, Random Graphs. Orlando, FL: Harcourt Brace Jovanovich, 1985.
5. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications. Amsterdam: North-Holland, 1976.
6. L. Brakmo, S. O'Malley, and L. Peterson, "TCP Vegas: New techniques for congestion detection and avoidance," in Proc. ACM SIGCOMM'94, 1994, pp. 24-35.
7. K. Calvert, E. Zegura, and M. Doar, "Modeling Internet topology," IEEE Commun. Mag., June 1997.
8. K. L. Calvert, E. W. Zegura, and M. J. Donahoo, "Core selection methods for multicast routing," K. Makki and N. Pissiou, Eds., Proc. ICCCN'95, IEEE Computer Society Press, Sept. 1995, pp. 638-642.
9. D. Clark, "Policy routing in Internet protocols," Internet Request for Comments 1102, May 1989.
10. S. E. Deering and D. R. Cheriton, "Multicast routing in datagram internetworks and extended LANs," ACM Trans. Comput. Syst., vol. 8, no. 2, pp. 85-110, May 1990.
11. M. Doar and I. Leslie, "How bad is naive multicast routing?," in Proc. IEEE INFOCOM'93, 1993, pp. 82-89.
12. J. E. Hill and A. Kerber, Models, Methods, and Analytical Procedures in Education Research. Detroit, MI: Wayne State Univ., 1967.
13. D. Mitzel and S. Shenker, "Asymptotic resource consumption in multicast reservation styles," in Proc. ACM SIGCOMM'94, 1994, pp. 226-233.
14. D. C. Montgomery, Design and Analysis of Experiments, 3rd ed. New York: Wiley, 1991.
15. B. Ostle and R. W. Mensing, Statistics in Research, 3rd ed. Ames, IA: Iowa State Univ., 1975.
16. C. Partridge, D. Waitzman, and S. Deering, "Distance vector multicast routing protocol," Internet Request for Comments 1075, Nov. 1988.
17. V. Paxson, "Empiricially derived analytic models of wide-area TCP connections," IEEE/ACM Trans. Networking, vol. 2, no. 4, pp. 316-336, Aug. 1994.
18. S. Sibal and A. DeSimone, "Controlling alternate routing in general-mesh packet flow networks," in Proc. ACM SIGCOMM'94, 1994, pp. 136-147.
19. D. Sidhu, T. Fu, S. Abdallah, R. Nair, and R. Roltun, "Open shortest path first (OSPF) routing protocol simulation," in Proc. ACM SIGCOMM'93, 1993, pp. 53-62.
20. D. C. Verma and P. M. Gopal, "Routing reserved bandwidth multi-point connections," in Proc. ACM SIGCOMM'93, 1993.
21. B. M. Waxman, "Routing of multipoint connections," IEEE J. Select. Areas Commun., vol. 6, no. 9, pp. 1617-1622, 1988.
22. L. Wei and D. Estrin, "The trade-offs of mutlicast trees and algorithms," in Int. Conf. Computer Communications and Networks, Aug. 1994.
23. C. Williamson, "Optimizing file transfer response time using the loss-load curve congestion control mechanism," in Proc. ACM SIGCOMM'93, 1993, pp. 117-126.
24. W. T. Zaumen and J. J. Garcia-Luna Aceves, "Dynamics of distributed shortest-path routing algorithms," in Proc. ACM SIGCOMM'91, 1991.