Application level relay for high-bandwidth data transport

Data intensive applications require massive amount of data to be transported over shared wide area networks. Traditional network congestion control and routing schemes have proven inadequate for fully utilizing available network resource for high-bandwidth data transport. In this work, we explore the flexibility of control at the application layer and propose various application level data relay schemes to largely improve the data throughput by optimally integrating application level routing and transport layer control. The proposed algorithms can be easily implemented in overlay networks. Preliminary experiments have shown that our relay schemes are efficient in utilizing network resource for high-bandwidth data transport. The impact of application level relays on the underlay network is also discussed.

[1]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[2]  Brian D. Noble,et al.  Improving throughput and maintaining fairness using parallel TCP , 2004, IEEE INFOCOM 2004.

[3]  Laurent Massoulié,et al.  Stability of distributed congestion control with heterogeneous feedback delays , 2002, IEEE Trans. Autom. Control..

[4]  Randy H. Katz,et al.  OverQoS: An Overlay Based Architecture for Enhancing Internet QoS , 2004, NSDI.

[5]  François Baccelli,et al.  Scalability of reliable group communication using overlays , 2004, IEEE INFOCOM 2004.

[6]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[7]  Peter Steenkiste,et al.  Routing high-bandwidth traffic in max-min fair share networks , 1996, SIGCOMM 1996.

[8]  Stefan Savage,et al.  The end-to-end effects of Internet path selection , 1999, SIGCOMM '99.

[9]  Donald F. Towsley,et al.  On designing improved controllers for AQM routers supporting TCP flows , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[11]  Prabhakar Raghavan,et al.  Provably good routing in graphs: regular arrays , 1985, STOC '85.

[12]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[13]  Cheng Jin,et al.  FAST TCP: Motivation, Architecture, Algorithms, Performance , 2006, IEEE/ACM Transactions on Networking.

[14]  Akihiro Nakao,et al.  A routing underlay for overlay networks , 2003, SIGCOMM '03.

[15]  Jeffrey M. Jaffe,et al.  Bottleneck Flow Control , 1981, IEEE Trans. Commun..

[16]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[17]  Jean-Yves Le Boudec,et al.  Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[18]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[19]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[20]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[21]  Donald F. Towsley,et al.  Modeling TCP throughput: a simple model and its empirical validation , 1998, SIGCOMM '98.

[22]  John W. Byers,et al.  ROMA: reliable overlay multicast with loosely coupled TCP connections , 2004, IEEE INFOCOM 2004.

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

[24]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[25]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.

[26]  Ramesh Johari,et al.  End-to-end congestion control for the internet: delays and stability , 2001, TNET.

[27]  Satish K. Tripathi,et al.  Split TCP for mobile ad hoc networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[28]  Jian Liu,et al.  ATCP: TCP for mobile ad hoc networks , 2001, IEEE J. Sel. Areas Commun..

[29]  Prashant J. Shenoy,et al.  On the impact of concurrent downloads , 2001, Proceeding of the 2001 Winter Simulation Conference (Cat. No.01CH37304).

[30]  Weibo Gong,et al.  Challenges to congestion control posed by concurrent downloads , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[31]  Bobby Bhattacharjee,et al.  Scalable application layer multicast , 2002, SIGCOMM 2002.

[32]  Ariel Orda,et al.  Computing shortest paths for any number of hops , 2002, TNET.