End-to-end transmission control by modeling uncertainty about the network state

This paper argues that the bar for the incorporation of a new subnetwork or link technology in the current Internet is much more than the ability to send minimum-sized IP packets: success requires that TCP perform well over any subnetwork. This requirement imposes a number of additional constraints, some hard to meet because TCP's network model is limited and its overall objective challenging to specify precisely. As a result, network evolution has been hampered and the potential of new subnetwork technologies has not been realized in practice. The poor end-to-end performance of many important subnetworks, such as wide-area cellular networks that zealously hide non-congestive losses and introduce enormous delays as a result, or home broadband networks that suffer from the notorious "bufferbloat" problem, are symptoms of this more general issue. We propose an alternate architecture for end-to-end resource management and transmission control, in which the endpoints work directly to achieve a specified goal. Each endpoint treats the network as an nondeterministic automaton whose parameters and topology are uncertain. The end-point maintains a probability distribution on what it thinks the network's configuration may be. At each moment, the endpoint acts to maximize the expected value of a utility function that is given explicitly. We present preliminary simulation results arguing that the approach is tractable and holds promise.

[1]  N.K.G. Samaraweera Non-congestion packet loss detection for TCP error recovery using wireless links , 1999 .

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

[3]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[4]  Joan Feigenbaum,et al.  Mechanism design for policy routing , 2004, PODC '04.

[5]  Lakshminarayanan Subramanian,et al.  One more bit is enough , 2005, SIGCOMM '05.

[6]  Deepak Bansal,et al.  Binomial congestion control algorithms , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[7]  Larry L. Peterson,et al.  TCP Vegas: new techniques for congestion detection and avoidance , 1994 .

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

[9]  Kee-Eung Kim,et al.  Solving POMDPs by Searching the Space of Finite Policies , 1999, UAI.

[10]  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).

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

[12]  Janey C. Hoe Improving the start-up behavior of a congestion control scheme for TCP , 1996, SIGCOMM '96.

[13]  Gorry Fairhurst,et al.  Advice for Internet Subnetwork Designers , 2004, RFC.

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

[15]  Mark Handley,et al.  Equation-based congestion control for unicast applications , 2000, SIGCOMM.

[16]  Nick McKeown,et al.  Architecting for innovation , 2011, CCRV.

[17]  Joan Feigenbaum,et al.  Distributed algorithmic mechanism design: recent results and future directions , 2002, DIALM '02.

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

[19]  Ibrahim Matta,et al.  A Bayesian Approach for TCP to Distinguish Congestion from Wireless Losses , 2003 .

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

[21]  Ibrahim Matta,et al.  Effectiveness of loss labeling in improving TCP performance in wired/wireless networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[22]  Joan Feigenbaum,et al.  A BGP-based mechanism for lowest-cost routing , 2002, PODC '02.

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

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

[25]  Leslie Pack Kaelbling,et al.  Planning and Acting in Partially Observable Stochastic Domains , 1998, Artif. Intell..

[26]  Henning Wiemann,et al.  The LTE link-layer design , 2009, IEEE Communications Magazine.