Abstract
Protocol design and modification was traditionally based on heuristic processes and decisions. In particular several new versions of TCP have been proposed which not always stand up to their expectations when they are deployed or simply simulated in a real scenario. The closed-loop, nonlinear characteristics of TCP makes it very difficult to predict its performance in even simple scenarios. This papers analyses the process of modeling TCP-SACK with an Open Multiclass Queueing Network (OMQN) model, showing that sometimes simple implementation choices can have a non-marginal impact on the performance and discussing how an analytical model can be used to design and study TCP (or other protocols) modifications and improvements. As an example we present a modified, more robust implementation of TCP-SACK, named R-SACK, that significantly reduces the protocol timeout probability in presence of bursty losses.
This work was supported by the ItalianMinistry for Education and Scientific Research through the PLANET-IP Project.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Mathis, J. Mahdavi, S. Floyd, A. Romanow, “TCP Selective Acknowledgement Options,” RFC 2018, IETF, Oct. 1996.
L. Brakmo, L. Peterson, “TCP Vegas: End to End Congestion Avoidance on a Global Internet,” IEEE Journal on Selected Areas in Communications, 13(8), Oct. 1995.
M. Mathis, J. Mahdavi, “Forward Acknowledgement: Refining TCP Congestion Control,” Computer Communications Review, 26(4), 1996.
S. Floyd, “TCP and Explicit Congestion Notification,” ACM Computer Communication Review, Vol. 24 No. 5, Pages 10–23, Oct. 1994.
K.K. Ramakrishnan, S. Floyd, “A Proposal to add Explicit Congestion Notification (ECN) to IP,” RFC 2481, IETF, Jan. 1999.
M. Gerla, M.Y. Sanadidi, R. Wang, A. Zanella, C. Casetti, S. Mascolo, “TCPWestwood: Congestion Window Control Using Bandwidth Estimation,” In Proc. of IEEE Globecom 2001, San Antonio, Texas, USA, Nov. 25–29, 2001.
C. Casetti, M. Gerla, S. Mascolo, M.Y. Sanadidi, R. Wang, “TCP Westwood: End-to-End Congestion Control for Wired/Wireless Network,” ACM Wireless Networks (WINET) N. 8, pp. 467–479, 2002.
L.A. Grieco, S. Mascolo, R. Ferorelli, “Additive Increase Adaptive Decrease Congestion Control: a mathematical model and its experimental validation,” In Proc. IEEE Symposium on Computer and Communications, Taormina, Italy, July 1–4, 2002.
L. Kalampoukas, A. Varma, K.K. Ramakrishnan, “Explicit Window Adaptation: A Method to Enhance TCP Performance,” In Proc. IEEE Infocom’98, San Francesco, CA, USA, March 29–April 2, 1998.
M. Gerla, R. Lo Cigno, S. Mascolo, W. Weng, “Generalized Window Advertising for TCP Congestion Control,” European Transaction on Telecommunication, Accepted for Publication, preprint available, http://www.tlc-networks.polito.it/locigno/papers/ett01.ps.
W. Stevens, “TCP Slow Start, Congestion Avoidance, Fast Retransmit, and Fast Recovery Algorithms,” RFC 2001, IETF, Jan. 1997.
T. Bu, D. Towsley, “Fixed Point Approximation for TCP Behavior in an AQM Network,” ACM SIGMETRICS 2001, June 16–20, Cambridge, MA, USA.
R. Lo Cigno, M. Gerla, “Modeling Window Based Congestion Control Protocols with Many Flows”, Performance Evaluation, No. 36–37, pp. 289–306, Elsevier Science, Aug. 1999.
M. Garetto, R. Lo Cigno, M. Meo, M. Ajmone Marsan, “A Detailed and Accurate Closed Queueing NetworkModel ofMany Interacting TCP Flows,” in Proc. IEEE Infocom’01, April 22–26, Anchorage, Alaska, USA.
E. Alessio, M. Garetto, R. Lo Cigno, M. Meo, M. Ajmone Marsan, “Analytical Estimation of the Completion Time of Mixed NewReno and Tahoe TCP Traffic over Single and Multiple Bottleneck Networks,” in Proc. of IEEE Globecom 2001, San Antonio, Texas, November 25–29, 2001.
M. Garetto, R. Lo Cigno, M. Meo, M. Ajmone Marsan, “On the Use of Queueing Network Models to Predict the Performance of TCP Connections,” Proc. 2001 Tyrrhenian International Workshop on Digital Communications, Taormina (CT), Italy, Sept. 17–20, 2001.
M. Garetto, R. Lo Cigno, M. Meo, E. Alessio, M. Ajmone Marsan, “Modeling Short-Lived TCP Connections with Open Multiclass Queueing Networks,” 7th International Workshop on Protocols For High-Speed Networks (PfHSN 2002), Berlin, Germany, April 22–24, 2002.
R. Lo Cigno, G. Procissi, M. Gerla, “Sender-Side TCP Modifications: An Analytical Study,” IFIP Networking 2002, Pisa (Italy), May 19–24, 2002.
K. Fall, S. Floyd, “Simulation-based Comparisons of Tahoe, Reno and SACK TCP,” ACM Computer Communication Review, July 1996.
E. Blanton, M. Allman, K. Fall, “A Conservative SACK-based Loss Recovery Algorithm for TCP,” IETF Internet Draft (work in progress), July 2002, http://www.ietf.org/internet-drafts/draft-allman-tcp-sack-12.txt
B. Sikdar, S. Kalyanaraman, K. S. Vastola, “Analytic Models and Comparative Study of the Latency and Steady-State Throughput of TCP Tahoe, Reno and SACK,” in Proc. of IEEE Globecom 2001, San Antonio, Texas, November 25–29, 2001.
W.R. Stevens. TCP/IP Illustrated, vol. 1. Addison Wesley, Reading, MA, USA, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bagnus, M., Lo Cigno, R. (2003). TCP-SACK Analysis and Improvement through OMQN Models. In: Marsan, M.A., Corazza, G., Listanti, M., Roveri, A. (eds) Quality of Service in Multiservice IP Networks. QoS-IP 2003. Lecture Notes in Computer Science, vol 2601. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36480-3_29
Download citation
DOI: https://doi.org/10.1007/3-540-36480-3_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00604-6
Online ISBN: 978-3-540-36480-1
eBook Packages: Springer Book Archive