Abstract
A TCP flow is expected to traverse over a single path. This is in order to avoid performance problems especially on account of reordering of packets and acknowledgements. Reordering can occur on account of the use of different paths with diverse bandwidth and delay characteristics. We argue that the present approach prevents us from getting the advantages associated with multiple paths. Specifically, use of multiple paths for a flow can be advantageous in improving the performance as well as the dependability of a flow. We model the effects of reordering and derive conditions under which the performance of a TCP flow improves with the use of multiple paths. We also provide recommendations for choosing amongst multiple paths. We then verify the conditions using simulations. We also illustrate the applicability of the derived conditions to multiple flows.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anjum F. On multiple paths and tcp algorithms. Telcordia Tech. Internal Report, May 2002.
Anjum FM, Tassiulas L. On the behavior of different tcp algorithms over a wireless channel with correlated packet losses. ACM Sigmetrics Atlanta, May 1999.
Balakrishnan H, Padmanabhan VN, Seshan S, Katz RH. A comparison of mechanisms for improving tcp performance over wireless links. IEEE/ACM Transactions on Networking, June 1997.
Balakrishnan H, Seshan S, Katz RH. Improving reliable transport and handoff performance in cellular wireless networks. ACM Wireless Networks, Dec. 1995:14.
Bhagwat P, Bhattacharya P, Krishna A, Tripathi SK. Using channel state dependent scheduling to improve tcp throughput over wireless lans. ACM Wireless Networks 1995;3(1).
Birk Y, Bloch N. Improving network performance with prioritized dispersal. IEEE Infocom 2000.
Blanton E, Allman M. On making tcp more robust to packet reordering. ACM Computer Communication Review, Jan. 2002.
Caceres R, Iftode L. Improving the performance of reliable transport protocols in mobile computing environment. IEEE JSAC, 1994.
Casetti C, Gerla M, Mascolo S, Sanadidi MY, Wang R. Tcp westwood: Bandwidth estimation for enhanced transport over wireless links. Proc. of ACM Mobicom 2001. Rome, Italy, July 2001, 287 297.
Fall K, Floyd S. Comparisions of tahoe, reno and sack tcp. ftp://ftp.ee.lbl.gov, March 1996.
Gustafsson E, Karlsson G. Literature survey on traffic dispersion. IEEE Network, March 1997.
Haas ZJ, Agrawal P. Mobile-tcp: An asymmetric transport protocol design for mobile systems. In: ICC, Montreal, Canada, June 1997.
Krishnan R, Sterbenz J. Tcp over load reactive links. ICNP 2001, Nov. 2001.
Kumar A. Comparative performance analysis of versions of tcp in local network with a lossy link. Tech. Rep. WINLAB-TR 129, Oct. 1996, also TON Aug. 1998:485-498.
Kumar A, Holtzmann J. Comparative performance analysis of versions of tcp in local network with a lossy link, part ii: Rayleigh fading mobile radio link. Tech. Rep. WINLAB-TR 133, Nov. 1996.
Lakshman TV, Madhow U. The performance of tcp/ip for networks with high bandwidth-delay products and random loss. IEEE/ACM Trans. on Networking 1997;5(3):336–350.
Maxemchuck N. Dispersity routing on atm networks. IEEE Infocom 1999.
Maxemchuk N. Dispersity routing. Proc. Int. Communications Conf., 1975:41.10-41.13.
McCreary S, Claffy K. Trends in wide area ip traffic patterns. A view from ames internet exchange. May 2000. http://www.caida.org/ outreach/papers/AIX0005.
Mithal S. Bound on end to end performance via greedy multi-path routing in integrated services networks. IEEE Infocom 1998.
Padhye J, Firoiu V, Towsley D, Kurose J. Modeling tcp throughput: A simple model and its empirical validation. SIGCOMM, Sept. 1998.
Phatak D, Goff T. A novel mechanism for data streaming across multiple ip links for improving throughput and reliability in mobile environments. IEEE Infocom, New York, June 2002.
Reed MG, Syverson PF, Goldschlag DM. Anonymous connections and onion routing. IEEE JSAC, Sp. Issue Copyright and Privacy Protection, 1998.
Rom R, Cidon I, Shavitt Y. Multipath routing combined with resource reservation. IEEE Infocom, 1998.
Schopp M, Jungmaier A, Rathget EP, Tuxen M. Sctp-a multi-link end-to-end protocol for ip-based networks. Intl. Journal of Electronics and Communications 2001;55(1):46–54.
Sivakumar H, Bailey S, Grossman RL. Psockets: The case for application-level network striping for data intensive applications using high speed wide area networks 2000. http://www.citeseer. nj.nec.com/386275.html.
Traw TB, Smith JS. Striping within the network subsystem. IEEE Network, July 1995.
Veres A, Boda M. The chaotic nature of tcp congestion. Infocom 2000, March 2000.
Wang K, Tripathi SK. Mobile-end transport protocol: An alternative to tcp/ip over wireless links. Infocom, April 1998:1046-1053
Zaumen W, Garcia-Luna-Aceves JJ. Loop free multipath routing using generalized diffusing computations. IEEE Infocom, 1998.
Zorzi M, Rao RR. Effect of correlated errors on tcp. Proc. CISS, March 1997:666-671.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Anjum, F.M. TCP Algorithms and Multiple Paths: Considerations for the Future of the Internet. Information Systems Frontiers 6, 91–104 (2004). https://doi.org/10.1023/B:ISFI.0000015877.38130.19
Issue Date:
DOI: https://doi.org/10.1023/B:ISFI.0000015877.38130.19