Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Connections with multiple congested gateways in packet-switched networks part 1: one-way traffic
ACM SIGCOMM Computer Communication Review
End-to-end routing behavior in the Internet
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
End-to-end Internet packet dynamics
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Analysis of TCP performance over mobile ad hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
A comparison of TCP performance over three routing protocols for mobile ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
The Eifel algorithm: making TCP robust against spurious retransmissions
ACM SIGCOMM Computer Communication Review
On making TCP more robust to packet reordering
ACM SIGCOMM Computer Communication Review
Improving TCP performance over mobile ad-hoc networks with out-of-order detection and response
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Analytic models for the latency and steady-state throughput of TCP tahoe, Reno, and SACK
IEEE/ACM Transactions on Networking (TON)
Denial of service resilience in ad hoc networks
Proceedings of the 10th annual international conference on Mobile computing and networking
Improving TCP performance over wireless networks with collaborative multi-homed mobile hosts
Proceedings of the 3rd international conference on Mobile systems, applications, and services
IEEE Transactions on Mobile Computing
Concurrent multipath transfer using SCTP multihoming over independent end-to-end paths
IEEE/ACM Transactions on Networking (TON)
Performance implications of a bounded receive buffer in concurrent multipath transfer
Computer Communications
Novel approaches to end-to-end packet reordering measurement
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Robust TCP stream reassembly in the presence of adversaries
SSYM'05 Proceedings of the 14th conference on USENIX Security Symposium - Volume 14
TCP-M: multiflow transmission control protocol for ad hoc networks
EURASIP Journal on Wireless Communications and Networking
Game Theoretic Stochastic Routing for Fault Tolerance and Security in Computer Networks
IEEE Transactions on Parallel and Distributed Systems
PRISM: Improving the Performance of Inverse-Multiplexed TCP in Wireless Networks
IEEE Transactions on Mobile Computing
Improving performance of transport protocols in multipath transferring schemes
Computer Communications
Impact of denial of service attacks on ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Packet reordering in high-speed networks and its impact on high-speed TCP variants
Computer Communications
A thin-layer protocol for utilizing multiple paths
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Reorder density (RD): a formal, comprehensive metric for packet reordering
NETWORKING'05 Proceedings of the 4th IFIP-TC6 international conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communication Systems
Review: An initiative for a classified bibliography on TCP/IP congestion control
Journal of Network and Computer Applications
| Hi-index | 0.00 |
Most standard implementations of TCP perform poorly when packets are reordered.In this paper, wepropose a new version of TCP that maintains highthroughput when reordering occurs and yet, whenpacket reordering does not occur, is friendly to otherversions of TCP.The proposed TCP variant, or TCP-PR,does not rely on duplicate acknowledgements to detecta packet loss.Instead, timers are maintained to keeptrack of how long ago a packet was transmitted.Incase the corresponding acknowledgement has not yetarrived and the elapsed time since the packet was sentis larger than a given threshold, the packet is assumedlost.Because TCP-PR does not rely on duplicateackowledgments, packet reordering (including out-of-orderacknowledgments) has no effect on TCP-PR'sperformance.Through extensive simulations, we show that TCP-PRperforms consistently better than existing mechanismsthat try to make TCP more robust to packet reordering.When the case that packets are not reordered, we verifythat TCP-PR maintains the same throughput as typicalimplementations of TCP (specifically, TCP-SACK) andshares network resources fairly.