Skip to main content

Improving the Performance of TCP in the Case of Packet Reordering

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3079))

Abstract

Numerous studies have shown that packet reordering is common, especially in networks where there is high degree of parallelism and different link speeds. Reordering of packets decreases the TCP performance of a network, mainly because it leads to overestimation of the congestion of the network. We consider wired networks and analyze the performance of such networks when reordering of packets occurs. We propose a proactive solution that could significantly improve the performance of the network when reordering of packets occurs. We report results of our simulation experiments, which support this claim. Our solution is based on enabling the senders to distinguished between dropped packets and reordered packets.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chinoy, B.: Dynamics of Internet Routing Information. In: Proceedings of the SIGCOMM (1993)

    Google Scholar 

  2. Jacobson, V.: Congestion Avoidance and Control. In: Proceedings of the SIGCOMM (1988)

    Google Scholar 

  3. Ludwig, R., Katz, R.: The Eifel Algorithm: Making TCP Robust Against Spurious Retransmissions. Computer Communication Review 30(1) (2000)

    Google Scholar 

  4. Floyd, S., Mahdavi, J., Mathis, M., Podolsky, M.: An Extension to the Selective Acknowledgement (SACK) Option for TCP. RFC 2883 (2000)

    Google Scholar 

  5. Allman, M., Paxson, V.: On Estimating End-to-End Network Path Properties. In: Proceedings of the SIGCOMM (1999)

    Google Scholar 

  6. Bennett, J., Partridge, C., Shectman, N.: Packet Reordering is Not Pathological Network Behaviour. IEEE/ACM Transactions on Networking (1999)

    Google Scholar 

  7. McCanne, S., Floyd, S.: Network Simulator, http://www.isi.edu/nsnam/ns/

  8. Sathiaseelan, A., Radzik, T.: RD-TCP: Reorder Detecting TCP. In: Freire, M.M., Lorenz, P., Lee, M.M.-O. (eds.) HSNMC 2003. LNCS, vol. 2720, pp. 471–480. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Blanton, E., Allman, M.: On Making TCP More Robust to Packet Reordering. In: Proceedings of the SIGCOMM (2002)

    Google Scholar 

  10. Postel, J.: Transmission Control Protocol. RFC 793 (1981)

    Google Scholar 

  11. Mogul, J.: Observing TCP Dynamics in Real Networks. In: Proceedings of the SIGCOMM (1992)

    Google Scholar 

  12. Zhang, M., Karp, B., Floyd, S., Peterson, L.: RR-TCP: A Reordering-Robust TCP with DSACK. In: IEEE International Conference on Network Protocols (2003)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sathiaseelan, A., Radzik, T. (2004). Improving the Performance of TCP in the Case of Packet Reordering. In: Mammeri, Z., Lorenz, P. (eds) High Speed Networks and Multimedia Communications. HSNMC 2004. Lecture Notes in Computer Science, vol 3079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25969-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25969-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22262-0

  • Online ISBN: 978-3-540-25969-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics