Scaling Properties of the Internet Graph

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 337-346

  Akella, Aditya ^a   Chawla, Shuchi ^a   Kannan, Arvind ^a   Seshan, Srinivasan ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Congestion; Policy routing; Power law distribution; Shortest path routing

Indexed keywords

COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); GRAPH THEORY; ROUTERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS;

INTERNET GRAPHS; POLICY ROUTING; POWER-LAW DISTRIBUTION; SHORTEST PATH ROUTING;

INTERNET;

EID: 1142293093     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872087     Document Type: Conference Paper

References (20)

1. BGP Tables from the University of Oregon RouteViews Project. http://moat.nlanr.net/AS/data.
2. National laboratory for applied network research. Routing data. http://moat.nlanr.net/Routing/rawdata/.
3. AIELLO, W., CHUNG, F., AND LU, L. Random evolution in massive graphs. In FOCS (2001), pp. 510-519.
4. AKELLA, A., CHAWLA, S., KANNAN, A., AND SESHAN, S. Scaling properties of the Internet graph. Technical Report CMU-CS-03-131, CMU, Pittsburgh, Pennsylvania, May 2003.
5. ALBERT, R., AND BARABASI, A.-L. Topology of evolving networks: local events and universality. Physical Review Letters 85(24) (2000), 5234-5237.
6. AUMANN, Y., AND RABANI, Y. An o(log k) approximate min-cut max-flow theorem and approximation algorithm. SIAM Journal on Computing 27(1) (1998), 291-301.
7. BARABASI, A.-L., AND ALBERT, R. Emergence of scaling in random networks. Science 286 (1999), 509-512.
8. FABRIKANT, A., KOUTSOUPIAS, E., AND PAPADIMITRIOU, C. Heuristically optimized trade-offs: A new paradigm for power laws in the Internet. In ICALP (2002), pp. 110-122.
9. FALOUTSOS, M., FALOUTSOS, P., AND FALOUTSOS, C. On power-law relationships of the Internet topology. In Proceedings of the SIGCOMM '99 Symposium on Communications Architectures and Protocols (1999), pp. 251-262.
10. GAO, L. On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on Networking 9(6) (December 2001).
11. GKANTSIDIS, C., SABERI, A., AND MIHAIL, M. Conductance and congestion in power law graphs. In Proceedings of the ACM Sigmetrics 2003 (2003).
12. LEIGHTON, F. T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.
13. LEONARDI, S. On-line network routing. In Online Algorithms - The State of the Art (1998), Springer, pp. 242-267.
14. MEDINA, A., LAKHINA, A., MATTA, I., AND BYERS, J. Brite: An approach to universal topology generation. In MASCOTS (2001).
15. MITCHELL, T. M. Machine Learning. McGraw-Hill Companies, Inc., 1997.
16. OKAMURA, H., AND SEYMOUR, P. Multicommodity flows in planar graphs. Journal of Combinatorial Theory B 31 (1981), 75-81.
17. PARK, K., AND LEE, H. On the effectiveness of route-based packet filtering for distributed DoS attack prevention in power-law Internets. In Proceedings of the SIGCOMM '01 Symposium on Communications Architectures and Protocols (San Diego, California, August 2001).
18. SUBRAMANIAN, L., AGARWAL, S., REXFORD, J., AND KATZ, R. H. Characterizing the Internet hierarchy from multiple vantage points. In Proceedings of IEEE INFOCOM (June 2002).
19. TANGMUNARUNKIT, H., GOVINDAN, R., JAMIN, S., SHENKER, S., AND WILLINGER, W. Network topology generators: Degree-based vs structural. In Proceedings of the SIGCOMM '02 Symposium on Communications Architectures and Protocols (Pittsburgh, Pennsylvania, August 2002).
20. WINICK, J., AND JAMIN, S. Inet-3.0: Internet topology generator. Tech. rep., University of Michigan, 2002. Technical Report, CSE-TR-456-02.