Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Analysis of the increase and decrease algorithms for congestion avoidance in computer networks
Computer Networks and ISDN Systems
Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Simulation-based comparisons of Tahoe, Reno and SACK TCP
ACM SIGCOMM Computer Communication Review
Modeling TCP throughput: a simple model and its empirical validation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Differentiated end-to-end Internet services using a weighted proportional fair sharing TCP
ACM SIGCOMM Computer Communication Review
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Equation-based congestion control for unicast applications
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Some observations on the dynamics of a congestion control algorithm
ACM SIGCOMM Computer Communication Review
Understanding the performance of many TCP flows
Computer Networks: The International Journal of Computer and Telecommunications Networking
End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput
IEEE/ACM Transactions on Networking (TON)
MPAT: Aggregate TCP Congestion Management as a Building Block for Internet QoS
ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
End-to-end concurrent multipath transfer using transport layer multihoming
End-to-end concurrent multipath transfer using transport layer multihoming
Concurrent multipath transfer using SCTP multihoming over independent end-to-end paths
IEEE/ACM Transactions on Networking (TON)
Flow rate fairness: dismantling a religion
ACM SIGCOMM Computer Communication Review
Why TCP timers (still) don't work well
Computer Networks: The International Journal of Computer and Telecommunications Networking
Probe-Aided MulTCP: an aggregate congestion control mechanism
ACM SIGCOMM Computer Communication Review
Impact of retransmission mechanisms on the performance of SCTP and TCP
AMCOS'05 Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science
Multistreamed web transport for developing regions
Proceedings of the second ACM SIGCOMM workshop on Networked systems for developing regions
MulTFRC: providing weighted fairness for multimediaapplications (and others too!)
ACM SIGCOMM Computer Communication Review
Leveraging innovative transport layer services for improved application performance
Leveraging innovative transport layer services for improved application performance
LS-SCTP: a bandwidth aggregation technique for stream control transmission protocol
Computer Communications
| Hi-index | 0.00 |
In prior work, a CMT protocol using SCTP multihoming (termed SCTP-based CMT) was proposed and investigated for improving application throughput. SCTP-based CMT was studied in (bottleneck-independent) wired networking scenarios with ns-2 simulations. This paper studies the TCP-friendliness of CMT in the Internet. In this paper, we surveyed historical developments of the TCP-friendliness concept and argued that the original TCP-friendliness doctrine should be extended to incorporate multihoming and SCTP-based CMT. Since CMT is based on (single-homed) SCTP, we first investigated TCP-friendliness of single-homed SCTP. We discovered that although SCTP's congestion control mechanisms were intended to be ''similar'' to TCP's, being a newer protocol, SCTP specification has some of the proposed TCP enhancements already incorporated which results in SCTP performing better than TCP. Therefore, SCTP obtains larger share of the bandwidth when competing with a TCP flavor that does not have similar enhancements. We concluded that SCTP is TCP-friendly, but achieves higher throughput than TCP, due to SCTP's better loss recovery mechanisms just as TCP-SACK and TCP-Reno perform better than TCP-Tahoe. We then investigated the TCP-friendliness of CMT. Via QualNet simulations, we found out that one two-homed CMT association has similar or worse performance (for smaller number of competing TCP flows) than the aggregated performance of two independent, single-homed SCTP associations while sharing the link with other TCP connections, for the reason that a CMT flow creates a burstier data traffic than independent SCTP flows. When compared to the aggregated performance of two-independent TCP connections, one two-homed CMT obtains a higher share of the tight link bandwidth because of better loss recovery mechanisms in CMT. In addition, sharing of ACK information makes CMT more resilient to losses. Although CMT obtains higher throughput than two independent TCP flows, CMT's AIMD-based congestion control mechanism allows other TCP flows to co-exist in the network. Therefore, we concluded that CMT is TCP-friendly, similar to two TCP-Reno flows are TCP-friendly when compared to two TCP-Tahoe flows.