Does over-provisioning become more or less efficient as networks grow larger?

Proceedings - International Conference on Network Protocols, ICNP

Volumn 2005, Issue , 2005, Pages 225-235

  Huang, Yaqing ^a   Guérin, Roch ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INTERNET; MATHEMATICAL MODELS; NETWORK PROTOCOLS; ROBUSTNESS (CONTROL SYSTEMS); TELECOMMUNICATION TRAFFIC; TOPOLOGY;

IP NETWORKS; TRAFFIC VARIATIONS; TRANSIENT SURGES;

TELECOMMUNICATION NETWORKS;

EID: 33750952497     PISSN: 10921648     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICNP.2005.12     Document Type: Conference Paper

References (18)

1. Abilene Network. Abilene weather map - real time traffic. http://abilene.internet2.edu/.
2. A. Akella, S. Chawla, A. Kannan, and S. Seshan. Scaling properties of the Internet graph. In Proc. ACM PODC, Boston, MA, July 2003.
3. A. Akella, S. Chawla, A. Kannan, and S. Seshan. On the scaling of congestion in the Internet graph. ACM SIGCOMM Computer Communication Review, Special Issue on Science of Network Design, 34(3):43-56, July 2004.
4. A.-L. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, October 1999.
5. S. Bhattacharyya, C. Diot, J. Jetcheva, and N. Taft. POP-level and access-link-level traffic dynamics in a Tier-1 POP. In Proc. ACM Internet Measurement Workshop (IMW), San Francisco, CA, November 2001.
6. B.Bollobas. Random Graphs. Cambridge University Press, 2001.
7. J. Case, M. Fedor, M. Schoffstall, and J. Davin. Simple Network Management Protocol (SNMP). RFC1157, May 1990.
8. F. Chung and L. Lu. The average distance in a random graph with given expected degrees. Proc. National. Academy of Sciences of the United States of America, 99(25): 15879-15882, December 2002.
9. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In Proc. ACM SIGCOMM, pages 251-262, Boston, MA, August 1999.
10. A. Feldmann, A. Greenberg, C. Lund, N. Reingold, J. Rexford, and F. True. Deriving traffic demands for operational IP networks: Methodology and experience. IEEE/ACM Trans. Netw., 9(3):265-279, June 2001.
11. C. Gkantsidis, M. Mihail, and A. Saberi. Conductance and congestion in power law graphs. In Proc. ACM SIGMET-RICS, pages 148-159, San Diego, CA, June 2003.
12. Y. Huang. Understanding how to provide service guarantees in IP-based networks. PhD thesis, Dept. of Electrical and Systems Engineering, University of Pennsylvania, May 2005.
13. L. Li, D. Alderson, W. Willinger, J. Doyle, R. Tanaka, and S. Low. A first-principles approach to understanding the Internet's router-level topology. In Proc. ACM SIGCOMM, Portland, OR, September 2004.
14. A. M. Odlyzko. Internet traffic growth: Source and implications. In Proc. SPIE, volume 5247, pages 1-15, August 2003.
15. K. Papagiannaki, R. Cruz, and C. Diot. Network performance monitoring at small time scales. In Proc. ACM Internet Measurement Conference (IMC), Miami, FL, October 2003.
16. Y. Zhang, M. Roughan, N. Duffield, and A. Greenberg. Fast accurate computation of large-scale traffic matrices from link loads. In Proc. ACM SIGMETRICS, San Diego, CA, June 2003.
17. Y. Zhang, M. Roughan, C. Lund, and D. Donoho. An information-theoretic approach to traffic matrix estimation. In Proc. ACM SIGCOMM, Karlsruhe, Germany, August 2003.
18. R. Zhang-Shen and N. McKeown. Designing a predictable Internet backbone network. In Proc. HotNet-III, San Diego, CA, November 2004.