On the scaling of congestion in the internet graph

Computer Communication Review

Volumn 34, Issue 3, 2004, Pages 43-55

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

^a Carnegie Mellon University   (United States)

Author keywords

Congestion; Power law graphs; Shortest path routing

Indexed keywords

CONGESTION; POWER-LAW GRAPHS; SHORTEST PATH ROUTING;

COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COMPUTER SIMULATION; GRAPH THEORY; INTERNET; PROBLEM SOLVING;

CONGESTION CONTROL (COMMUNICATION);

EID: 33645753303     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/1031134.1031141     Document Type: Article

References (23)

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. Emergnece 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. FENNER, T., FLAXMAN, A., AND FRIEZE, A. High Degree Vertices and Eigenvalues in the Preferential Attachment Graph. In RANDOM 03 (2003), pp. 264-274.
11. GAO, L. On Inferring Autonomous System Relationships in the Internet. IEEE/ACM Transactions on Networking 9(6) (December 2001).
12. GKANTSIDIS, C., SABERI, A., AND MIHAIL, M. Conductance and Congestion in Power-law Graphs. In Proceedings of the ACM Sigmetrics 2003 (2003).
13. LEIGHTON, F. T. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.
14. LEONARDI, S. On-line Network Routing. In Online Algorithms - The State of the Art (1998), Springer, pp. 242-267.
15. Li, L., ALDERSON, D., WILLINGER, W., AND DOYLE, J. A First-Principles Approach to Understanding the Internet's Router-Level Topology. In Proceedings of the SIGCOMM '04 Symposium on Communications Architectures and Protocols (2004).
16. MEDINA, A., LAKHINA, A., MATTA, I., AND BYERS, J. BRITE: An Approach to Universal Topology Generation. In MASCOTS (2001).
17. MIHAIL, M., PAPADIMITRIOU, C., AND SABERI, A. On Certain Connectivity Properties of the Internet Topology. In FOGS 2003 (2003), pp. 28-35.
18. MITCHELL, T. M. Machine Learning. McGraw-Hill Companies, Inc., 1997.
19. OKAMURA, H., AND SEYMOUR, P. Multicommodity Flows in Planar Graphs. Journal of Combinatorial Theory B 31 (1981), 75-81.
20. 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).
21. 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).
22. 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).
23. WINICK, J., AND JAMIN, S. Inet-3.0: Internet Topology Generator. Tech. rep., University of Michigan, 2002. Technical Report, CSE-TR-456-02.