Hard Limits on the Growth of the Internet and Computing Capacity

The last few years have seen an explosion in the deployment and use of the Internet, networking and telecommunication technologies. This was followed by significant increases in the speed and capacity of computing, for example Petaflop supercomputers are becoming common. We will examine some of the developments; explain their importance and potential impact. Many forecasts and predictions have been made about the impact of the increases of computing capacity and the growth of the Internet and the world wide web. In this talk we will introduce some of the favorite predictions and will analyze the possibilities for their realization in the long run. The analysis shows that there exist hard limits on the growth of the Internet and the increase in computing capacity. They prove that it is unlikely that some of the predictions will hold in the long run. The restrictions are based on basic physical and economic limitations, which generate tight bounds on the realization of such predictions. The bounds will occur much faster than expected by the simple forecasters.

[1]  Augusto Casaca,et al.  The use of wireless networks for the surveillance and control of cooperative vehicles in an airport , 2007, Telecommun. Syst..

[2]  R. Bellman Dynamic programming. , 1957, Science.

[3]  Jacobus P. H. Wessels,et al.  The art and theory of dynamic programming , 1977 .

[4]  Tomoya Enokido,et al.  A data transmission protocol for reliable and energy-efficient data transmission in a wireless sensor-actuator network , 2008, Telecommun. Syst..

[5]  M. Planck Ueber das Gesetz der Energieverteilung im Normalspectrum , 1901 .

[6]  Matjaz Gams A Uniform Internet-Communicative Agent , 2001, Electron. Commer. Res..

[7]  Luis Orozco-Barbosa,et al.  A synchronous engine for wireless sensor networks , 2007, WSAN.

[8]  R. Bellman COMBINATORIAL PROCESSES AND DYNAMIC PROGRAMMING , 1958 .

[9]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[10]  Richard Bellman,et al.  Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.

[11]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[12]  Enrico Magli,et al.  Energy-Efficient Coding and Error Control for Wireless Video-Surveillance Networks , 2004, Telecommun. Syst..

[13]  Don G. Grice The roadrunner project and the importance of energy efficiency on the road to exascale computing , 2009, ICS '09.

[14]  G.E. Moore,et al.  Cramming More Components Onto Integrated Circuits , 1998, Proceedings of the IEEE.

[15]  Susan M. Sanchez,et al.  Better than a petaflop: The power of efficient experimental design , 2008, 2008 Winter Simulation Conference.

[16]  Richard M. Karp,et al.  Dynamic programming meets the principle of inclusion and exclusion , 1982, Oper. Res. Lett..

[17]  Yaron Haviv The road to PetaFLOP clusters , 2006, SC.

[18]  Yiming Ye,et al.  Agents in Electronic Commerce , 2001, Electron. Commer. Res..

[19]  Jesús A. Izaguirre,et al.  Petaflop Computing for Protein Folding , 2001, PPSC.

[20]  David H. Bailey Onward to petaflops computing , 1997, CACM.