Cross-Layer Speculative-Parallelization Protocol Architecture for End Systems and Gateways in Computer Networks With Lossy Links

— The throughput degradation of Transport Control Protocol (TCP)/Internet Protocol (IP) networks over lossy links due to the coexistence of congestion losses and link corruption losses is very similar to the degradation of processor performance (i.e., cycle per instruction) due to control hazards in computer design. First, two types of loss events in networks with lossy links are analogous to two possibilities of a branching result in computers (taken vs. not taken). Secondly, both problems result in performance degradations in their applications, i.e., penalties (in clock cycles) in a processor, and throughput degradation (in bits per second) in a TCP/IP network. This has motivated us to apply speculative techniques (i.e., speculating on the outcome of branch predictions), used to overcome control dependencies in a processor, to throughput improvements when lossy links are involved in TCP/IP connections. The objective of this paper is to propose a cross-layer system to improve the network throughput over lossy links. This system consists of protocol-level speculation based algorithms at transport layer, and protocol enhancements at middleware and network layers that provide control and performance parameters to transport layer functions. Simulation results show that, compared to prior research, our proposed system is effective in improving network throughput over lossy links, capable of handling incorrect speculations, fair for other competing ows, backward compatible with legacy networks, and relatively easy to implement.

[1]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[2]  Raj Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[3]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[4]  Sally Floyd,et al.  TCP and explicit congestion notification , 1994, CCRV.

[5]  Srinivasan Seshan,et al.  Improving reliable transport and handoff performance in cellular wireless networks , 1995, Wirel. Networks.

[6]  Nitin H. Vaidya,et al.  Distinguishing congestion losses from wireless transmission losses: a negative result , 1998, Proceedings 7th International Conference on Computer Communications and Networks (Cat. No.98EX226).

[7]  Nitin H. Vaidya,et al.  Discriminating congestion losses from wireless losses using inter-arrival times at the receiver , 1999, Proceedings 1999 IEEE Symposium on Application-Specific Systems and Software Engineering and Technology. ASSET'99 (Cat. No.PR00122).

[8]  K. K. Ramakrishnan,et al.  A Proposal to add Explicit Congestion Notification (ECN) to IP , 1999, RFC.

[9]  Archan Misra,et al.  The window distribution of multiple TCPs with random loss queues , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[10]  Vishal Misra,et al.  Fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED , 2000, SIGCOMM.

[11]  Alhussein A. Abouzeid,et al.  Stochastic modeling of TCP over lossy links , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[12]  Martin May,et al.  Analytic evaluation of RED performance , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[13]  Alhussein A. Abouzeid,et al.  Analytic understanding of RED gateways with multiple competing TCP flows , 2000, Globecom '00 - IEEE. Global Telecommunications Conference. Conference Record (Cat. No.00CH37137).

[14]  Markku Kojo,et al.  End-to-end Performance Implications of Links with Errors Status of this Memo This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. Distribution of this memo is unlimited. , 2001 .

[15]  Raj Jain,et al.  Improving explicit congestion notification with the mark-front strategy , 2001, Comput. Networks.

[16]  Ren Wang,et al.  TCP westwood: Bandwidth estimation for enhanced transport over wireless links , 2001, MobiCom '01.

[17]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2003, TNET.

[18]  Pamela C. Cosman,et al.  End-to-end differentiation of congestion and wireless losses , 2003, TNET.

[19]  Ying Chen,et al.  Using incorrect speculation to prefetch data in a concurrent multithreaded processor , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[20]  Mohammed Atiquzzaman,et al.  Error modeling schemes for fading channels in wireless communications: A survey , 2003, IEEE Communications Surveys & Tutorials.

[21]  Mohammed Atiquzzaman,et al.  Using ECN Marks to Improve TCP Performance over Lossy Links , 2004, ICETE.

[22]  Mohammed Atiquzzaman,et al.  Transport Layer Design in Mobile Wireless Networks , 2005 .