Skip to main content

RD-TCP: Reorder Detecting TCP

  • Conference paper
High-Speed Networks and Multimedia Communications (HSNMC 2003)

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

Abstract

Numerous studies have shown that packet reordering is common, especially in high speed 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 with transmission that follows predominantly, but not necessarily exclusively, symmetric routing paths, and we analyze the performance of such networks when reordering of packets occurs. We propose an effective 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 to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Paxson, V.: End-to-End Routing Behaviour in the Internet. ACM SIGCOMM (1996)

    Google Scholar 

  2. Estan, C., Varghese, G.: New Directions in Traffic Measurement and Accounting. ACM SIGCOMM (2002)

    Google Scholar 

  3. Jacobson, V.: Congestion Avoidance and Control. ACM SIGCOMM (1988)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  6. Allman, M., Paxson, V.: On Estimating End-to-End Network Path Properties. ACM SIGCOMM (1999)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

  11. Fang, W., Peterson, L.: Inter-as-traffic patterns and their implications. IEEE GLOBECOM (1999)

    Google Scholar 

  12. Allman, M., Balakrishnan, H., Floyd, S.: Enhancing TCP’s Lost Recovery Using Limited Transmit. RFC 3042 (2001)

    Google Scholar 

  13. Cisco NetFlow, http://www.cisco.com/warp/public/732/Tech/netflow

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sathiaseelan, A., Radzik, T. (2003). RD-TCP: Reorder Detecting TCP. In: Freire, M.M., Lorenz, P., Lee, M.MO. (eds) High-Speed Networks and Multimedia Communications. HSNMC 2003. Lecture Notes in Computer Science, vol 2720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45076-4_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45076-4_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40542-9

  • Online ISBN: 978-3-540-45076-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics