Congestion control and network management in Future Internet

Future Internet research programs try to ignore and overcome the barriers of incremental development and encourage clean slate designs, propose new visions, architectures and paradigms for the coming 10-20 years. Recent results in congestion control research has shown that networks operating without explicit congestion control (like TCP) may survive without congestion collapse if appropriately designed in network resources and if end systems apply appropriate erasure coding schemes. The exponential growth of the Internet makes it virtually impossible to manage the network with traditional centralized approaches (like the manager-agent one); hence research results of complex networks are expected to spread over the Internet with its autonomic behaviors. In this article we give overview and outlook of some interesting research areas connected to the future Internet research. � INVITED PAPER

[1]  Injong Rhee,et al.  CUBIC: a new TCP-friendly high-speed TCP variant , 2008, OPSR.

[2]  S. Milgram BEHAVIORAL STUDY OF OBEDIENCE. , 1963, Journal of abnormal psychology.

[3]  Balázs Sonkoly,et al.  A comprehensive TCP fairness analysis in high speed networks , 2009, Comput. Commun..

[4]  Injong Rhee,et al.  Binary increase congestion control (BIC) for fast long-distance networks , 2004, IEEE INFOCOM 2004.

[5]  Tom Kelly,et al.  Scalable TCP: improving performance in highspeed wide area networks , 2003, CCRV.

[6]  Venkatesan Muthukumar,et al.  Hybrid greedy/face routing for ad-hoc sensor network , 2004 .

[7]  Sally Floyd,et al.  HighSpeed TCP for Large Congestion Windows , 2003, RFC.

[8]  Qian Zhang,et al.  A Compound TCP Approach for High-Speed and Long Distance Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[9]  Richard G. Baraniuk,et al.  TCP-Africa: an adaptive and fair rapid increase rule for scalable TCP , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[10]  Scott Shenker,et al.  Approximate fairness through differential dropping , 2003, CCRV.

[11]  Alexandre Proutière,et al.  Is the ''Law of the Jungle'' Sustainable for the Internet? , 2009, IEEE INFOCOM 2009.

[12]  Van Jacobson,et al.  The synchronization of periodic routing messages , 1993, SIGCOMM '93.

[13]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[14]  Sharon L. Milgram,et al.  The Small World Problem , 1967 .

[15]  R. Srikant,et al.  TCP-Illinois: A loss- and delay-based congestion control algorithm for high-speed networks , 2008, Perform. Evaluation.

[16]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM '02.

[17]  Ren Wang,et al.  TCP with sender-side intelligence to handle dynamic, large, leaky pipes , 2005, IEEE Journal on Selected Areas in Communications.

[18]  B. Bollobás The evolution of random graphs , 1984 .

[19]  Cédric Westphal,et al.  Scalable Routing Via Greedy Embedding , 2009, IEEE INFOCOM 2009.